./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-68.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-pr-co_file-68.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 0767bce9c4099f45ee11cd1ef676ae525a65f96727af97d4487455a7a72fa712 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:30:08,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:30:08,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:30:08,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:30:08,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:30:08,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:30:08,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:30:08,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:30:08,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:30:08,977 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:30:08,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:30:08,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:30:08,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:30:08,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:30:08,979 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:30:08,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:30:08,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:30:08,979 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:30:08,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:30:08,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:30:08,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:30:08,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:30:08,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:30:08,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:30:08,980 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:30:08,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:30:08,980 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:30:08,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:30:08,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:30:08,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:30:08,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:30:08,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:30:08,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:30:08,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:30:08,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:30:08,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:30:08,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:30:08,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:30:08,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:30:08,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:30:08,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:30:08,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:30:08,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:30:08,982 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 -> 0767bce9c4099f45ee11cd1ef676ae525a65f96727af97d4487455a7a72fa712 [2025-03-03 21:30:09,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:30:09,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:30:09,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:30:09,192 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:30:09,192 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:30:09,194 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-pr-co_file-68.i [2025-03-03 21:30:10,295 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00df924e2/899b63c9877e4bf3bc997552180904e0/FLAGde31b9d59 [2025-03-03 21:30:10,528 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:30:10,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-68.i [2025-03-03 21:30:10,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00df924e2/899b63c9877e4bf3bc997552180904e0/FLAGde31b9d59 [2025-03-03 21:30:10,869 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00df924e2/899b63c9877e4bf3bc997552180904e0 [2025-03-03 21:30:10,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:30:10,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:30:10,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:30:10,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:30:10,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:30:10,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:30:10" (1/1) ... [2025-03-03 21:30:10,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3464ff92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:10, skipping insertion in model container [2025-03-03 21:30:10,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:30:10" (1/1) ... [2025-03-03 21:30:10,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:30:10,996 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-pr-co_file-68.i[919,932] [2025-03-03 21:30:11,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:30:11,074 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:30:11,084 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-pr-co_file-68.i[919,932] [2025-03-03 21:30:11,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:30:11,135 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:30:11,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11 WrapperNode [2025-03-03 21:30:11,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:30:11,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:30:11,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:30:11,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:30:11,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11" (1/1) ... [2025-03-03 21:30:11,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11" (1/1) ... [2025-03-03 21:30:11,199 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2025-03-03 21:30:11,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:30:11,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:30:11,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:30:11,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:30:11,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11" (1/1) ... [2025-03-03 21:30:11,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11" (1/1) ... [2025-03-03 21:30:11,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11" (1/1) ... [2025-03-03 21:30:11,239 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 21:30:11,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11" (1/1) ... [2025-03-03 21:30:11,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11" (1/1) ... [2025-03-03 21:30:11,251 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11" (1/1) ... [2025-03-03 21:30:11,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11" (1/1) ... [2025-03-03 21:30:11,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11" (1/1) ... [2025-03-03 21:30:11,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11" (1/1) ... [2025-03-03 21:30:11,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:30:11,263 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:30:11,264 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:30:11,264 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:30:11,265 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11" (1/1) ... [2025-03-03 21:30:11,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:30:11,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:30:11,288 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 21:30:11,293 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 21:30:11,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:30:11,307 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:30:11,307 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:30:11,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:30:11,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:30:11,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:30:11,373 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:30:11,375 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:30:11,661 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L182: havoc property_#t~bitwise21#1; [2025-03-03 21:30:11,696 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-03 21:30:11,696 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:30:11,712 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:30:11,713 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:30:11,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:30:11 BoogieIcfgContainer [2025-03-03 21:30:11,713 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:30:11,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:30:11,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:30:11,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:30:11,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:30:10" (1/3) ... [2025-03-03 21:30:11,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73dbdd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:30:11, skipping insertion in model container [2025-03-03 21:30:11,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:11" (2/3) ... [2025-03-03 21:30:11,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73dbdd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:30:11, skipping insertion in model container [2025-03-03 21:30:11,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:30:11" (3/3) ... [2025-03-03 21:30:11,721 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-68.i [2025-03-03 21:30:11,730 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:30:11,730 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-68.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:30:11,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:30:11,774 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;@62451386, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:30:11,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:30:11,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 75 states have internal predecessors, (110), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 21:30:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 21:30:11,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:30:11,785 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:30:11,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:30:11,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:30:11,788 INFO L85 PathProgramCache]: Analyzing trace with hash -763673945, now seen corresponding path program 1 times [2025-03-03 21:30:11,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:30:11,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098050504] [2025-03-03 21:30:11,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:30:11,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 21:30:11,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 21:30:11,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:11,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:30:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 21:30:12,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:30:12,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098050504] [2025-03-03 21:30:12,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098050504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:30:12,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181586179] [2025-03-03 21:30:12,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:12,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:30:12,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:30:12,031 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 21:30:12,032 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 21:30:12,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 21:30:12,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 21:30:12,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:12,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:30:12,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:30:12,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:30:12,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-03 21:30:12,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:30:12,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181586179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:30:12,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:30:12,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:30:12,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223054999] [2025-03-03 21:30:12,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:30:12,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:30:12,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:30:12,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:30:12,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:30:12,216 INFO L87 Difference]: Start difference. First operand has 101 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 75 states have internal predecessors, (110), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 21:30:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:30:12,248 INFO L93 Difference]: Finished difference Result 194 states and 333 transitions. [2025-03-03 21:30:12,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:30:12,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 166 [2025-03-03 21:30:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:30:12,257 INFO L225 Difference]: With dead ends: 194 [2025-03-03 21:30:12,257 INFO L226 Difference]: Without dead ends: 96 [2025-03-03 21:30:12,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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 21:30:12,262 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:30:12,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:30:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-03 21:30:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-03 21:30:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 70 states have internal predecessors, (101), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 21:30:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 149 transitions. [2025-03-03 21:30:12,300 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 149 transitions. Word has length 166 [2025-03-03 21:30:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:30:12,301 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 149 transitions. [2025-03-03 21:30:12,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 21:30:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 149 transitions. [2025-03-03 21:30:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 21:30:12,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:30:12,303 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:30:12,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:30:12,504 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 21:30:12,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:30:12,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:30:12,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1283436071, now seen corresponding path program 1 times [2025-03-03 21:30:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:30:12,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070418969] [2025-03-03 21:30:12,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:12,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:30:12,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 21:30:12,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 21:30:12,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:12,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:30:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 21:30:12,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:30:12,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070418969] [2025-03-03 21:30:12,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070418969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:30:12,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:30:12,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:30:12,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704144847] [2025-03-03 21:30:12,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:30:12,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:30:12,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:30:12,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:30:12,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:30:12,799 INFO L87 Difference]: Start difference. First operand 96 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:30:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:30:12,872 INFO L93 Difference]: Finished difference Result 189 states and 295 transitions. [2025-03-03 21:30:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:30:12,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2025-03-03 21:30:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:30:12,876 INFO L225 Difference]: With dead ends: 189 [2025-03-03 21:30:12,876 INFO L226 Difference]: Without dead ends: 96 [2025-03-03 21:30:12,876 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 21:30:12,877 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 136 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:30:12,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 256 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:30:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-03 21:30:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-03 21:30:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 70 states have internal predecessors, (100), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 21:30:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 148 transitions. [2025-03-03 21:30:12,901 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 148 transitions. Word has length 166 [2025-03-03 21:30:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:30:12,903 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 148 transitions. [2025-03-03 21:30:12,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:30:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 148 transitions. [2025-03-03 21:30:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 21:30:12,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:30:12,905 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:30:12,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:30:12,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:30:12,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:30:12,905 INFO L85 PathProgramCache]: Analyzing trace with hash -229299395, now seen corresponding path program 1 times [2025-03-03 21:30:12,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:30:12,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780425807] [2025-03-03 21:30:12,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:12,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:30:12,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 21:30:12,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 21:30:12,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:12,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:30:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 21:30:13,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:30:13,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780425807] [2025-03-03 21:30:13,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780425807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:30:13,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:30:13,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 21:30:13,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253690267] [2025-03-03 21:30:13,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:30:13,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 21:30:13,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:30:13,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 21:30:13,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:30:13,071 INFO L87 Difference]: Start difference. First operand 96 states and 148 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:30:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:30:13,211 INFO L93 Difference]: Finished difference Result 195 states and 304 transitions. [2025-03-03 21:30:13,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:30:13,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2025-03-03 21:30:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:30:13,213 INFO L225 Difference]: With dead ends: 195 [2025-03-03 21:30:13,213 INFO L226 Difference]: Without dead ends: 102 [2025-03-03 21:30:13,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:30:13,214 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 165 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:30:13,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 446 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:30:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-03 21:30:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-03-03 21:30:13,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.445945945945946) internal successors, (107), 74 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 21:30:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 155 transitions. [2025-03-03 21:30:13,225 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 155 transitions. Word has length 167 [2025-03-03 21:30:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:30:13,226 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 155 transitions. [2025-03-03 21:30:13,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:30:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 155 transitions. [2025-03-03 21:30:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 21:30:13,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:30:13,229 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:30:13,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:30:13,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:30:13,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:30:13,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1015465086, now seen corresponding path program 1 times [2025-03-03 21:30:13,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:30:13,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375061619] [2025-03-03 21:30:13,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:13,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:30:13,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 21:30:13,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 21:30:13,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:13,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:30:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 21:30:13,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:30:13,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375061619] [2025-03-03 21:30:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375061619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:30:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:30:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:30:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286707847] [2025-03-03 21:30:13,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:30:13,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:30:13,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:30:13,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:30:13,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:30:13,821 INFO L87 Difference]: Start difference. First operand 100 states and 155 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:30:14,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:30:14,377 INFO L93 Difference]: Finished difference Result 390 states and 602 transitions. [2025-03-03 21:30:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:30:14,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2025-03-03 21:30:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:30:14,380 INFO L225 Difference]: With dead ends: 390 [2025-03-03 21:30:14,381 INFO L226 Difference]: Without dead ends: 293 [2025-03-03 21:30:14,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:30:14,383 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 514 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:30:14,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 543 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 21:30:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-03 21:30:14,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 172. [2025-03-03 21:30:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 120 states have (on average 1.425) internal successors, (171), 120 states have internal predecessors, (171), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:30:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 267 transitions. [2025-03-03 21:30:14,411 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 267 transitions. Word has length 167 [2025-03-03 21:30:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:30:14,412 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 267 transitions. [2025-03-03 21:30:14,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:30:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 267 transitions. [2025-03-03 21:30:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 21:30:14,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:30:14,414 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:30:14,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:30:14,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:30:14,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:30:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1789824157, now seen corresponding path program 1 times [2025-03-03 21:30:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:30:14,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910006482] [2025-03-03 21:30:14,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:30:14,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 21:30:14,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 21:30:14,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:14,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:30:14,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 21:30:14,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:30:14,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910006482] [2025-03-03 21:30:14,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910006482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:30:14,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:30:14,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:30:14,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236861520] [2025-03-03 21:30:14,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:30:14,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 21:30:14,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:30:14,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 21:30:14,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 21:30:14,817 INFO L87 Difference]: Start difference. First operand 172 states and 267 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:30:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:30:15,272 INFO L93 Difference]: Finished difference Result 390 states and 601 transitions. [2025-03-03 21:30:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:30:15,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2025-03-03 21:30:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:30:15,274 INFO L225 Difference]: With dead ends: 390 [2025-03-03 21:30:15,274 INFO L226 Difference]: Without dead ends: 293 [2025-03-03 21:30:15,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:30:15,275 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 497 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:30:15,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 527 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:30:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-03 21:30:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 173. [2025-03-03 21:30:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 121 states have (on average 1.421487603305785) internal successors, (172), 121 states have internal predecessors, (172), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 21:30:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 268 transitions. [2025-03-03 21:30:15,291 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 268 transitions. Word has length 168 [2025-03-03 21:30:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:30:15,291 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 268 transitions. [2025-03-03 21:30:15,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:30:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 268 transitions. [2025-03-03 21:30:15,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 21:30:15,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:30:15,292 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:30:15,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 21:30:15,293 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:30:15,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:30:15,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1578473244, now seen corresponding path program 1 times [2025-03-03 21:30:15,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:30:15,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35090617] [2025-03-03 21:30:15,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:30:15,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 21:30:15,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 21:30:15,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:15,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:30:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 21:30:15,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:30:15,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35090617] [2025-03-03 21:30:15,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35090617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:30:15,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976778653] [2025-03-03 21:30:15,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:15,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:30:15,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:30:15,690 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 21:30:15,692 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 21:30:15,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 21:30:15,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 21:30:15,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:15,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:30:15,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 21:30:15,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:30:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 195 proven. 63 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2025-03-03 21:30:16,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:30:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-03 21:30:16,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976778653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:30:16,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:30:16,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2025-03-03 21:30:16,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028469178] [2025-03-03 21:30:16,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:30:16,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 21:30:16,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:30:16,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 21:30:16,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:30:16,299 INFO L87 Difference]: Start difference. First operand 173 states and 268 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-03 21:30:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:30:16,712 INFO L93 Difference]: Finished difference Result 427 states and 643 transitions. [2025-03-03 21:30:16,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 21:30:16,713 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 168 [2025-03-03 21:30:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:30:16,715 INFO L225 Difference]: With dead ends: 427 [2025-03-03 21:30:16,715 INFO L226 Difference]: Without dead ends: 330 [2025-03-03 21:30:16,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 332 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2025-03-03 21:30:16,716 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 245 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:30:16,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 719 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 21:30:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-03 21:30:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 314. [2025-03-03 21:30:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 231 states have (on average 1.4025974025974026) internal successors, (324), 232 states have internal predecessors, (324), 74 states have call successors, (74), 8 states have call predecessors, (74), 8 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 21:30:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 472 transitions. [2025-03-03 21:30:16,745 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 472 transitions. Word has length 168 [2025-03-03 21:30:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:30:16,746 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 472 transitions. [2025-03-03 21:30:16,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-03-03 21:30:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 472 transitions. [2025-03-03 21:30:16,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 21:30:16,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:30:16,747 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:30:16,754 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 21:30:16,951 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 21:30:16,951 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:30:16,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:30:16,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1774986749, now seen corresponding path program 1 times [2025-03-03 21:30:16,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:30:16,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321802754] [2025-03-03 21:30:16,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:16,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:30:16,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 21:30:17,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 21:30:17,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:17,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:30:17,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084827011] [2025-03-03 21:30:17,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:17,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:30:17,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:30:17,010 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 21:30:17,012 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 21:30:17,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 21:30:17,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 21:30:17,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:17,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:30:17,106 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:30:17,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 21:30:17,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 21:30:17,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:17,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:30:17,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:30:17,214 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:30:17,215 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:30:17,225 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 21:30:17,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:30:17,424 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:30:17,499 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:30:17,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:30:17 BoogieIcfgContainer [2025-03-03 21:30:17,504 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:30:17,505 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:30:17,505 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:30:17,505 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:30:17,506 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:30:11" (3/4) ... [2025-03-03 21:30:17,507 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:30:17,507 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:30:17,508 INFO L158 Benchmark]: Toolchain (without parser) took 6636.47ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 123.1MB in the beginning and 128.6MB in the end (delta: -5.4MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2025-03-03 21:30:17,509 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:30:17,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.10ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 107.7MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:30:17,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.06ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 103.0MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:30:17,509 INFO L158 Benchmark]: Boogie Preprocessor took 62.51ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 98.6MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:30:17,510 INFO L158 Benchmark]: IcfgBuilder took 449.49ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 67.0MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 21:30:17,510 INFO L158 Benchmark]: TraceAbstraction took 5788.73ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 66.2MB in the beginning and 128.6MB in the end (delta: -62.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:30:17,510 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 209.7MB. Free memory was 128.6MB in the beginning and 128.6MB in the end (delta: 64.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:30:17,511 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.19ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.10ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 107.7MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.06ms. Allocated memory is still 167.8MB. Free memory was 107.7MB in the beginning and 103.0MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.51ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 98.6MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 449.49ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 67.0MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5788.73ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 66.2MB in the beginning and 128.6MB in the end (delta: -62.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 209.7MB. Free memory was 128.6MB in the beginning and 128.6MB in the end (delta: 64.6kB). 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 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 148, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 170. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_20 = 0; [L38] double var_1_21 = 4.65; [L39] double var_1_23 = 9999999999.1; [L40] double var_1_24 = 5.5; [L41] unsigned short int var_1_25 = 16; [L42] signed long int var_1_27 = 32; [L43] signed char var_1_31 = 32; [L44] signed char var_1_32 = 32; [L45] signed short int var_1_33 = 100; [L46] unsigned char var_1_34 = 1; [L47] double var_1_35 = 3.8; [L48] unsigned char var_1_36 = 0; [L49] signed short int var_1_37 = -256; [L50] unsigned short int var_1_38 = 4; [L51] double last_1_var_1_9 = 4.6; [L52] unsigned char last_1_var_1_12 = 100; [L53] unsigned char last_1_var_1_14 = 0; [L54] signed long int last_1_var_1_16 = 0; VAL [isInitial=0, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L176] last_1_var_1_9 = var_1_9 [L177] last_1_var_1_12 = var_1_12 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L137] var_1_5 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L138] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L139] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L139] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L140] var_1_7 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L141] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L142] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L142] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L143] var_1_8 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L144] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L145] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L145] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L146] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L146] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L147] var_1_10 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L148] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L149] var_1_13 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L150] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L151] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L151] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L152] var_1_18 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L153] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L154] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L154] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L155] var_1_20 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L156] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L157] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L157] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L158] var_1_23 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L159] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L160] var_1_24 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L161] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L162] var_1_31 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L163] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L164] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L164] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L165] var_1_32 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L166] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L167] CALL assume_abort_if_not(var_1_32 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L167] RET assume_abort_if_not(var_1_32 <= 127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L168] var_1_35 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L169] RET assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L170] CALL assume_abort_if_not(var_1_35 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L170] RET assume_abort_if_not(var_1_35 != 0.0F) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L171] var_1_36 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_36 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L172] RET assume_abort_if_not(var_1_36 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L173] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L173] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L190] RET updateVariables() [L191] CALL step() [L58] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L59] COND FALSE !(\read(last_1_var_1_14)) [L70] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L72] var_1_16 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L73] COND FALSE !(var_1_31 >= var_1_32) [L78] var_1_34 = ((var_1_24 >= (var_1_11 / var_1_35)) || var_1_36) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L80] EXPR var_1_12 | var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L80] EXPR var_1_12 ^ (var_1_12 | var_1_16) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L80] EXPR var_1_31 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L80] COND FALSE !((var_1_12 ^ (var_1_12 | var_1_16)) < (var_1_31 ^ var_1_12)) [L83] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L84] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L85] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L86] COND FALSE !(stepLocal_5 >= var_1_16) [L89] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L92] var_1_38 = var_1_12 [L93] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L94] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L94] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L95] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L99] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L100] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L101] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=99, var_1_9=23/5] [L104] COND TRUE stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1) [L105] var_1_6 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L108] var_1_25 = var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L109] COND FALSE !(((((var_1_9) > (var_1_24)) ? (var_1_9) : (var_1_24))) > var_1_23) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L122] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L123] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L124] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L126] COND FALSE !(! var_1_14) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L129] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=23/5] [L130] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L131] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L133] var_1_17 = (var_1_18 || (var_1_6 && var_1_20)) [L134] var_1_33 = var_1_31 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L191] RET step() [L192] CALL, EXPR property() [L182] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L182-L183] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=99, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1562 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1557 mSDsluCounter, 2637 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1852 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1463 IncrementalHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 785 mSDtfsCounter, 1463 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 573 GetRequests, 515 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=314occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 259 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1672 NumberOfCodeBlocks, 1672 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1495 ConstructedInterpolants, 0 QuantifiedInterpolants, 3756 SizeOfPredicates, 2 NumberOfNonLiveVariables, 834 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 9701/9936 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 21:30:17,532 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-pr-co_file-68.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 0767bce9c4099f45ee11cd1ef676ae525a65f96727af97d4487455a7a72fa712 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:30:19,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:30:19,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:30:19,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:30:19,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:30:19,290 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:30:19,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:30:19,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:30:19,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:30:19,291 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:30:19,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:30:19,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:30:19,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:30:19,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:30:19,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:30:19,293 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:30:19,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:30:19,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:30:19,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:30:19,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:30:19,294 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:30:19,294 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:30:19,294 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:30:19,294 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:30:19,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:30:19,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:30:19,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:30:19,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:30:19,294 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 -> 0767bce9c4099f45ee11cd1ef676ae525a65f96727af97d4487455a7a72fa712 [2025-03-03 21:30:19,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:30:19,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:30:19,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:30:19,525 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:30:19,525 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:30:19,526 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-pr-co_file-68.i [2025-03-03 21:30:20,680 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb9aa9493/2301f1dec28b433eb176a886356c765f/FLAGc3b1035e0 [2025-03-03 21:30:20,883 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:30:20,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-68.i [2025-03-03 21:30:20,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb9aa9493/2301f1dec28b433eb176a886356c765f/FLAGc3b1035e0 [2025-03-03 21:30:21,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb9aa9493/2301f1dec28b433eb176a886356c765f [2025-03-03 21:30:21,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:30:21,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:30:21,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:30:21,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:30:21,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:30:21,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717be6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21, skipping insertion in model container [2025-03-03 21:30:21,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,270 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:30:21,361 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-pr-co_file-68.i[919,932] [2025-03-03 21:30:21,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:30:21,412 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:30:21,419 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-pr-co_file-68.i[919,932] [2025-03-03 21:30:21,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:30:21,456 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:30:21,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21 WrapperNode [2025-03-03 21:30:21,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:30:21,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:30:21,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:30:21,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:30:21,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,487 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2025-03-03 21:30:21,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:30:21,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:30:21,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:30:21,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:30:21,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,504 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 21:30:21,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:30:21,514 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:30:21,515 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:30:21,515 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:30:21,515 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21" (1/1) ... [2025-03-03 21:30:21,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:30:21,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:30:21,536 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 21:30:21,539 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 21:30:21,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:30:21,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:30:21,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:30:21,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:30:21,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:30:21,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:30:21,608 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:30:21,610 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:30:26,653 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 21:30:26,654 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:30:26,660 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:30:26,660 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:30:26,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:30:26 BoogieIcfgContainer [2025-03-03 21:30:26,660 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:30:26,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:30:26,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:30:26,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:30:26,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:30:21" (1/3) ... [2025-03-03 21:30:26,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57790f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:30:26, skipping insertion in model container [2025-03-03 21:30:26,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:21" (2/3) ... [2025-03-03 21:30:26,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57790f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:30:26, skipping insertion in model container [2025-03-03 21:30:26,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:30:26" (3/3) ... [2025-03-03 21:30:26,667 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-68.i [2025-03-03 21:30:26,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:30:26,677 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-68.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:30:26,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:30:26,737 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;@77ae3c09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:30:26,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:30:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 21:30:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 21:30:26,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:30:26,746 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:30:26,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:30:26,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:30:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1982345120, now seen corresponding path program 1 times [2025-03-03 21:30:26,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:30:26,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047237568] [2025-03-03 21:30:26,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:26,759 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 21:30:26,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:30:26,761 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 21:30:26,762 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 21:30:26,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:30:27,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:30:27,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:27,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:30:27,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:30:27,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:30:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-03-03 21:30:27,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:30:27,560 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:30:27,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047237568] [2025-03-03 21:30:27,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047237568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:30:27,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:30:27,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:30:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816113897] [2025-03-03 21:30:27,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:30:27,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:30:27,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:30:27,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:30:27,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:30:27,578 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 21:30:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:30:27,596 INFO L93 Difference]: Finished difference Result 156 states and 267 transitions. [2025-03-03 21:30:27,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:30:27,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2025-03-03 21:30:27,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:30:27,604 INFO L225 Difference]: With dead ends: 156 [2025-03-03 21:30:27,604 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 21:30:27,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:30:27,609 INFO L435 NwaCegarLoop]: 119 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, 119 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 21:30:27,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:30:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 21:30:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-03 21:30:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 21:30:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2025-03-03 21:30:27,640 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 160 [2025-03-03 21:30:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:30:27,641 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2025-03-03 21:30:27,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-03 21:30:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2025-03-03 21:30:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 21:30:27,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:30:27,645 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:30:27,664 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 21:30:27,845 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 21:30:27,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:30:27,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:30:27,846 INFO L85 PathProgramCache]: Analyzing trace with hash 952318752, now seen corresponding path program 1 times [2025-03-03 21:30:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:30:27,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333554525] [2025-03-03 21:30:27,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:27,849 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 21:30:27,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:30:27,850 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 21:30:27,851 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 21:30:27,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:30:28,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:30:28,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:28,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:30:28,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 21:30:28,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:30:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 21:30:31,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:30:31,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:30:31,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333554525] [2025-03-03 21:30:31,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333554525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:30:31,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:30:31,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 21:30:31,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937620873] [2025-03-03 21:30:31,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:30:31,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:30:31,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:30:31,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:30:31,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:30:31,755 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:30:38,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:30:38,385 INFO L93 Difference]: Finished difference Result 348 states and 528 transitions. [2025-03-03 21:30:38,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 21:30:38,394 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-03-03 21:30:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:30:38,399 INFO L225 Difference]: With dead ends: 348 [2025-03-03 21:30:38,399 INFO L226 Difference]: Without dead ends: 273 [2025-03-03 21:30:38,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:30:38,401 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 406 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:30:38,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 573 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-03-03 21:30:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-03 21:30:38,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 234. [2025-03-03 21:30:38,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 148 states have (on average 1.3175675675675675) internal successors, (195), 150 states have internal predecessors, (195), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 21:30:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 355 transitions. [2025-03-03 21:30:38,448 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 355 transitions. Word has length 160 [2025-03-03 21:30:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:30:38,449 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 355 transitions. [2025-03-03 21:30:38,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:30:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 355 transitions. [2025-03-03 21:30:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 21:30:38,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:30:38,450 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:30:38,472 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 21:30:38,652 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 21:30:38,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:30:38,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:30:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1835096735, now seen corresponding path program 1 times [2025-03-03 21:30:38,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:30:38,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37320113] [2025-03-03 21:30:38,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:38,655 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 21:30:38,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:30:38,657 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 21:30:38,658 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 21:30:38,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:30:39,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:30:39,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:39,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:30:39,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 21:30:39,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:30:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-03 21:30:39,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:30:39,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:30:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37320113] [2025-03-03 21:30:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37320113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:30:39,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:30:39,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:30:39,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891578064] [2025-03-03 21:30:39,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:30:39,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:30:39,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:30:39,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:30:39,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:30:39,616 INFO L87 Difference]: Start difference. First operand 234 states and 355 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:30:40,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:30:40,305 INFO L93 Difference]: Finished difference Result 402 states and 608 transitions. [2025-03-03 21:30:40,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:30:40,314 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-03-03 21:30:40,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:30:40,320 INFO L225 Difference]: With dead ends: 402 [2025-03-03 21:30:40,320 INFO L226 Difference]: Without dead ends: 234 [2025-03-03 21:30:40,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:30:40,322 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 110 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:30:40,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 207 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 21:30:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-03 21:30:40,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-03-03 21:30:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 148 states have (on average 1.2972972972972974) internal successors, (192), 150 states have internal predecessors, (192), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 21:30:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 352 transitions. [2025-03-03 21:30:40,361 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 352 transitions. Word has length 160 [2025-03-03 21:30:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:30:40,362 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 352 transitions. [2025-03-03 21:30:40,362 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-03 21:30:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 352 transitions. [2025-03-03 21:30:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 21:30:40,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:30:40,365 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:30:40,383 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 (4)] Forceful destruction successful, exit code 0 [2025-03-03 21:30:40,565 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 21:30:40,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:30:40,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:30:40,566 INFO L85 PathProgramCache]: Analyzing trace with hash -977471828, now seen corresponding path program 1 times [2025-03-03 21:30:40,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:30:40,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390524388] [2025-03-03 21:30:40,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:30:40,567 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 21:30:40,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:30:40,569 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 21:30:40,569 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 21:30:40,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 21:30:41,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 21:30:41,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:30:41,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:30:41,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 21:30:41,293 INFO L279 TraceCheckSpWp]: Computing forward predicates...