./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1aa5ccf491fa19757c49751a869c16c8e81ee57a7445aa2b11849a454021fdb2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:58:27,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:58:27,353 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:58:27,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:58:27,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:58:27,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:58:27,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:58:27,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:58:27,382 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:58:27,382 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:58:27,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:58:27,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:58:27,382 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:58:27,382 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:58:27,383 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:58:27,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:58:27,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:58:27,383 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:58:27,383 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:58:27,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:58:27,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:58:27,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:58:27,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:58:27,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:58:27,384 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:58:27,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:58:27,384 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:58:27,384 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:58:27,384 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:58:27,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:58:27,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:58:27,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:58:27,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:58:27,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:58:27,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:58:27,385 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:58:27,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:58:27,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:58:27,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:58:27,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:58:27,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:58:27,386 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:58:27,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:58:27,386 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1aa5ccf491fa19757c49751a869c16c8e81ee57a7445aa2b11849a454021fdb2 [2025-02-05 22:58:27,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:58:27,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:58:27,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:58:27,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:58:27,702 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:58:27,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2025-02-05 22:58:29,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f29f05b16/708ec61bceaa4e8795cdd60a7e2b3fc7/FLAG0d8253ba9 [2025-02-05 22:58:29,420 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:58:29,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2025-02-05 22:58:29,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f29f05b16/708ec61bceaa4e8795cdd60a7e2b3fc7/FLAG0d8253ba9 [2025-02-05 22:58:29,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f29f05b16/708ec61bceaa4e8795cdd60a7e2b3fc7 [2025-02-05 22:58:29,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:58:29,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:58:29,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:58:29,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:58:29,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:58:29,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22cac7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29, skipping insertion in model container [2025-02-05 22:58:29,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:58:29,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2025-02-05 22:58:29,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:58:29,725 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:58:29,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2025-02-05 22:58:29,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:58:29,805 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:58:29,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29 WrapperNode [2025-02-05 22:58:29,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:58:29,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:58:29,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:58:29,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:58:29,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,882 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2025-02-05 22:58:29,883 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:58:29,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:58:29,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:58:29,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:58:29,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,914 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:58:29,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,923 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:58:29,943 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:58:29,943 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:58:29,944 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:58:29,945 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29" (1/1) ... [2025-02-05 22:58:29,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:58:29,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:58:29,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:58:29,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:58:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:58:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:58:29,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:58:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:58:29,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:58:29,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:58:30,071 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:58:30,073 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:58:30,523 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 22:58:30,523 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:58:30,542 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:58:30,543 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 22:58:30,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:58:30 BoogieIcfgContainer [2025-02-05 22:58:30,543 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:58:30,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:58:30,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:58:30,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:58:30,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:58:29" (1/3) ... [2025-02-05 22:58:30,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22932837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:58:30, skipping insertion in model container [2025-02-05 22:58:30,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:29" (2/3) ... [2025-02-05 22:58:30,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22932837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:58:30, skipping insertion in model container [2025-02-05 22:58:30,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:58:30" (3/3) ... [2025-02-05 22:58:30,552 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2025-02-05 22:58:30,565 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:58:30,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:58:30,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:58:30,637 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23b124bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:58:30,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:58:30,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 22:58:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 22:58:30,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:58:30,655 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:58:30,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:58:30,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:58:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1216834269, now seen corresponding path program 1 times [2025-02-05 22:58:30,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:58:30,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75993012] [2025-02-05 22:58:30,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:30,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:58:30,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 22:58:30,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 22:58:30,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:30,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-05 22:58:31,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:58:31,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75993012] [2025-02-05 22:58:31,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75993012] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:58:31,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986660413] [2025-02-05 22:58:31,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:31,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:58:31,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:58:31,073 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:58:31,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:58:31,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 22:58:31,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 22:58:31,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:31,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:31,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:58:31,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:58:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-05 22:58:31,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:58:31,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986660413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:58:31,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:58:31,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:58:31,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167532980] [2025-02-05 22:58:31,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:58:31,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:58:31,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:58:31,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:58:31,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:58:31,365 INFO L87 Difference]: Start difference. First operand has 89 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:58:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:58:31,392 INFO L93 Difference]: Finished difference Result 172 states and 291 transitions. [2025-02-05 22:58:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:58:31,395 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2025-02-05 22:58:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:58:31,402 INFO L225 Difference]: With dead ends: 172 [2025-02-05 22:58:31,402 INFO L226 Difference]: Without dead ends: 86 [2025-02-05 22:58:31,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:58:31,410 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:58:31,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:58:31,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-05 22:58:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-05 22:58:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 22:58:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 131 transitions. [2025-02-05 22:58:31,455 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 131 transitions. Word has length 164 [2025-02-05 22:58:31,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:58:31,456 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 131 transitions. [2025-02-05 22:58:31,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:58:31,456 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 131 transitions. [2025-02-05 22:58:31,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 22:58:31,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:58:31,460 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:58:31,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 22:58:31,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:58:31,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:58:31,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:58:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1436940543, now seen corresponding path program 1 times [2025-02-05 22:58:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:58:31,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994098426] [2025-02-05 22:58:31,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:31,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:58:31,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 22:58:31,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 22:58:31,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:31,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:58:31,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:58:31,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994098426] [2025-02-05 22:58:31,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994098426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:58:31,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:58:31,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:58:31,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683232090] [2025-02-05 22:58:31,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:58:31,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:58:31,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:58:31,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:58:31,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:58:31,955 INFO L87 Difference]: Start difference. First operand 86 states and 131 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:58:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:58:32,022 INFO L93 Difference]: Finished difference Result 215 states and 327 transitions. [2025-02-05 22:58:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:58:32,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2025-02-05 22:58:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:58:32,028 INFO L225 Difference]: With dead ends: 215 [2025-02-05 22:58:32,028 INFO L226 Difference]: Without dead ends: 132 [2025-02-05 22:58:32,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:58:32,029 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 54 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:58:32,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 232 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:58:32,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-05 22:58:32,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2025-02-05 22:58:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 100 states have (on average 1.43) internal successors, (143), 101 states have internal predecessors, (143), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 22:58:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 195 transitions. [2025-02-05 22:58:32,060 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 195 transitions. Word has length 164 [2025-02-05 22:58:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:58:32,061 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 195 transitions. [2025-02-05 22:58:32,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:58:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 195 transitions. [2025-02-05 22:58:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 22:58:32,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:58:32,065 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:58:32,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:58:32,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:58:32,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:58:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1633454048, now seen corresponding path program 1 times [2025-02-05 22:58:32,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:58:32,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829111346] [2025-02-05 22:58:32,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:32,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:58:32,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 22:58:32,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 22:58:32,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:32,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:58:32,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:58:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829111346] [2025-02-05 22:58:32,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829111346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:58:32,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:58:32,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:58:32,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209435652] [2025-02-05 22:58:32,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:58:32,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:58:32,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:58:32,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:58:32,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:58:32,281 INFO L87 Difference]: Start difference. First operand 129 states and 195 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:58:32,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:58:32,323 INFO L93 Difference]: Finished difference Result 257 states and 391 transitions. [2025-02-05 22:58:32,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:58:32,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2025-02-05 22:58:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:58:32,329 INFO L225 Difference]: With dead ends: 257 [2025-02-05 22:58:32,329 INFO L226 Difference]: Without dead ends: 131 [2025-02-05 22:58:32,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:58:32,333 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:58:32,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:58:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-05 22:58:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-05 22:58:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 22:58:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 197 transitions. [2025-02-05 22:58:32,357 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 197 transitions. Word has length 164 [2025-02-05 22:58:32,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:58:32,358 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 197 transitions. [2025-02-05 22:58:32,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:58:32,358 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 197 transitions. [2025-02-05 22:58:32,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 22:58:32,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:58:32,360 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:58:32,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:58:32,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:58:32,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:58:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash 109162858, now seen corresponding path program 1 times [2025-02-05 22:58:32,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:58:32,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046230463] [2025-02-05 22:58:32,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:32,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:58:32,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 22:58:32,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 22:58:32,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:32,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:58:32,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:58:32,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046230463] [2025-02-05 22:58:32,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046230463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:58:32,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:58:32,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:58:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989828286] [2025-02-05 22:58:32,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:58:32,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:58:32,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:58:32,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:58:32,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:58:32,703 INFO L87 Difference]: Start difference. First operand 131 states and 197 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:58:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:58:32,906 INFO L93 Difference]: Finished difference Result 385 states and 581 transitions. [2025-02-05 22:58:32,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:58:32,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-02-05 22:58:32,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:58:32,910 INFO L225 Difference]: With dead ends: 385 [2025-02-05 22:58:32,911 INFO L226 Difference]: Without dead ends: 257 [2025-02-05 22:58:32,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:58:32,913 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 119 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:58:32,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 293 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:58:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-05 22:58:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 157. [2025-02-05 22:58:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 128 states have (on average 1.4453125) internal successors, (185), 129 states have internal predecessors, (185), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 22:58:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 237 transitions. [2025-02-05 22:58:32,943 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 237 transitions. Word has length 165 [2025-02-05 22:58:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:58:32,944 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 237 transitions. [2025-02-05 22:58:32,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:58:32,945 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 237 transitions. [2025-02-05 22:58:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 22:58:32,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:58:32,948 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:58:32,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:58:32,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:58:32,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:58:32,950 INFO L85 PathProgramCache]: Analyzing trace with hash 238245577, now seen corresponding path program 1 times [2025-02-05 22:58:32,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:58:32,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989693918] [2025-02-05 22:58:32,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:32,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:58:32,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 22:58:33,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 22:58:33,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:33,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:58:33,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:58:33,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989693918] [2025-02-05 22:58:33,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989693918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:58:33,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:58:33,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:58:33,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584375494] [2025-02-05 22:58:33,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:58:33,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:58:33,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:58:33,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:58:33,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:58:33,607 INFO L87 Difference]: Start difference. First operand 157 states and 237 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:58:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:58:33,985 INFO L93 Difference]: Finished difference Result 459 states and 679 transitions. [2025-02-05 22:58:33,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:58:33,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2025-02-05 22:58:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:58:33,993 INFO L225 Difference]: With dead ends: 459 [2025-02-05 22:58:33,995 INFO L226 Difference]: Without dead ends: 305 [2025-02-05 22:58:33,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:58:33,997 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 207 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:58:33,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 252 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:58:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-05 22:58:34,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 258. [2025-02-05 22:58:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 218 states have (on average 1.4357798165137614) internal successors, (313), 221 states have internal predecessors, (313), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 22:58:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 383 transitions. [2025-02-05 22:58:34,038 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 383 transitions. Word has length 165 [2025-02-05 22:58:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:58:34,038 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 383 transitions. [2025-02-05 22:58:34,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:58:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 383 transitions. [2025-02-05 22:58:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 22:58:34,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:58:34,041 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:58:34,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:58:34,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:58:34,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:58:34,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1125749258, now seen corresponding path program 1 times [2025-02-05 22:58:34,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:58:34,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367974646] [2025-02-05 22:58:34,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:34,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:58:34,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 22:58:34,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 22:58:34,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:34,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:58:34,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:58:34,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367974646] [2025-02-05 22:58:34,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367974646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:58:34,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:58:34,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:58:34,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994634452] [2025-02-05 22:58:34,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:58:34,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:58:34,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:58:34,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:58:34,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:58:34,787 INFO L87 Difference]: Start difference. First operand 258 states and 383 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:58:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:58:35,247 INFO L93 Difference]: Finished difference Result 712 states and 1035 transitions. [2025-02-05 22:58:35,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:58:35,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-02-05 22:58:35,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:58:35,252 INFO L225 Difference]: With dead ends: 712 [2025-02-05 22:58:35,252 INFO L226 Difference]: Without dead ends: 457 [2025-02-05 22:58:35,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:58:35,253 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 302 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:58:35,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 343 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:58:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-02-05 22:58:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 412. [2025-02-05 22:58:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 326 states have (on average 1.3773006134969326) internal successors, (449), 332 states have internal predecessors, (449), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-05 22:58:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 597 transitions. [2025-02-05 22:58:35,324 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 597 transitions. Word has length 165 [2025-02-05 22:58:35,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:58:35,324 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 597 transitions. [2025-02-05 22:58:35,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:58:35,325 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 597 transitions. [2025-02-05 22:58:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 22:58:35,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:58:35,328 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:58:35,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:58:35,328 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:58:35,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:58:35,329 INFO L85 PathProgramCache]: Analyzing trace with hash 320513771, now seen corresponding path program 1 times [2025-02-05 22:58:35,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:58:35,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742323765] [2025-02-05 22:58:35,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:35,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:58:35,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 22:58:35,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 22:58:35,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:35,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:58:35,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:58:35,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742323765] [2025-02-05 22:58:35,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742323765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:58:35,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:58:35,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:58:35,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031781551] [2025-02-05 22:58:35,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:58:35,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:58:35,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:58:35,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:58:35,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:58:35,495 INFO L87 Difference]: Start difference. First operand 412 states and 597 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:58:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:58:35,689 INFO L93 Difference]: Finished difference Result 821 states and 1191 transitions. [2025-02-05 22:58:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:58:35,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-02-05 22:58:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:58:35,693 INFO L225 Difference]: With dead ends: 821 [2025-02-05 22:58:35,693 INFO L226 Difference]: Without dead ends: 412 [2025-02-05 22:58:35,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:58:35,697 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 119 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:58:35,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 181 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:58:35,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-02-05 22:58:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 407. [2025-02-05 22:58:35,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 321 states have (on average 1.3644859813084111) internal successors, (438), 327 states have internal predecessors, (438), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-05 22:58:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 586 transitions. [2025-02-05 22:58:35,757 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 586 transitions. Word has length 165 [2025-02-05 22:58:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:58:35,759 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 586 transitions. [2025-02-05 22:58:35,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:58:35,761 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 586 transitions. [2025-02-05 22:58:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 22:58:35,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:58:35,763 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:58:35,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:58:35,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:58:35,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:58:35,763 INFO L85 PathProgramCache]: Analyzing trace with hash 449596490, now seen corresponding path program 1 times [2025-02-05 22:58:35,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:58:35,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493020556] [2025-02-05 22:58:35,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:35,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:58:35,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 22:58:35,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 22:58:35,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:35,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:58:36,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:58:36,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493020556] [2025-02-05 22:58:36,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493020556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:58:36,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:58:36,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 22:58:36,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244039609] [2025-02-05 22:58:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:58:36,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 22:58:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:58:36,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 22:58:36,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:58:36,863 INFO L87 Difference]: Start difference. First operand 407 states and 586 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:58:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:58:38,267 INFO L93 Difference]: Finished difference Result 1627 states and 2306 transitions. [2025-02-05 22:58:38,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:58:38,267 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2025-02-05 22:58:38,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:58:38,278 INFO L225 Difference]: With dead ends: 1627 [2025-02-05 22:58:38,279 INFO L226 Difference]: Without dead ends: 1223 [2025-02-05 22:58:38,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:58:38,285 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 659 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:58:38,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 600 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 22:58:38,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-02-05 22:58:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 770. [2025-02-05 22:58:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 606 states have (on average 1.363036303630363) internal successors, (826), 618 states have internal predecessors, (826), 143 states have call successors, (143), 20 states have call predecessors, (143), 20 states have return successors, (143), 131 states have call predecessors, (143), 143 states have call successors, (143) [2025-02-05 22:58:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1112 transitions. [2025-02-05 22:58:38,424 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1112 transitions. Word has length 165 [2025-02-05 22:58:38,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:58:38,424 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1112 transitions. [2025-02-05 22:58:38,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:58:38,425 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1112 transitions. [2025-02-05 22:58:38,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 22:58:38,428 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:58:38,429 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:58:38,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:58:38,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:58:38,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:58:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1337100171, now seen corresponding path program 1 times [2025-02-05 22:58:38,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:58:38,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513170584] [2025-02-05 22:58:38,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:38,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:58:38,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 22:58:38,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 22:58:38,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:38,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-05 22:58:39,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:58:39,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513170584] [2025-02-05 22:58:39,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513170584] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:58:39,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251970247] [2025-02-05 22:58:39,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:39,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:58:39,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:58:39,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:58:39,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:58:39,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 22:58:39,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 22:58:39,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:39,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:39,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 22:58:39,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:58:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 694 proven. 129 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2025-02-05 22:58:40,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:58:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-02-05 22:58:41,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251970247] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:58:41,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:58:41,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 15] total 37 [2025-02-05 22:58:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092255716] [2025-02-05 22:58:41,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:58:41,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-05 22:58:41,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:58:41,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-05 22:58:41,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1046, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 22:58:41,363 INFO L87 Difference]: Start difference. First operand 770 states and 1112 transitions. Second operand has 37 states, 35 states have (on average 3.742857142857143) internal successors, (131), 35 states have internal predecessors, (131), 9 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (58), 8 states have call predecessors, (58), 9 states have call successors, (58) [2025-02-05 22:58:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:58:48,016 INFO L93 Difference]: Finished difference Result 2778 states and 3834 transitions. [2025-02-05 22:58:48,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2025-02-05 22:58:48,017 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 3.742857142857143) internal successors, (131), 35 states have internal predecessors, (131), 9 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (58), 8 states have call predecessors, (58), 9 states have call successors, (58) Word has length 165 [2025-02-05 22:58:48,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:58:48,027 INFO L225 Difference]: With dead ends: 2778 [2025-02-05 22:58:48,028 INFO L226 Difference]: Without dead ends: 2011 [2025-02-05 22:58:48,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6602 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3954, Invalid=16352, Unknown=0, NotChecked=0, Total=20306 [2025-02-05 22:58:48,035 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 2209 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 986 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2216 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 3630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 986 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:58:48,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2216 Valid, 1670 Invalid, 3630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [986 Valid, 2644 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 22:58:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2025-02-05 22:58:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 825. [2025-02-05 22:58:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 623 states have (on average 1.247191011235955) internal successors, (777), 637 states have internal predecessors, (777), 162 states have call successors, (162), 39 states have call predecessors, (162), 39 states have return successors, (162), 148 states have call predecessors, (162), 162 states have call successors, (162) [2025-02-05 22:58:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1101 transitions. [2025-02-05 22:58:48,182 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1101 transitions. Word has length 165 [2025-02-05 22:58:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:58:48,182 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1101 transitions. [2025-02-05 22:58:48,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 3.742857142857143) internal successors, (131), 35 states have internal predecessors, (131), 9 states have call successors, (57), 4 states have call predecessors, (57), 8 states have return successors, (58), 8 states have call predecessors, (58), 9 states have call successors, (58) [2025-02-05 22:58:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1101 transitions. [2025-02-05 22:58:48,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 22:58:48,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:58:48,185 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:58:48,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 22:58:48,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:58:48,386 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:58:48,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:58:48,387 INFO L85 PathProgramCache]: Analyzing trace with hash 989835434, now seen corresponding path program 1 times [2025-02-05 22:58:48,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:58:48,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156380159] [2025-02-05 22:58:48,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:48,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:58:48,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 22:58:48,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 22:58:48,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:48,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:58:48,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:58:48,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156380159] [2025-02-05 22:58:48,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156380159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:58:48,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:58:48,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:58:48,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361978911] [2025-02-05 22:58:48,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:58:48,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:58:48,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:58:48,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:58:48,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:58:48,512 INFO L87 Difference]: Start difference. First operand 825 states and 1101 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:58:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:58:48,657 INFO L93 Difference]: Finished difference Result 1513 states and 2017 transitions. [2025-02-05 22:58:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:58:48,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-02-05 22:58:48,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:58:48,663 INFO L225 Difference]: With dead ends: 1513 [2025-02-05 22:58:48,664 INFO L226 Difference]: Without dead ends: 691 [2025-02-05 22:58:48,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:58:48,667 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 47 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:58:48,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 440 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:58:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-02-05 22:58:48,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 623. [2025-02-05 22:58:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 453 states have (on average 1.2141280353200883) internal successors, (550), 458 states have internal predecessors, (550), 134 states have call successors, (134), 35 states have call predecessors, (134), 35 states have return successors, (134), 129 states have call predecessors, (134), 134 states have call successors, (134) [2025-02-05 22:58:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 818 transitions. [2025-02-05 22:58:48,760 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 818 transitions. Word has length 165 [2025-02-05 22:58:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:58:48,760 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 818 transitions. [2025-02-05 22:58:48,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:58:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 818 transitions. [2025-02-05 22:58:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 22:58:48,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:58:48,761 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:58:48,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:58:48,764 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:58:48,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:58:48,765 INFO L85 PathProgramCache]: Analyzing trace with hash 172349380, now seen corresponding path program 1 times [2025-02-05 22:58:48,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:58:48,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287945260] [2025-02-05 22:58:48,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:58:48,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 22:58:48,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 22:58:48,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:48,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-05 22:58:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:58:49,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287945260] [2025-02-05 22:58:49,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287945260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:58:49,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108006296] [2025-02-05 22:58:49,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:49,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:58:49,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:58:49,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:58:49,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 22:58:49,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 22:58:49,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 22:58:49,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:49,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:58:49,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 22:58:49,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:58:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 503 proven. 90 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2025-02-05 22:58:49,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:58:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-02-05 22:58:50,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108006296] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:58:50,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:58:50,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-02-05 22:58:50,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381378107] [2025-02-05 22:58:50,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:58:50,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 22:58:50,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:58:50,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 22:58:50,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2025-02-05 22:58:50,099 INFO L87 Difference]: Start difference. First operand 623 states and 818 transitions. Second operand has 21 states, 19 states have (on average 6.157894736842105) internal successors, (117), 19 states have internal predecessors, (117), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2025-02-05 22:58:50,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:58:50,913 INFO L93 Difference]: Finished difference Result 1730 states and 2234 transitions. [2025-02-05 22:58:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 22:58:50,913 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.157894736842105) internal successors, (117), 19 states have internal predecessors, (117), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) Word has length 166 [2025-02-05 22:58:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:58:50,934 INFO L225 Difference]: With dead ends: 1730 [2025-02-05 22:58:50,934 INFO L226 Difference]: Without dead ends: 1110 [2025-02-05 22:58:50,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=333, Invalid=723, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 22:58:50,936 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 232 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:58:50,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 673 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 22:58:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-02-05 22:58:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 625. [2025-02-05 22:58:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 455 states have (on average 1.2087912087912087) internal successors, (550), 460 states have internal predecessors, (550), 134 states have call successors, (134), 35 states have call predecessors, (134), 35 states have return successors, (134), 129 states have call predecessors, (134), 134 states have call successors, (134) [2025-02-05 22:58:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 818 transitions. [2025-02-05 22:58:51,034 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 818 transitions. Word has length 166 [2025-02-05 22:58:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:58:51,034 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 818 transitions. [2025-02-05 22:58:51,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.157894736842105) internal successors, (117), 19 states have internal predecessors, (117), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2025-02-05 22:58:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 818 transitions. [2025-02-05 22:58:51,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 22:58:51,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:58:51,037 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:58:51,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 22:58:51,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:58:51,238 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:58:51,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:58:51,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1467182883, now seen corresponding path program 1 times [2025-02-05 22:58:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:58:51,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732185393] [2025-02-05 22:58:51,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:51,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:58:51,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 22:58:51,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 22:58:51,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:51,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:58:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1064555009] [2025-02-05 22:58:51,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:58:51,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:58:51,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:58:51,330 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:58:51,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 22:58:51,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 22:58:51,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 22:58:51,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:51,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:58:51,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 22:58:51,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 22:58:51,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 22:58:51,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:58:51,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:58:51,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 22:58:51,659 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 22:58:51,660 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 22:58:51,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 22:58:51,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 22:58:51,868 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:58:51,971 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 22:58:51,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:58:51 BoogieIcfgContainer [2025-02-05 22:58:51,974 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 22:58:51,975 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 22:58:51,975 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 22:58:51,975 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 22:58:51,975 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:58:30" (3/4) ... [2025-02-05 22:58:51,978 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 22:58:51,979 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 22:58:51,980 INFO L158 Benchmark]: Toolchain (without parser) took 22520.66ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 107.1MB in the beginning and 206.5MB in the end (delta: -99.5MB). Peak memory consumption was 143.1MB. Max. memory is 16.1GB. [2025-02-05 22:58:51,980 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:58:51,980 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.94ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 91.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 22:58:51,980 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.56ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 86.4MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:58:51,981 INFO L158 Benchmark]: Boogie Preprocessor took 57.04ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 79.5MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 22:58:51,981 INFO L158 Benchmark]: IcfgBuilder took 600.24ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 51.2MB in the end (delta: 28.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 22:58:51,982 INFO L158 Benchmark]: TraceAbstraction took 21428.81ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 50.6MB in the beginning and 206.6MB in the end (delta: -156.1MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2025-02-05 22:58:51,982 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 385.9MB. Free memory was 206.6MB in the beginning and 206.5MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:58:51,984 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.94ms. Allocated memory is still 142.6MB. Free memory was 107.1MB in the beginning and 91.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.56ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 86.4MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.04ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 79.5MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 600.24ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 51.2MB in the end (delta: 28.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21428.81ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 50.6MB in the beginning and 206.6MB in the end (delta: -156.1MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 385.9MB. Free memory was 206.6MB in the beginning and 206.5MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someUnaryDOUBLEoperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryArithmeticFLOAToperation at line 57, overapproximation of someUnaryFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L42] unsigned char var_1_31 = 4; [L43] double var_1_33 = 31.625; [L44] double var_1_36 = 15.75; [L45] double var_1_37 = 15.375; [L46] unsigned short int var_1_38 = 16; [L47] unsigned char var_1_39 = 0; [L48] double var_1_44 = 128.5; [L49] float var_1_45 = 1.85; [L50] double var_1_46 = 1.5; [L51] double var_1_47 = 99999999999.4; [L52] unsigned char var_1_49 = 128; VAL [isInitial=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=0, var_1_8=1, var_1_9=-2] [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] FCALL updateLastVariables() [L177] CALL updateVariables() [L126] var_1_7 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=1, var_1_9=-2] [L127] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=1, var_1_9=-2] [L128] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=1, var_1_9=-2] [L128] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=1, var_1_9=-2] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L130] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L131] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L131] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L132] var_1_14 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L133] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L134] var_1_15 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L135] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L136] var_1_16 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L137] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L138] var_1_18 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L139] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L140] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L140] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L141] var_1_21 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L142] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L143] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L143] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L144] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L144] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L145] var_1_23 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L146] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L147] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L147] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L148] var_1_24 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L149] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L150] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L150] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L151] var_1_26 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L152] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L153] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L153] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L154] var_1_27 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L155] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L156] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L156] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L161] var_1_46 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L162] RET assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L163] var_1_47 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L164] RET assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L177] RET updateVariables() [L178] CALL step() [L56] COND TRUE \read(var_1_8) [L57] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L59] COND TRUE \read(var_1_8) [L60] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L62] COND FALSE !((var_1_16 * (var_1_46 - var_1_47)) < var_1_15) [L67] var_1_45 = (((((((((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) < (var_1_37)) ? (((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) : (var_1_37))) < 0 ) ? -((((((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) < (var_1_37)) ? (((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) : (var_1_37))) : ((((((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) < (var_1_37)) ? (((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) : (var_1_37))))) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L69] var_1_29 = var_1_27 [L70] var_1_38 = ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27))) [L71] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=4, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=-2] [L72] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L75] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=4, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=0] [L77] var_1_31 = var_1_26 [L78] var_1_17 = ((var_1_18 - 25) - var_1_25) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=0] [L79] COND FALSE !(var_1_36 <= var_1_14) [L84] var_1_44 = var_1_36 VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=0] [L86] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=32741, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=0] [L87] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L88] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=0] [L92] EXPR var_1_29 & (var_1_18 + 2u) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=0] [L92] EXPR 16u >> var_1_26 VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=0] [L92] COND TRUE (var_1_29 & (var_1_18 + 2u)) < (16u >> var_1_26) [L93] var_1_39 = ((var_1_7 && (var_1_8 && var_1_7)) && (! var_1_23)) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=0] [L95] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=0, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=0] [L96] COND FALSE !((~ var_1_29) > stepLocal_3) [L99] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=0] [L101] COND FALSE !(! var_1_8) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=0] [L104] var_1_8 || (var_1_27 >= (var_1_25 & var_1_18)) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=-255, var_1_8=-255, var_1_9=0] [L104] COND TRUE var_1_8 || (var_1_27 >= (var_1_25 & var_1_18)) [L105] COND FALSE !(-2 > var_1_18) [L108] var_1_49 = var_1_27 VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=-255, var_1_8=-255, var_1_9=0] [L111] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L112] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=-255, var_1_8=-255, var_1_9=0] [L113] COND TRUE stepLocal_1 <= (var_1_25 - var_1_25) VAL [isInitial=1, stepLocal_0=0, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=-255, var_1_8=-255, var_1_9=0] [L114] COND FALSE !(stepLocal_0 < var_1_25) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=-255, var_1_8=-255, var_1_9=0] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; VAL [\result=0, isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=-255, var_1_8=-255, var_1_9=0] [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=-255, var_1_8=-255, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4294967298, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=256, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=-255, var_1_31=256, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=-255, var_1_8=-255, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.3s, OverallIterations: 12, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3969 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3948 mSDsluCounter, 5059 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3467 mSDsCounter, 1328 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4467 IncrementalHoareTripleChecker+Invalid, 5795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1328 mSolverCounterUnsat, 1592 mSDtfsCounter, 4467 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1052 GetRequests, 850 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6847 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=825occurred in iteration=9, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 2392 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2640 NumberOfCodeBlocks, 2640 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2623 ConstructedInterpolants, 0 QuantifiedInterpolants, 8553 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1182 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 17117/17664 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 22:58:52,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1aa5ccf491fa19757c49751a869c16c8e81ee57a7445aa2b11849a454021fdb2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:58:54,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:58:54,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 22:58:54,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:58:54,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:58:54,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:58:54,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:58:54,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:58:54,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:58:54,386 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:58:54,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:58:54,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:58:54,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:58:54,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:58:54,387 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:58:54,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:58:54,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:58:54,388 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:58:54,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:58:54,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:58:54,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:58:54,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:58:54,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:58:54,389 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 22:58:54,389 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 22:58:54,389 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 22:58:54,389 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:58:54,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:58:54,389 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:58:54,390 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:58:54,390 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:58:54,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:58:54,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:58:54,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:58:54,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:58:54,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:58:54,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:58:54,391 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:58:54,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:58:54,391 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 22:58:54,391 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 22:58:54,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:58:54,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:58:54,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:58:54,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:58:54,392 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1aa5ccf491fa19757c49751a869c16c8e81ee57a7445aa2b11849a454021fdb2 [2025-02-05 22:58:54,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:58:54,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:58:54,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:58:54,703 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:58:54,703 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:58:54,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2025-02-05 22:58:56,006 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99bb2ba34/e6667234599240dd98de45b5472a5ce9/FLAG4882e8cfc [2025-02-05 22:58:56,266 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:58:56,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2025-02-05 22:58:56,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99bb2ba34/e6667234599240dd98de45b5472a5ce9/FLAG4882e8cfc [2025-02-05 22:58:56,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99bb2ba34/e6667234599240dd98de45b5472a5ce9 [2025-02-05 22:58:56,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:58:56,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:58:56,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:58:56,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:58:56,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:58:56,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13895087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56, skipping insertion in model container [2025-02-05 22:58:56,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:58:56,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2025-02-05 22:58:56,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:58:56,588 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:58:56,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2025-02-05 22:58:56,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:58:56,669 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:58:56,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56 WrapperNode [2025-02-05 22:58:56,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:58:56,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:58:56,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:58:56,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:58:56,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,729 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2025-02-05 22:58:56,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:58:56,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:58:56,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:58:56,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:58:56,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,773 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:58:56,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,789 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:58:56,809 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:58:56,809 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:58:56,809 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:58:56,810 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56" (1/1) ... [2025-02-05 22:58:56,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:58:56,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:58:56,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:58:56,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:58:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:58:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 22:58:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:58:56,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:58:56,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:58:56,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:58:56,932 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:58:56,934 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:59:07,674 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 22:59:07,674 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:59:07,686 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:59:07,688 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:59:07,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:59:07 BoogieIcfgContainer [2025-02-05 22:59:07,689 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:59:07,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:59:07,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:59:07,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:59:07,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:58:56" (1/3) ... [2025-02-05 22:59:07,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58044939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:59:07, skipping insertion in model container [2025-02-05 22:59:07,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:58:56" (2/3) ... [2025-02-05 22:59:07,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58044939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:59:07, skipping insertion in model container [2025-02-05 22:59:07,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:59:07" (3/3) ... [2025-02-05 22:59:07,699 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2025-02-05 22:59:07,712 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:59:07,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i that has 2 procedures, 78 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:59:07,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:59:07,781 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1b8cd410, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:59:07,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:59:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 22:59:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:59:07,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:59:07,798 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:59:07,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:59:07,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:59:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1113089168, now seen corresponding path program 1 times [2025-02-05 22:59:07,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:59:07,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78057426] [2025-02-05 22:59:07,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:59:07,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:59:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:59:07,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:59:07,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 22:59:07,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:59:08,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:59:08,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:59:08,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:59:08,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:59:08,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:59:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2025-02-05 22:59:08,457 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:59:08,457 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:59:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78057426] [2025-02-05 22:59:08,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78057426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:59:08,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:59:08,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:59:08,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019408840] [2025-02-05 22:59:08,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:59:08,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:59:08,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:59:08,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:59:08,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:59:08,481 INFO L87 Difference]: Start difference. First operand has 78 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:59:08,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:59:08,508 INFO L93 Difference]: Finished difference Result 150 states and 257 transitions. [2025-02-05 22:59:08,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:59:08,510 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2025-02-05 22:59:08,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:59:08,515 INFO L225 Difference]: With dead ends: 150 [2025-02-05 22:59:08,515 INFO L226 Difference]: Without dead ends: 75 [2025-02-05 22:59:08,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:59:08,520 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:59:08,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:59:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-05 22:59:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-05 22:59:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 22:59:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 114 transitions. [2025-02-05 22:59:08,564 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 114 transitions. Word has length 160 [2025-02-05 22:59:08,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:59:08,565 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 114 transitions. [2025-02-05 22:59:08,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:59:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 114 transitions. [2025-02-05 22:59:08,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:59:08,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:59:08,576 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:59:08,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 22:59:08,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:59:08,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:59:08,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:59:08,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2012646034, now seen corresponding path program 1 times [2025-02-05 22:59:08,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:59:08,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367638620] [2025-02-05 22:59:08,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:59:08,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:59:08,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:59:08,781 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:59:08,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 22:59:08,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:59:09,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:59:09,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:59:09,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:59:09,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 22:59:09,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:59:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 195 proven. 63 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2025-02-05 22:59:11,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:59:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-05 22:59:13,000 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:59:13,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367638620] [2025-02-05 22:59:13,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367638620] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:59:13,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:59:13,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-02-05 22:59:13,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571212399] [2025-02-05 22:59:13,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:59:13,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:59:13,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:59:13,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:59:13,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:59:13,004 INFO L87 Difference]: Start difference. First operand 75 states and 114 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-02-05 22:59:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:59:14,405 INFO L93 Difference]: Finished difference Result 153 states and 230 transitions. [2025-02-05 22:59:14,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 22:59:14,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 160 [2025-02-05 22:59:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:59:14,408 INFO L225 Difference]: With dead ends: 153 [2025-02-05 22:59:14,408 INFO L226 Difference]: Without dead ends: 81 [2025-02-05 22:59:14,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:59:14,410 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 67 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:59:14,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 180 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 22:59:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-05 22:59:14,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-02-05 22:59:14,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 22:59:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2025-02-05 22:59:14,422 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 160 [2025-02-05 22:59:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:59:14,423 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2025-02-05 22:59:14,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-02-05 22:59:14,423 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2025-02-05 22:59:14,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 22:59:14,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:59:14,425 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:59:14,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 22:59:14,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:59:14,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:59:14,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:59:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash -779692196, now seen corresponding path program 1 times [2025-02-05 22:59:14,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:59:14,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939655743] [2025-02-05 22:59:14,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:59:14,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:59:14,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:59:14,630 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:59:14,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 22:59:14,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 22:59:15,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 22:59:15,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:59:15,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:59:15,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 22:59:15,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:59:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:59:15,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:59:15,294 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:59:15,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939655743] [2025-02-05 22:59:15,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939655743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:59:15,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:59:15,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:59:15,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616736481] [2025-02-05 22:59:15,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:59:15,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:59:15,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:59:15,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:59:15,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:59:15,297 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:59:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:59:15,602 INFO L93 Difference]: Finished difference Result 210 states and 303 transitions. [2025-02-05 22:59:15,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:59:15,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-02-05 22:59:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:59:15,605 INFO L225 Difference]: With dead ends: 210 [2025-02-05 22:59:15,605 INFO L226 Difference]: Without dead ends: 134 [2025-02-05 22:59:15,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:59:15,607 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 99 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:59:15,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 439 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:59:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-05 22:59:15,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 79. [2025-02-05 22:59:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 52 states have internal predecessors, (64), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 22:59:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 112 transitions. [2025-02-05 22:59:15,634 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 112 transitions. Word has length 161 [2025-02-05 22:59:15,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:59:15,635 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 112 transitions. [2025-02-05 22:59:15,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:59:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 112 transitions. [2025-02-05 22:59:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 22:59:15,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:59:15,641 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:59:15,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 22:59:15,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:59:15,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:59:15,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:59:15,843 INFO L85 PathProgramCache]: Analyzing trace with hash -976205701, now seen corresponding path program 1 times [2025-02-05 22:59:15,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:59:15,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715009147] [2025-02-05 22:59:15,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:59:15,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:59:15,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:59:15,846 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:59:15,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 22:59:15,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 22:59:16,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 22:59:16,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:59:16,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:59:16,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 22:59:16,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:59:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 485 proven. 48 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2025-02-05 22:59:17,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:59:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-05 22:59:19,067 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:59:19,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715009147] [2025-02-05 22:59:19,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715009147] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:59:19,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:59:19,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-05 22:59:19,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753396714] [2025-02-05 22:59:19,067 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:59:19,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 22:59:19,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:59:19,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 22:59:19,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:59:19,069 INFO L87 Difference]: Start difference. First operand 79 states and 112 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2025-02-05 22:59:20,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:59:20,633 INFO L93 Difference]: Finished difference Result 161 states and 226 transitions. [2025-02-05 22:59:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 22:59:20,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 161 [2025-02-05 22:59:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:59:20,647 INFO L225 Difference]: With dead ends: 161 [2025-02-05 22:59:20,647 INFO L226 Difference]: Without dead ends: 85 [2025-02-05 22:59:20,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:59:20,648 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 132 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:59:20,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 174 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 22:59:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-05 22:59:20,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2025-02-05 22:59:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.2) internal successors, (66), 55 states have internal predecessors, (66), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 22:59:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 114 transitions. [2025-02-05 22:59:20,664 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 114 transitions. Word has length 161 [2025-02-05 22:59:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:59:20,665 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 114 transitions. [2025-02-05 22:59:20,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2025-02-05 22:59:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 114 transitions. [2025-02-05 22:59:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 22:59:20,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:59:20,669 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:59:20,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-02-05 22:59:20,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:59:20,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:59:20,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:59:20,871 INFO L85 PathProgramCache]: Analyzing trace with hash -88702020, now seen corresponding path program 1 times [2025-02-05 22:59:20,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:59:20,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871470470] [2025-02-05 22:59:20,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:59:20,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:59:20,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:59:20,875 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:59:20,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-05 22:59:20,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 22:59:21,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 22:59:21,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:59:21,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:59:21,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 22:59:21,401 INFO L279 TraceCheckSpWp]: Computing forward predicates...