./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4e5482dd6ba3374aff0d8883ae694cf340167e4fdd04dcf1b79ac1391ce8afb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:28:37,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:28:37,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:28:37,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:28:37,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:28:37,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:28:37,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:28:37,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:28:37,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:28:37,574 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:28:37,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:28:37,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:28:37,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:28:37,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:28:37,576 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:28:37,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:28:37,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:28:37,576 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:28:37,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:28:37,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:28:37,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:28:37,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:28:37,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:28:37,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:28:37,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:28:37,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:28:37,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:28:37,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:28:37,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:28:37,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:28:37,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:28:37,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:28:37,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:28:37,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:28:37,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:28:37,578 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:28:37,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:28:37,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:28:37,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:28:37,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:28:37,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:28:37,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:28:37,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:28:37,578 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/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 -> 4e5482dd6ba3374aff0d8883ae694cf340167e4fdd04dcf1b79ac1391ce8afb5 [2025-03-03 20:28:37,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:28:37,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:28:37,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:28:37,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:28:37,806 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:28:37,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2025-03-03 20:28:38,916 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/336476c12/1037bd59d505463fa6fc1061292ca461/FLAG456f19dfc [2025-03-03 20:28:39,233 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:28:39,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2025-03-03 20:28:39,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/336476c12/1037bd59d505463fa6fc1061292ca461/FLAG456f19dfc [2025-03-03 20:28:39,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/336476c12/1037bd59d505463fa6fc1061292ca461 [2025-03-03 20:28:39,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:28:39,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:28:39,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:28:39,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:28:39,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:28:39,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ecae150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39, skipping insertion in model container [2025-03-03 20:28:39,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:28:39,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i[919,932] [2025-03-03 20:28:39,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:28:39,447 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:28:39,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i[919,932] [2025-03-03 20:28:39,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:28:39,498 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:28:39,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39 WrapperNode [2025-03-03 20:28:39,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:28:39,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:28:39,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:28:39,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:28:39,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,555 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 168 [2025-03-03 20:28:39,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:28:39,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:28:39,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:28:39,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:28:39,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,588 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-03-03 20:28:39,588 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,594 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:28:39,607 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:28:39,607 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:28:39,607 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:28:39,608 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39" (1/1) ... [2025-03-03 20:28:39,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:28:39,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:39,636 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:28:39,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:28:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:28:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:28:39,657 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:28:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:28:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:28:39,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:28:39,728 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:28:39,729 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:28:40,046 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 20:28:40,046 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:28:40,058 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:28:40,059 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:28:40,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:28:40 BoogieIcfgContainer [2025-03-03 20:28:40,059 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:28:40,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:28:40,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:28:40,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:28:40,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:28:39" (1/3) ... [2025-03-03 20:28:40,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786438ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:28:40, skipping insertion in model container [2025-03-03 20:28:40,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:39" (2/3) ... [2025-03-03 20:28:40,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786438ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:28:40, skipping insertion in model container [2025-03-03 20:28:40,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:28:40" (3/3) ... [2025-03-03 20:28:40,068 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2025-03-03 20:28:40,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:28:40,079 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:28:40,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:28:40,123 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;@5f210a8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:28:40,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:28:40,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 20:28:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 20:28:40,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:40,137 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:40,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:40,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash 115927755, now seen corresponding path program 1 times [2025-03-03 20:28:40,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:40,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161025870] [2025-03-03 20:28:40,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:40,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:40,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 20:28:40,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 20:28:40,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:40,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:40,383 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 20:28:40,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:40,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161025870] [2025-03-03 20:28:40,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161025870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:28:40,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948391697] [2025-03-03 20:28:40,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:40,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:28:40,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:40,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:28:40,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:28:40,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 20:28:40,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 20:28:40,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:40,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:40,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:28:40,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:40,553 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 20:28:40,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:28:40,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948391697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:40,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:28:40,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:28:40,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843423969] [2025-03-03 20:28:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:40,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:28:40,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:40,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:28:40,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:28:40,575 INFO L87 Difference]: Start difference. First operand has 73 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 53 states have internal predecessors, (76), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 20:28:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:40,592 INFO L93 Difference]: Finished difference Result 138 states and 234 transitions. [2025-03-03 20:28:40,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:28:40,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2025-03-03 20:28:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:40,598 INFO L225 Difference]: With dead ends: 138 [2025-03-03 20:28:40,599 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 20:28:40,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-03-03 20:28:40,602 INFO L435 NwaCegarLoop]: 102 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, 102 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-03-03 20:28:40,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:28:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 20:28:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-03 20:28:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 20:28:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2025-03-03 20:28:40,628 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 129 [2025-03-03 20:28:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:40,628 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2025-03-03 20:28:40,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 20:28:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2025-03-03 20:28:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 20:28:40,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:40,631 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:40,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:28:40,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:28:40,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:40,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:40,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1289789911, now seen corresponding path program 1 times [2025-03-03 20:28:40,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:40,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312878921] [2025-03-03 20:28:40,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:40,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:40,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 20:28:40,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 20:28:40,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:40,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 20:28:41,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:41,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312878921] [2025-03-03 20:28:41,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312878921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:41,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:41,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:28:41,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146802942] [2025-03-03 20:28:41,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:41,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:28:41,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:41,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:28:41,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:28:41,152 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:41,283 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2025-03-03 20:28:41,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:28:41,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-03-03 20:28:41,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:41,287 INFO L225 Difference]: With dead ends: 172 [2025-03-03 20:28:41,288 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 20:28:41,288 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-03-03 20:28:41,289 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 51 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:41,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 228 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:28:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 20:28:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2025-03-03 20:28:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 72 states have internal predecessors, (95), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 20:28:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 155 transitions. [2025-03-03 20:28:41,300 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 155 transitions. Word has length 130 [2025-03-03 20:28:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:41,300 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 155 transitions. [2025-03-03 20:28:41,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 155 transitions. [2025-03-03 20:28:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 20:28:41,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:41,302 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:41,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:28:41,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:41,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:41,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1318419062, now seen corresponding path program 1 times [2025-03-03 20:28:41,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:41,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9106760] [2025-03-03 20:28:41,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:41,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:41,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 20:28:41,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 20:28:41,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:41,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:41,490 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 20:28:41,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:41,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9106760] [2025-03-03 20:28:41,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9106760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:41,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:41,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:28:41,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166198014] [2025-03-03 20:28:41,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:41,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:28:41,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:41,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:28:41,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:28:41,492 INFO L87 Difference]: Start difference. First operand 104 states and 155 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:41,627 INFO L93 Difference]: Finished difference Result 278 states and 413 transitions. [2025-03-03 20:28:41,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:28:41,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-03-03 20:28:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:41,631 INFO L225 Difference]: With dead ends: 278 [2025-03-03 20:28:41,631 INFO L226 Difference]: Without dead ends: 177 [2025-03-03 20:28:41,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:28:41,633 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 53 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:41,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 236 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:28:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-03 20:28:41,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2025-03-03 20:28:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 123 states have internal predecessors, (160), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 20:28:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 256 transitions. [2025-03-03 20:28:41,661 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 256 transitions. Word has length 130 [2025-03-03 20:28:41,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:41,662 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 256 transitions. [2025-03-03 20:28:41,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 256 transitions. [2025-03-03 20:28:41,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 20:28:41,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:41,666 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:41,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:28:41,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:41,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:41,667 INFO L85 PathProgramCache]: Analyzing trace with hash -478532297, now seen corresponding path program 1 times [2025-03-03 20:28:41,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:41,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158776882] [2025-03-03 20:28:41,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:41,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:41,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 20:28:41,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 20:28:41,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:41,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 20:28:41,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:41,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158776882] [2025-03-03 20:28:41,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158776882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:41,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:41,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:28:41,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690493594] [2025-03-03 20:28:41,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:41,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:28:41,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:41,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:28:41,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:28:41,783 INFO L87 Difference]: Start difference. First operand 173 states and 256 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:41,796 INFO L93 Difference]: Finished difference Result 292 states and 434 transitions. [2025-03-03 20:28:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:28:41,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-03-03 20:28:41,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:41,798 INFO L225 Difference]: With dead ends: 292 [2025-03-03 20:28:41,798 INFO L226 Difference]: Without dead ends: 122 [2025-03-03 20:28:41,799 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-03-03 20:28:41,800 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:41,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:28:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-03 20:28:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-03 20:28:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 81 states have internal predecessors, (102), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 20:28:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2025-03-03 20:28:41,820 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 130 [2025-03-03 20:28:41,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:41,821 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2025-03-03 20:28:41,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2025-03-03 20:28:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 20:28:41,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:41,824 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:41,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:28:41,824 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:41,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:41,825 INFO L85 PathProgramCache]: Analyzing trace with hash 473947191, now seen corresponding path program 1 times [2025-03-03 20:28:41,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:41,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800920058] [2025-03-03 20:28:41,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:41,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:41,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 20:28:41,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 20:28:41,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:41,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 20:28:42,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:42,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800920058] [2025-03-03 20:28:42,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800920058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:42,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:42,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:28:42,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688930322] [2025-03-03 20:28:42,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:42,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:28:42,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:42,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:28:42,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:28:42,252 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:42,618 INFO L93 Difference]: Finished difference Result 375 states and 550 transitions. [2025-03-03 20:28:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:28:42,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-03-03 20:28:42,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:42,625 INFO L225 Difference]: With dead ends: 375 [2025-03-03 20:28:42,625 INFO L226 Difference]: Without dead ends: 274 [2025-03-03 20:28:42,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:28:42,626 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 228 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:42,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 354 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:28:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-03 20:28:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 181. [2025-03-03 20:28:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 128 states have (on average 1.3359375) internal successors, (171), 131 states have internal predecessors, (171), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 20:28:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 267 transitions. [2025-03-03 20:28:42,660 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 267 transitions. Word has length 130 [2025-03-03 20:28:42,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:42,661 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 267 transitions. [2025-03-03 20:28:42,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:42,661 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 267 transitions. [2025-03-03 20:28:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 20:28:42,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:42,663 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:42,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:28:42,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:42,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:42,664 INFO L85 PathProgramCache]: Analyzing trace with hash -36586986, now seen corresponding path program 1 times [2025-03-03 20:28:42,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:42,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341600873] [2025-03-03 20:28:42,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:42,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:42,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 20:28:42,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 20:28:42,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:42,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-03 20:28:42,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:42,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341600873] [2025-03-03 20:28:42,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341600873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:28:42,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849974900] [2025-03-03 20:28:42,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:42,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:28:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:42,908 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:28:42,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:28:42,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 20:28:42,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 20:28:42,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:42,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:42,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:28:42,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 20:28:43,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:28:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-03 20:28:43,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849974900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:28:43,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:28:43,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 20:28:43,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287334959] [2025-03-03 20:28:43,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:28:43,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:28:43,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:43,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:28:43,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:28:43,317 INFO L87 Difference]: Start difference. First operand 181 states and 267 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, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 20:28:43,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:43,500 INFO L93 Difference]: Finished difference Result 309 states and 439 transitions. [2025-03-03 20:28:43,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:28:43,501 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, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 130 [2025-03-03 20:28:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:43,502 INFO L225 Difference]: With dead ends: 309 [2025-03-03 20:28:43,502 INFO L226 Difference]: Without dead ends: 131 [2025-03-03 20:28:43,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:28:43,503 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 93 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:43,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 160 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:28:43,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-03 20:28:43,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2025-03-03 20:28:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 83 states have internal predecessors, (98), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 20:28:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 158 transitions. [2025-03-03 20:28:43,542 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 158 transitions. Word has length 130 [2025-03-03 20:28:43,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:43,542 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 158 transitions. [2025-03-03 20:28:43,542 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, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 20:28:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 158 transitions. [2025-03-03 20:28:43,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 20:28:43,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:43,543 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:43,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 20:28:43,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 20:28:43,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:43,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash -82185963, now seen corresponding path program 1 times [2025-03-03 20:28:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:43,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847729352] [2025-03-03 20:28:43,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:43,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:43,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 20:28:43,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 20:28:43,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:43,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 20:28:43,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:43,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847729352] [2025-03-03 20:28:43,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847729352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:43,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:43,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:28:43,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279557350] [2025-03-03 20:28:43,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:43,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:28:43,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:43,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:28:43,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:28:43,976 INFO L87 Difference]: Start difference. First operand 119 states and 158 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 20:28:44,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:44,183 INFO L93 Difference]: Finished difference Result 278 states and 365 transitions. [2025-03-03 20:28:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:28:44,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2025-03-03 20:28:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:44,186 INFO L225 Difference]: With dead ends: 278 [2025-03-03 20:28:44,187 INFO L226 Difference]: Without dead ends: 162 [2025-03-03 20:28:44,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-03-03 20:28:44,189 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 112 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:44,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 155 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:28:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-03 20:28:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2025-03-03 20:28:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 105 states have (on average 1.1333333333333333) internal successors, (119), 107 states have internal predecessors, (119), 44 states have call successors, (44), 11 states have call predecessors, (44), 11 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 20:28:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 207 transitions. [2025-03-03 20:28:44,241 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 207 transitions. Word has length 130 [2025-03-03 20:28:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:44,242 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 207 transitions. [2025-03-03 20:28:44,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 20:28:44,242 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 207 transitions. [2025-03-03 20:28:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 20:28:44,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:44,244 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:44,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:28:44,244 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:44,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:44,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1889640426, now seen corresponding path program 1 times [2025-03-03 20:28:44,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:44,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44259034] [2025-03-03 20:28:44,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:44,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:44,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 20:28:44,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 20:28:44,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:44,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 20:28:44,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:28:44,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44259034] [2025-03-03 20:28:44,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44259034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:44,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:44,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:28:44,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895050033] [2025-03-03 20:28:44,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:44,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:28:44,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:28:44,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:28:44,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:28:44,548 INFO L87 Difference]: Start difference. First operand 161 states and 207 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:44,667 INFO L93 Difference]: Finished difference Result 354 states and 460 transitions. [2025-03-03 20:28:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:28:44,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2025-03-03 20:28:44,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:44,669 INFO L225 Difference]: With dead ends: 354 [2025-03-03 20:28:44,670 INFO L226 Difference]: Without dead ends: 234 [2025-03-03 20:28:44,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-03-03 20:28:44,671 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 66 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:44,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 268 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:28:44,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-03 20:28:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 186. [2025-03-03 20:28:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 132 states have internal predecessors, (152), 44 states have call successors, (44), 11 states have call predecessors, (44), 11 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-03 20:28:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 240 transitions. [2025-03-03 20:28:44,713 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 240 transitions. Word has length 130 [2025-03-03 20:28:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:44,713 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 240 transitions. [2025-03-03 20:28:44,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 240 transitions. [2025-03-03 20:28:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 20:28:44,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:44,715 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:44,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:28:44,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:44,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash -146830091, now seen corresponding path program 1 times [2025-03-03 20:28:44,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:28:44,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823939782] [2025-03-03 20:28:44,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:28:44,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 20:28:44,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 20:28:44,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:44,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:28:44,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604736795] [2025-03-03 20:28:44,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:44,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:28:44,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:44,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:28:44,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 20:28:44,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 20:28:44,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 20:28:44,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:44,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:28:44,895 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:28:44,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 20:28:44,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 20:28:44,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:44,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:28:45,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:28:45,003 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:28:45,004 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:28:45,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 20:28:45,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:28:45,211 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:28:45,316 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:28:45,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:28:45 BoogieIcfgContainer [2025-03-03 20:28:45,321 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:28:45,322 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:28:45,322 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:28:45,322 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:28:45,322 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:28:40" (3/4) ... [2025-03-03 20:28:45,324 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:28:45,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:28:45,325 INFO L158 Benchmark]: Toolchain (without parser) took 6061.62ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 155.0MB in the beginning and 202.9MB in the end (delta: -47.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:28:45,325 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:28:45,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.34ms. Allocated memory is still 201.3MB. Free memory was 154.6MB in the beginning and 139.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:28:45,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.28ms. Allocated memory is still 201.3MB. Free memory was 139.3MB in the beginning and 135.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:28:45,325 INFO L158 Benchmark]: Boogie Preprocessor took 49.47ms. Allocated memory is still 201.3MB. Free memory was 135.3MB in the beginning and 128.3MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:28:45,326 INFO L158 Benchmark]: IcfgBuilder took 452.33ms. Allocated memory is still 201.3MB. Free memory was 128.3MB in the beginning and 101.7MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 20:28:45,327 INFO L158 Benchmark]: TraceAbstraction took 5258.20ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 100.9MB in the beginning and 203.0MB in the end (delta: -102.0MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2025-03-03 20:28:45,327 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 251.7MB. Free memory was 203.0MB in the beginning and 202.9MB in the end (delta: 78.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:28:45,328 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.18ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.34ms. Allocated memory is still 201.3MB. Free memory was 154.6MB in the beginning and 139.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.28ms. Allocated memory is still 201.3MB. Free memory was 139.3MB in the beginning and 135.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.47ms. Allocated memory is still 201.3MB. Free memory was 135.3MB in the beginning and 128.3MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 452.33ms. Allocated memory is still 201.3MB. Free memory was 128.3MB in the beginning and 101.7MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5258.20ms. Allocated memory was 201.3MB in the beginning and 251.7MB in the end (delta: 50.3MB). Free memory was 100.9MB in the beginning and 203.0MB in the end (delta: -102.0MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 251.7MB. Free memory was 203.0MB in the beginning and 202.9MB in the end (delta: 78.4kB). 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 153, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someUnaryDOUBLEoperation at line 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned long int var_1_34 = 50; [L42] double var_1_35 = 31.1; [L43] unsigned long int var_1_37 = 64; [L44] signed long int var_1_38 = 8; [L45] float var_1_39 = 200.6; [L46] unsigned short int var_1_40 = 2; [L47] signed char var_1_42 = -4; [L48] double var_1_43 = 2.75; [L49] signed char var_1_45 = 32; [L50] unsigned long int var_1_46 = 32; [L51] signed long int var_1_47 = -256; [L52] unsigned char last_1_var_1_9 = 1; [L53] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L164] isInitial = 1 [L165] FCALL initially() [L166] COND TRUE 1 [L167] CALL updateLastVariables() [L156] last_1_var_1_9 = var_1_9 [L157] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L167] RET updateLastVariables() [L168] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_short() [L128] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=5, var_1_9=1] [L128] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=5, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=5, var_1_9=1] [L129] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=5, var_1_9=1] [L130] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=5, var_1_9=1] [L130] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=5, var_1_9=1] [L131] var_1_8 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_9=1] [L132] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_9=1] [L133] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L134] var_1_10 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L137] var_1_11 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L140] var_1_15 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L142] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L142] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L143] var_1_20 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L145] var_1_28 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L148] var_1_29 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L151] var_1_39 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L153] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L168] RET updateVariables() [L169] CALL step() [L57] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L64] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L66] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=1] [L67] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L68] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L70] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L71] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L74] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L76] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L77] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L80] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L84] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L85] var_1_25 = var_1_20 [L86] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=2, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L87] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L88] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L92] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L95] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L96] COND FALSE !(var_1_9 && var_1_11) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L99] COND FALSE !(var_1_28 > var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L104] var_1_35 = var_1_20 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L105] COND FALSE !((var_1_9 && var_1_11) && (var_1_21 > var_1_15)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L108] COND FALSE !((((((var_1_20 / var_1_39)) > (var_1_20)) ? ((var_1_20 / var_1_39)) : (var_1_20))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L113] COND FALSE !(var_1_12 > ((var_1_29 >> 1) + var_1_21)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L116] COND FALSE !(var_1_11 || var_1_9) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L119] EXPR var_1_12 | var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-5, var_1_8=0, var_1_9=0] [L119] COND FALSE !(var_1_28 > (var_1_12 | var_1_12)) [L122] var_1_45 = var_1_28 [L123] var_1_46 = var_1_15 [L124] var_1_47 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=0, var_1_46=2, var_1_47=2, var_1_4=-5, var_1_8=0, var_1_9=0] [L169] RET step() [L170] CALL, EXPR property() [L160-L161] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=0, var_1_46=2, var_1_47=2, var_1_4=-5, var_1_8=0, var_1_9=0] [L170] RET, EXPR property() [L170] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=0, var_1_46=2, var_1_47=2, var_1_4=-5, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=0, var_1_46=2, var_1_47=2, var_1_4=-5, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 9, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 610 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 603 mSDsluCounter, 1699 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 922 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 564 IncrementalHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 777 mSDtfsCounter, 564 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 411 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=8, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 161 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1558 NumberOfCodeBlocks, 1558 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 2725 SizeOfPredicates, 1 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 6617/6732 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-03-03 20:28:45,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4e5482dd6ba3374aff0d8883ae694cf340167e4fdd04dcf1b79ac1391ce8afb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:28:47,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:28:47,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:28:47,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:28:47,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:28:47,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:28:47,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:28:47,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:28:47,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:28:47,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:28:47,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:28:47,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:28:47,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:28:47,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:28:47,315 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:28:47,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:28:47,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:28:47,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:28:47,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:28:47,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:28:47,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:28:47,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:28:47,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:28:47,316 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:28:47,316 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:28:47,316 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:28:47,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:28:47,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:28:47,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:28:47,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:28:47,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:28:47,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:28:47,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:28:47,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:28:47,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:28:47,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:28:47,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:28:47,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:28:47,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:28:47,317 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:28:47,317 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:28:47,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:28:47,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:28:47,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:28:47,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:28:47,318 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/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 -> 4e5482dd6ba3374aff0d8883ae694cf340167e4fdd04dcf1b79ac1391ce8afb5 [2025-03-03 20:28:47,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:28:47,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:28:47,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:28:47,571 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:28:47,571 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:28:47,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2025-03-03 20:28:49,373 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb091649c/e1410089ca1c4156be300c9f88640d60/FLAG2d0386928 [2025-03-03 20:28:49,578 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:28:49,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2025-03-03 20:28:49,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb091649c/e1410089ca1c4156be300c9f88640d60/FLAG2d0386928 [2025-03-03 20:28:49,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb091649c/e1410089ca1c4156be300c9f88640d60 [2025-03-03 20:28:49,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:28:49,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:28:49,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:28:49,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:28:49,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:28:49,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0fa52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49, skipping insertion in model container [2025-03-03 20:28:49,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:28:49,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i[919,932] [2025-03-03 20:28:49,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:28:49,811 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:28:49,819 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i[919,932] [2025-03-03 20:28:49,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:28:49,859 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:28:49,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49 WrapperNode [2025-03-03 20:28:49,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:28:49,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:28:49,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:28:49,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:28:49,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,903 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2025-03-03 20:28:49,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:28:49,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:28:49,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:28:49,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:28:49,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,935 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-03-03 20:28:49,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,951 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:28:49,964 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:28:49,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:28:49,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:28:49,965 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49" (1/1) ... [2025-03-03 20:28:49,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:28:49,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:28:49,992 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:28:49,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:28:50,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:28:50,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:28:50,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:28:50,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:28:50,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:28:50,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:28:50,094 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:28:50,096 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:28:52,037 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 20:28:52,037 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:28:52,043 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:28:52,044 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:28:52,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:28:52 BoogieIcfgContainer [2025-03-03 20:28:52,044 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:28:52,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:28:52,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:28:52,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:28:52,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:28:49" (1/3) ... [2025-03-03 20:28:52,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11102c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:28:52, skipping insertion in model container [2025-03-03 20:28:52,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:28:49" (2/3) ... [2025-03-03 20:28:52,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11102c5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:28:52, skipping insertion in model container [2025-03-03 20:28:52,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:28:52" (3/3) ... [2025-03-03 20:28:52,051 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2025-03-03 20:28:52,061 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:28:52,063 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:28:52,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:28:52,102 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;@6fa5ab89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:28:52,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:28:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 20:28:52,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 20:28:52,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:52,112 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:52,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:52,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:52,116 INFO L85 PathProgramCache]: Analyzing trace with hash 24666429, now seen corresponding path program 1 times [2025-03-03 20:28:52,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:28:52,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985297041] [2025-03-03 20:28:52,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:52,125 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-03-03 20:28:52,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:28:52,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-03 20:28:52,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 20:28:52,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 20:28:52,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 20:28:52,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:52,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:52,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:28:52,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:52,531 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-03 20:28:52,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:28:52,532 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:28:52,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985297041] [2025-03-03 20:28:52,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985297041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:52,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:52,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:28:52,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298212496] [2025-03-03 20:28:52,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:52,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:28:52,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:28:52,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:28:52,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:28:52,557 INFO L87 Difference]: Start difference. First operand has 70 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 20:28:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:52,577 INFO L93 Difference]: Finished difference Result 134 states and 227 transitions. [2025-03-03 20:28:52,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:28:52,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 128 [2025-03-03 20:28:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:52,583 INFO L225 Difference]: With dead ends: 134 [2025-03-03 20:28:52,583 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 20:28:52,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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-03-03 20:28:52,587 INFO L435 NwaCegarLoop]: 101 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, 101 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-03-03 20:28:52,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:28:52,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 20:28:52,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-03 20:28:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 20:28:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-03-03 20:28:52,619 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 128 [2025-03-03 20:28:52,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:52,619 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-03-03 20:28:52,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 20:28:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-03-03 20:28:52,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 20:28:52,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:52,623 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:52,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 20:28:52,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-03 20:28:52,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:52,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:52,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1659762859, now seen corresponding path program 1 times [2025-03-03 20:28:52,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:28:52,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692802840] [2025-03-03 20:28:52,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:52,827 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-03-03 20:28:52,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:28:52,829 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-03 20:28:52,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 20:28:52,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 20:28:53,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 20:28:53,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:53,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:53,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 20:28:53,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-03 20:28:53,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:28:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-03 20:28:53,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:28:53,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692802840] [2025-03-03 20:28:53,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692802840] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:28:53,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:28:53,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 20:28:53,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461745037] [2025-03-03 20:28:53,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:28:53,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:28:53,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:28:53,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:28:53,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:28:53,789 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 20:28:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:54,241 INFO L93 Difference]: Finished difference Result 137 states and 202 transitions. [2025-03-03 20:28:54,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:28:54,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 129 [2025-03-03 20:28:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:54,251 INFO L225 Difference]: With dead ends: 137 [2025-03-03 20:28:54,251 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 20:28:54,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:28:54,252 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 93 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:54,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 159 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:28:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 20:28:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2025-03-03 20:28:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 20:28:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2025-03-03 20:28:54,263 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 96 transitions. Word has length 129 [2025-03-03 20:28:54,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:54,263 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 96 transitions. [2025-03-03 20:28:54,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-03 20:28:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2025-03-03 20:28:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 20:28:54,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:54,268 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:54,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 20:28:54,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-03 20:28:54,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:54,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:54,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1381197260, now seen corresponding path program 1 times [2025-03-03 20:28:54,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:28:54,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948088605] [2025-03-03 20:28:54,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:54,470 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-03-03 20:28:54,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:28:54,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-03 20:28:54,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 20:28:54,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 20:28:54,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 20:28:54,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:54,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:54,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:28:54,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 20:28:54,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:28:54,809 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:28:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948088605] [2025-03-03 20:28:54,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948088605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:54,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:54,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:28:54,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784230371] [2025-03-03 20:28:54,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:54,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:28:54,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:28:54,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:28:54,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:28:54,810 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:54,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:54,907 INFO L93 Difference]: Finished difference Result 135 states and 189 transitions. [2025-03-03 20:28:54,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:28:54,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-03 20:28:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:54,918 INFO L225 Difference]: With dead ends: 135 [2025-03-03 20:28:54,918 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 20:28:54,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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-03-03 20:28:54,919 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:54,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:28:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 20:28:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-03 20:28:54,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 20:28:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2025-03-03 20:28:54,929 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 129 [2025-03-03 20:28:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:54,929 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2025-03-03 20:28:54,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2025-03-03 20:28:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 20:28:54,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:54,931 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:54,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 20:28:55,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-03 20:28:55,131 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:55,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:55,132 INFO L85 PathProgramCache]: Analyzing trace with hash 384124907, now seen corresponding path program 1 times [2025-03-03 20:28:55,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:28:55,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270128831] [2025-03-03 20:28:55,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:55,132 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-03-03 20:28:55,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:28:55,134 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-03 20:28:55,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 20:28:55,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 20:28:55,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 20:28:55,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:55,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:55,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 20:28:55,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 20:28:55,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:28:55,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:28:55,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270128831] [2025-03-03 20:28:55,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270128831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:55,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:55,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:28:55,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164257017] [2025-03-03 20:28:55,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:55,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:28:55,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:28:55,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:28:55,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:28:55,607 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:56,408 INFO L93 Difference]: Finished difference Result 238 states and 328 transitions. [2025-03-03 20:28:56,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:28:56,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-03 20:28:56,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:56,411 INFO L225 Difference]: With dead ends: 238 [2025-03-03 20:28:56,411 INFO L226 Difference]: Without dead ends: 172 [2025-03-03 20:28:56,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:28:56,412 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 240 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:56,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 262 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:28:56,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-03 20:28:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 110. [2025-03-03 20:28:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 68 states have (on average 1.161764705882353) internal successors, (79), 69 states have internal predecessors, (79), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 20:28:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 151 transitions. [2025-03-03 20:28:56,437 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 151 transitions. Word has length 129 [2025-03-03 20:28:56,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:56,437 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 151 transitions. [2025-03-03 20:28:56,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 151 transitions. [2025-03-03 20:28:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 20:28:56,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:56,438 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:56,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2025-03-03 20:28:56,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-03 20:28:56,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:56,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1891676716, now seen corresponding path program 1 times [2025-03-03 20:28:56,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:28:56,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353219319] [2025-03-03 20:28:56,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:56,640 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-03-03 20:28:56,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:28:56,642 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-03 20:28:56,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 20:28:56,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 20:28:56,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 20:28:56,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:56,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:56,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 20:28:56,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 213 proven. 9 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-03 20:28:57,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:28:57,439 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 20:28:57,439 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:28:57,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353219319] [2025-03-03 20:28:57,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353219319] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 20:28:57,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:28:57,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 20:28:57,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481177177] [2025-03-03 20:28:57,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:57,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:28:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:28:57,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:28:57,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:28:57,443 INFO L87 Difference]: Start difference. First operand 110 states and 151 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:57,942 INFO L93 Difference]: Finished difference Result 185 states and 250 transitions. [2025-03-03 20:28:57,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:28:57,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-03 20:28:57,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:57,950 INFO L225 Difference]: With dead ends: 185 [2025-03-03 20:28:57,951 INFO L226 Difference]: Without dead ends: 114 [2025-03-03 20:28:57,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:28:57,954 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 59 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:57,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 161 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:28:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-03 20:28:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-03 20:28:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 72 states have internal predecessors, (81), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 20:28:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 153 transitions. [2025-03-03 20:28:57,978 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 153 transitions. Word has length 129 [2025-03-03 20:28:57,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:57,979 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 153 transitions. [2025-03-03 20:28:57,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 153 transitions. [2025-03-03 20:28:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 20:28:57,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:57,981 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:57,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2025-03-03 20:28:58,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-03-03 20:28:58,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:58,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:58,182 INFO L85 PathProgramCache]: Analyzing trace with hash -660480245, now seen corresponding path program 1 times [2025-03-03 20:28:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:28:58,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697674727] [2025-03-03 20:28:58,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:58,183 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-03-03 20:28:58,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:28:58,185 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-03-03 20:28:58,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (7)] Waiting until timeout for monitored process [2025-03-03 20:28:58,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 20:28:58,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 20:28:58,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:58,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:58,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:28:58,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:28:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-03 20:28:58,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:28:58,515 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:28:58,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697674727] [2025-03-03 20:28:58,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697674727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:28:58,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:28:58,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:28:58,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562515621] [2025-03-03 20:28:58,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:28:58,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:28:58,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:28:58,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:28:58,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:28:58,516 INFO L87 Difference]: Start difference. First operand 114 states and 153 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:28:58,863 INFO L93 Difference]: Finished difference Result 239 states and 313 transitions. [2025-03-03 20:28:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:28:58,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2025-03-03 20:28:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:28:58,874 INFO L225 Difference]: With dead ends: 239 [2025-03-03 20:28:58,874 INFO L226 Difference]: Without dead ends: 164 [2025-03-03 20:28:58,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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-03-03 20:28:58,875 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 48 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:28:58,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 149 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:28:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-03 20:28:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2025-03-03 20:28:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 102 states have (on average 1.1372549019607843) internal successors, (116), 104 states have internal predecessors, (116), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 20:28:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 212 transitions. [2025-03-03 20:28:58,897 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 212 transitions. Word has length 129 [2025-03-03 20:28:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:28:58,897 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 212 transitions. [2025-03-03 20:28:58,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 20:28:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 212 transitions. [2025-03-03 20:28:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 20:28:58,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:28:58,899 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 20:28:58,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (7)] Forceful destruction successful, exit code 0 [2025-03-03 20:28:59,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-03-03 20:28:59,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:28:59,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:28:59,100 INFO L85 PathProgramCache]: Analyzing trace with hash -631851094, now seen corresponding path program 1 times [2025-03-03 20:28:59,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:28:59,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690571242] [2025-03-03 20:28:59,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:28:59,100 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-03-03 20:28:59,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:28:59,102 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-03-03 20:28:59,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (8)] Waiting until timeout for monitored process [2025-03-03 20:28:59,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 20:28:59,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 20:28:59,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:28:59,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:28:59,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 20:28:59,412 INFO L279 TraceCheckSpWp]: Computing forward predicates...