./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_loopvsstraightlinecode_100-1loop_file-69.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 0c87eeba4dcda455a6c9da98fd9c5772c12d1f9d0079ace848b4f4280aa9227e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:08:31,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:08:31,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:08:31,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:08:31,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:08:31,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:08:31,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:08:31,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:08:31,308 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:08:31,308 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:08:31,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:08:31,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:08:31,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:08:31,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:08:31,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:08:31,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:08:31,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:08:31,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:08:31,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:08:31,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:08:31,310 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:08:31,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:08:31,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:08:31,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:08:31,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:08:31,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:08:31,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:08:31,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:08:31,310 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 -> 0c87eeba4dcda455a6c9da98fd9c5772c12d1f9d0079ace848b4f4280aa9227e [2025-03-17 03:08:31,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:08:31,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:08:31,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:08:31,597 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:08:31,597 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:08:31,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i [2025-03-17 03:08:32,793 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/375494279/01c35de129c64599b3a5314b4ca41a8b/FLAG5c123609a [2025-03-17 03:08:33,049 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:08:33,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i [2025-03-17 03:08:33,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/375494279/01c35de129c64599b3a5314b4ca41a8b/FLAG5c123609a [2025-03-17 03:08:33,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/375494279/01c35de129c64599b3a5314b4ca41a8b [2025-03-17 03:08:33,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:08:33,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:08:33,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:08:33,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:08:33,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:08:33,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777e9558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33, skipping insertion in model container [2025-03-17 03:08:33,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:08:33,496 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_loopvsstraightlinecode_100-1loop_file-69.i[916,929] [2025-03-17 03:08:33,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:08:33,562 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:08:33,570 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_loopvsstraightlinecode_100-1loop_file-69.i[916,929] [2025-03-17 03:08:33,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:08:33,617 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:08:33,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33 WrapperNode [2025-03-17 03:08:33,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:08:33,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:08:33,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:08:33,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:08:33,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,661 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 255 [2025-03-17 03:08:33,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:08:33,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:08:33,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:08:33,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:08:33,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,687 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-17 03:08:33,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,697 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:08:33,705 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:08:33,705 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:08:33,706 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:08:33,706 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33" (1/1) ... [2025-03-17 03:08:33,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:08:33,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:33,737 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-17 03:08:33,744 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-17 03:08:33,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:08:33,769 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:08:33,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:08:33,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:08:33,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:08:33,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:08:33,826 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:08:33,828 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:08:34,197 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L201: havoc property_#t~bitwise21#1;havoc property_#t~short22#1;havoc property_#t~ite25#1;havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short26#1; [2025-03-17 03:08:34,237 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-17 03:08:34,240 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:08:34,256 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:08:34,256 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:08:34,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:08:34 BoogieIcfgContainer [2025-03-17 03:08:34,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:08:34,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:08:34,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:08:34,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:08:34,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:08:33" (1/3) ... [2025-03-17 03:08:34,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d803554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:08:34, skipping insertion in model container [2025-03-17 03:08:34,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:33" (2/3) ... [2025-03-17 03:08:34,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d803554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:08:34, skipping insertion in model container [2025-03-17 03:08:34,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:08:34" (3/3) ... [2025-03-17 03:08:34,264 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-69.i [2025-03-17 03:08:34,274 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:08:34,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-69.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:08:34,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:08:34,321 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;@1161f326, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:08:34,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:08:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 73 states have internal predecessors, (110), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 03:08:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-17 03:08:34,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:34,337 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:34,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:34,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:34,341 INFO L85 PathProgramCache]: Analyzing trace with hash 412646714, now seen corresponding path program 1 times [2025-03-17 03:08:34,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:34,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422843567] [2025-03-17 03:08:34,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:34,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 03:08:34,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 03:08:34,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:34,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-17 03:08:34,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:34,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422843567] [2025-03-17 03:08:34,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422843567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:08:34,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183378945] [2025-03-17 03:08:34,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:34,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:34,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:34,669 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-17 03:08:34,671 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-17 03:08:34,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 03:08:34,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 03:08:34,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:34,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:34,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:08:34,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:08:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-17 03:08:34,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:08:34,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183378945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:34,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:08:34,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:08:34,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362936566] [2025-03-17 03:08:34,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:34,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:08:34,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:34,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:08:34,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:08:34,893 INFO L87 Difference]: Start difference. First operand has 103 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 73 states have internal predecessors, (110), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 03:08:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:34,932 INFO L93 Difference]: Finished difference Result 205 states and 359 transitions. [2025-03-17 03:08:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:08:34,936 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2025-03-17 03:08:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:34,942 INFO L225 Difference]: With dead ends: 205 [2025-03-17 03:08:34,942 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 03:08:34,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 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-17 03:08:34,946 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:34,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:08:34,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 03:08:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-17 03:08:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 71 states have internal predecessors, (104), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 03:08:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 160 transitions. [2025-03-17 03:08:34,982 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 160 transitions. Word has length 178 [2025-03-17 03:08:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:34,982 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 160 transitions. [2025-03-17 03:08:34,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 03:08:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 160 transitions. [2025-03-17 03:08:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-17 03:08:34,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:34,986 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:34,993 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-17 03:08:35,186 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-17 03:08:35,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:35,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:35,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1350319388, now seen corresponding path program 1 times [2025-03-17 03:08:35,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:35,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036972100] [2025-03-17 03:08:35,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:35,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 03:08:35,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 03:08:35,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:35,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:08:35,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:35,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036972100] [2025-03-17 03:08:35,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036972100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:35,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:35,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:08:35,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958642928] [2025-03-17 03:08:35,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:35,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:08:35,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:35,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:08:35,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:08:35,790 INFO L87 Difference]: Start difference. First operand 101 states and 160 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:08:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:36,031 INFO L93 Difference]: Finished difference Result 303 states and 481 transitions. [2025-03-17 03:08:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:08:36,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2025-03-17 03:08:36,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:36,034 INFO L225 Difference]: With dead ends: 303 [2025-03-17 03:08:36,034 INFO L226 Difference]: Without dead ends: 203 [2025-03-17 03:08:36,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:08:36,035 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 116 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:36,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 532 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:08:36,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-17 03:08:36,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 159. [2025-03-17 03:08:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 100 states have (on average 1.42) internal successors, (142), 100 states have internal predecessors, (142), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:08:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 254 transitions. [2025-03-17 03:08:36,059 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 254 transitions. Word has length 178 [2025-03-17 03:08:36,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:36,060 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 254 transitions. [2025-03-17 03:08:36,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:08:36,060 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 254 transitions. [2025-03-17 03:08:36,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-17 03:08:36,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:36,064 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:36,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:08:36,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:36,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:36,065 INFO L85 PathProgramCache]: Analyzing trace with hash 708253481, now seen corresponding path program 1 times [2025-03-17 03:08:36,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:36,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100189964] [2025-03-17 03:08:36,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:36,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:36,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 03:08:36,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 03:08:36,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:36,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:08:36,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:36,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100189964] [2025-03-17 03:08:36,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100189964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:36,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:36,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 03:08:36,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273974539] [2025-03-17 03:08:36,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:36,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 03:08:36,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:36,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 03:08:36,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:08:36,419 INFO L87 Difference]: Start difference. First operand 159 states and 254 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:08:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:36,482 INFO L93 Difference]: Finished difference Result 364 states and 580 transitions. [2025-03-17 03:08:36,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 03:08:36,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2025-03-17 03:08:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:36,486 INFO L225 Difference]: With dead ends: 364 [2025-03-17 03:08:36,486 INFO L226 Difference]: Without dead ends: 261 [2025-03-17 03:08:36,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 03:08:36,488 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 143 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:36,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 291 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:08:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-17 03:08:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2025-03-17 03:08:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 170 states have (on average 1.4176470588235295) internal successors, (241), 170 states have internal predecessors, (241), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 03:08:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 409 transitions. [2025-03-17 03:08:36,528 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 409 transitions. Word has length 179 [2025-03-17 03:08:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:36,529 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 409 transitions. [2025-03-17 03:08:36,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:08:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 409 transitions. [2025-03-17 03:08:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-17 03:08:36,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:36,533 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:36,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:08:36,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:36,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash 837336200, now seen corresponding path program 1 times [2025-03-17 03:08:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:36,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293112248] [2025-03-17 03:08:36,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:36,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:36,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 03:08:36,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 03:08:36,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:36,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:08:37,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:37,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293112248] [2025-03-17 03:08:37,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293112248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:37,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:37,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:08:37,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752584575] [2025-03-17 03:08:37,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:37,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:08:37,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:37,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:08:37,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:08:37,324 INFO L87 Difference]: Start difference. First operand 258 states and 409 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:08:37,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:37,541 INFO L93 Difference]: Finished difference Result 461 states and 725 transitions. [2025-03-17 03:08:37,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:08:37,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2025-03-17 03:08:37,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:37,544 INFO L225 Difference]: With dead ends: 461 [2025-03-17 03:08:37,544 INFO L226 Difference]: Without dead ends: 265 [2025-03-17 03:08:37,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:08:37,545 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 189 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:37,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 542 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:08:37,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-17 03:08:37,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2025-03-17 03:08:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 173 states have (on average 1.4046242774566473) internal successors, (243), 173 states have internal predecessors, (243), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 03:08:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 411 transitions. [2025-03-17 03:08:37,589 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 411 transitions. Word has length 179 [2025-03-17 03:08:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:37,590 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 411 transitions. [2025-03-17 03:08:37,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:08:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 411 transitions. [2025-03-17 03:08:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-17 03:08:37,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:37,594 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:37,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 03:08:37,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:37,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:37,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1130824222, now seen corresponding path program 1 times [2025-03-17 03:08:37,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:37,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084133245] [2025-03-17 03:08:37,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:37,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:37,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 03:08:37,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 03:08:37,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:37,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-17 03:08:37,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:37,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084133245] [2025-03-17 03:08:37,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084133245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:08:37,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227679462] [2025-03-17 03:08:37,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:37,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:37,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:37,873 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-17 03:08:37,875 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-17 03:08:37,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 03:08:37,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 03:08:37,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:37,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:38,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 03:08:38,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:08:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 543 proven. 63 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2025-03-17 03:08:38,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:08:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-17 03:08:38,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227679462] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:08:38,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:08:38,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 9 [2025-03-17 03:08:38,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2775302] [2025-03-17 03:08:38,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:08:38,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:08:38,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:38,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:08:38,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:08:38,620 INFO L87 Difference]: Start difference. First operand 262 states and 411 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2025-03-17 03:08:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:38,888 INFO L93 Difference]: Finished difference Result 482 states and 740 transitions. [2025-03-17 03:08:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:08:38,889 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 180 [2025-03-17 03:08:38,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:38,891 INFO L225 Difference]: With dead ends: 482 [2025-03-17 03:08:38,891 INFO L226 Difference]: Without dead ends: 280 [2025-03-17 03:08:38,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-17 03:08:38,893 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 244 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:38,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 360 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:08:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-17 03:08:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 260. [2025-03-17 03:08:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 168 states have (on average 1.3214285714285714) internal successors, (222), 169 states have internal predecessors, (222), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 03:08:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2025-03-17 03:08:38,923 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 180 [2025-03-17 03:08:38,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:38,924 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2025-03-17 03:08:38,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2025-03-17 03:08:38,924 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2025-03-17 03:08:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 03:08:38,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:38,926 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:38,933 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-17 03:08:39,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:39,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:39,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1617243847, now seen corresponding path program 1 times [2025-03-17 03:08:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:39,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978550770] [2025-03-17 03:08:39,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:39,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 03:08:39,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 03:08:39,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:39,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-17 03:08:39,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:39,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978550770] [2025-03-17 03:08:39,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978550770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:08:39,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113298561] [2025-03-17 03:08:39,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:39,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:39,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:39,447 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-17 03:08:39,448 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-17 03:08:39,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 03:08:39,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 03:08:39,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:39,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:39,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 03:08:39,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:08:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2025-03-17 03:08:39,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:08:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-17 03:08:39,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113298561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:08:39,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:08:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-17 03:08:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040726484] [2025-03-17 03:08:39,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:08:39,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 03:08:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:39,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 03:08:39,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 03:08:39,840 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-17 03:08:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:40,243 INFO L93 Difference]: Finished difference Result 498 states and 730 transitions. [2025-03-17 03:08:40,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 03:08:40,243 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 181 [2025-03-17 03:08:40,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:40,248 INFO L225 Difference]: With dead ends: 498 [2025-03-17 03:08:40,248 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 03:08:40,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 359 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-17 03:08:40,251 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 565 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:40,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 445 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:08:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 03:08:40,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 272. [2025-03-17 03:08:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 177 states have (on average 1.2937853107344632) internal successors, (229), 178 states have internal predecessors, (229), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 03:08:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 397 transitions. [2025-03-17 03:08:40,289 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 397 transitions. Word has length 181 [2025-03-17 03:08:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:40,290 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 397 transitions. [2025-03-17 03:08:40,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-17 03:08:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 397 transitions. [2025-03-17 03:08:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-17 03:08:40,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:40,291 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:40,298 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-17 03:08:40,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:40,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:40,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash -420812442, now seen corresponding path program 1 times [2025-03-17 03:08:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:40,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897686765] [2025-03-17 03:08:40,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:40,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 03:08:40,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 03:08:40,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:40,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 129 proven. 27 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-03-17 03:08:41,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:41,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897686765] [2025-03-17 03:08:41,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897686765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:08:41,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538031582] [2025-03-17 03:08:41,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:41,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:41,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:41,013 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:08:41,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 03:08:41,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-17 03:08:41,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-17 03:08:41,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:41,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:41,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 03:08:41,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:08:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 599 proven. 27 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2025-03-17 03:08:41,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:08:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 129 proven. 30 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2025-03-17 03:08:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538031582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:08:41,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 03:08:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-17 03:08:41,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411096760] [2025-03-17 03:08:41,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 03:08:41,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 03:08:41,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:41,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 03:08:41,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-17 03:08:41,621 INFO L87 Difference]: Start difference. First operand 272 states and 397 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2025-03-17 03:08:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:42,703 INFO L93 Difference]: Finished difference Result 647 states and 916 transitions. [2025-03-17 03:08:42,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-17 03:08:42,704 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 181 [2025-03-17 03:08:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:42,713 INFO L225 Difference]: With dead ends: 647 [2025-03-17 03:08:42,713 INFO L226 Difference]: Without dead ends: 431 [2025-03-17 03:08:42,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 358 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2025-03-17 03:08:42,719 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 899 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:42,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 1109 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:08:42,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-17 03:08:42,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 284. [2025-03-17 03:08:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 186 states have (on average 1.2795698924731183) internal successors, (238), 187 states have internal predecessors, (238), 84 states have call successors, (84), 13 states have call predecessors, (84), 13 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 03:08:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 406 transitions. [2025-03-17 03:08:42,752 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 406 transitions. Word has length 181 [2025-03-17 03:08:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:42,755 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 406 transitions. [2025-03-17 03:08:42,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 3 states have call successors, (34), 3 states have call predecessors, (34), 7 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2025-03-17 03:08:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 406 transitions. [2025-03-17 03:08:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-17 03:08:42,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:42,758 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:42,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 03:08:42,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:42,959 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:42,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:42,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2077577758, now seen corresponding path program 1 times [2025-03-17 03:08:42,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:42,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353521545] [2025-03-17 03:08:42,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:42,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:42,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 03:08:42,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 03:08:42,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:42,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:08:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-17 03:08:43,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:08:43,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353521545] [2025-03-17 03:08:43,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353521545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:08:43,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:08:43,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:08:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839567916] [2025-03-17 03:08:43,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:08:43,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 03:08:43,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:08:43,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 03:08:43,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 03:08:43,158 INFO L87 Difference]: Start difference. First operand 284 states and 406 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:08:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:08:43,371 INFO L93 Difference]: Finished difference Result 561 states and 804 transitions. [2025-03-17 03:08:43,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:08:43,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2025-03-17 03:08:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:08:43,374 INFO L225 Difference]: With dead ends: 561 [2025-03-17 03:08:43,374 INFO L226 Difference]: Without dead ends: 337 [2025-03-17 03:08:43,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-17 03:08:43,375 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 93 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:08:43,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 410 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:08:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-17 03:08:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 290. [2025-03-17 03:08:43,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 192 states have (on average 1.2864583333333333) internal successors, (247), 192 states have internal predecessors, (247), 84 states have call successors, (84), 13 states have call predecessors, (84), 13 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 03:08:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 415 transitions. [2025-03-17 03:08:43,426 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 415 transitions. Word has length 182 [2025-03-17 03:08:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:08:43,427 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 415 transitions. [2025-03-17 03:08:43,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-17 03:08:43,427 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 415 transitions. [2025-03-17 03:08:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 03:08:43,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:08:43,428 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:08:43,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 03:08:43,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:08:43,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:08:43,429 INFO L85 PathProgramCache]: Analyzing trace with hash -118324306, now seen corresponding path program 1 times [2025-03-17 03:08:43,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:08:43,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878774498] [2025-03-17 03:08:43,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:43,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:08:43,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 03:08:43,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 03:08:43,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:43,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:08:43,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775304998] [2025-03-17 03:08:43,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:08:43,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:43,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:43,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:08:43,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 03:08:43,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 03:08:43,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 03:08:43,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:43,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:08:43,632 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:08:43,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 03:08:43,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 03:08:43,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:08:43,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:08:43,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:08:43,777 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:08:43,777 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:08:43,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 03:08:43,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:08:43,988 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:08:44,084 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:08:44,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:08:44 BoogieIcfgContainer [2025-03-17 03:08:44,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:08:44,087 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:08:44,088 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:08:44,088 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:08:44,088 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:08:34" (3/4) ... [2025-03-17 03:08:44,090 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:08:44,091 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:08:44,092 INFO L158 Benchmark]: Toolchain (without parser) took 10731.58ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 111.1MB in the beginning and 128.1MB in the end (delta: -17.1MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. [2025-03-17 03:08:44,092 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:08:44,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.46ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 94.7MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:08:44,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.08ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 91.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:08:44,093 INFO L158 Benchmark]: Boogie Preprocessor took 43.27ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 87.2MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:08:44,093 INFO L158 Benchmark]: IcfgBuilder took 551.13ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 55.9MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 03:08:44,093 INFO L158 Benchmark]: TraceAbstraction took 9828.78ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 55.4MB in the beginning and 128.2MB in the end (delta: -72.8MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2025-03-17 03:08:44,093 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 276.8MB. Free memory was 128.2MB in the beginning and 128.1MB in the end (delta: 54.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:08:44,094 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.50ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.46ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 94.7MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.08ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 91.2MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.27ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 87.2MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 551.13ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 55.9MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9828.78ms. Allocated memory was 142.6MB in the beginning and 276.8MB in the end (delta: 134.2MB). Free memory was 55.4MB in the beginning and 128.2MB in the end (delta: -72.8MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 276.8MB. Free memory was 128.2MB in the beginning and 128.1MB in the end (delta: 54.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 164, overapproximation of someBinaryFLOATComparisonOperation at line 168, overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryFLOATComparisonOperation at line 166, overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of bitwiseOr at line 89, overapproximation of bitwiseOr at line 201, overapproximation of someBinaryDOUBLEComparisonOperation at line 201, overapproximation of someBinaryDOUBLEComparisonOperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned short int var_1_3 = 47136; [L25] unsigned short int var_1_4 = 10; [L26] unsigned long int var_1_6 = 1660677957; [L27] unsigned long int var_1_7 = 128; [L28] float var_1_9 = 9.4; [L29] float var_1_12 = 16.2; [L30] float var_1_13 = 127.9; [L31] float var_1_14 = 15.5; [L32] unsigned long int var_1_15 = 100; [L33] signed char var_1_16 = 64; [L34] float var_1_17 = 9.7; [L35] signed char var_1_18 = -64; [L36] signed char var_1_19 = -4; [L37] unsigned short int var_1_20 = 64; [L38] unsigned short int var_1_21 = 1; [L39] signed char var_1_22 = 2; [L40] unsigned long int var_1_23 = 8; [L41] unsigned char var_1_24 = 0; [L42] unsigned char var_1_25 = 0; [L43] unsigned char var_1_26 = 0; [L44] unsigned char var_1_27 = 0; [L45] unsigned char var_1_28 = 0; [L46] float last_1_var_1_9 = 9.4; [L47] float last_1_var_1_14 = 15.5; [L48] unsigned long int last_1_var_1_15 = 100; [L49] unsigned short int last_1_var_1_20 = 64; [L50] unsigned long int last_1_var_1_23 = 8; [L51] unsigned char last_1_var_1_24 = 0; [L205] isInitial = 1 [L206] FCALL initially() [L207] int k_loop; [L208] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L208] COND TRUE k_loop < 1 [L209] CALL updateLastVariables() [L193] last_1_var_1_9 = var_1_9 [L194] last_1_var_1_14 = var_1_14 [L195] last_1_var_1_15 = var_1_15 [L196] last_1_var_1_20 = var_1_20 [L197] last_1_var_1_23 = var_1_23 [L198] last_1_var_1_24 = var_1_24 [L209] RET updateLastVariables() [L210] CALL updateVariables() [L148] var_1_2 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L149] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L150] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L150] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=47136, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L151] var_1_3 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L152] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L153] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L153] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=10, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L154] var_1_4 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L155] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L156] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L156] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=1660677957, var_1_7=128, var_1_9=47/5] [L157] var_1_6 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=128, var_1_9=47/5] [L158] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=128, var_1_9=47/5] [L159] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=128, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=128, var_1_9=47/5] [L159] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=128, var_1_9=47/5] [L160] var_1_7 = __VERIFIER_nondet_ulong() [L161] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_9=47/5] [L161] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_9=47/5] [L162] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L162] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=81/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L163] var_1_12 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L164] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_13=1279/10, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L165] var_1_13 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L166] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_17=97/10, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L167] var_1_17 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L168] RET assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L169] CALL assume_abort_if_not(var_1_17 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L169] RET assume_abort_if_not(var_1_17 != 0.0F) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=-64, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L170] var_1_18 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L171] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L172] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L172] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=-4, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L173] var_1_19 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L174] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L175] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L175] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=1, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L176] var_1_21 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L177] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L178] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L178] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L180] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L181] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L181] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L182] var_1_26 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L183] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L184] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L184] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L185] var_1_27 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L186] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L187] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L187] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L188] var_1_28 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L189] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L190] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L190] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L210] RET updateVariables() [L211] CALL step() [L55] unsigned long int stepLocal_0 = var_1_6 * last_1_var_1_23; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=64, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L56] COND FALSE !(\read(last_1_var_1_24)) [L63] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=-98305, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L65] COND TRUE last_1_var_1_14 >= (var_1_13 * last_1_var_1_9) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=-98305, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L66] COND TRUE \read(var_1_2) [L67] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_14=31/2, var_1_15=100, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=-98305, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L80] COND FALSE !(var_1_24 && (var_1_20 < (3349670375u - var_1_4))) [L87] var_1_15 = var_1_20 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_14=31/2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=-98305, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L89] EXPR var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_14=31/2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=-98305, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L89] COND FALSE !(last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) [L96] var_1_14 = var_1_12 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=-98305, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L98] unsigned short int stepLocal_3 = var_1_21; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_3=-98305, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=-98305, var_1_21=-98305, var_1_22=2, var_1_23=8, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L99] COND TRUE var_1_14 < (9999.6f + var_1_12) [L100] var_1_23 = var_1_20 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_3=-98305, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=-98305, var_1_21=-98305, var_1_22=2, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L112] COND FALSE !((256.2 * var_1_14) < var_1_14) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_3=-98305, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=-98305, var_1_21=-98305, var_1_22=2, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L117] COND FALSE !(var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) [L120] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_3=-98305, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=-98305, var_1_21=-98305, var_1_22=2, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L122] COND FALSE !(var_1_13 >= var_1_14) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_3=-98305, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=-98305, var_1_21=-98305, var_1_22=2, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L131] signed char stepLocal_2 = var_1_19; [L132] unsigned long int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_1=-3221225473, stepLocal_2=0, stepLocal_3=-98305, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=-98305, var_1_21=-98305, var_1_22=2, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L133] COND TRUE var_1_12 <= var_1_14 [L134] var_1_22 = var_1_19 VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, stepLocal_0=-25769803784, stepLocal_1=-3221225473, stepLocal_2=0, stepLocal_3=-98305, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=-98305, var_1_21=-98305, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L211] RET step() [L212] CALL, EXPR property() [L201] EXPR (((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=-98305, var_1_21=-98305, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L201] EXPR var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=-98305, var_1_21=-98305, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L201] EXPR (((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=-98305, var_1_21=-98305, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L201] EXPR ((((((((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12)))) && ((var_1_24 && (var_1_20 < (3349670375u - var_1_4))) ? ((var_1_3 > var_1_4) ? (var_1_15 == ((unsigned long int) (4063422496u - 64u))) : (var_1_15 == ((unsigned long int) var_1_20))) : (var_1_15 == ((unsigned long int) var_1_20)))) && ((var_1_13 >= var_1_14) ? ((((- var_1_9) * (var_1_14 * var_1_13)) < var_1_12) ? (((- var_1_14) <= (((((var_1_9) > (4.375f)) ? (var_1_9) : (4.375f))) * (var_1_9 / var_1_17))) ? (var_1_16 == ((signed char) ((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_16 == ((signed char) 1))) : 1) : 1)) && (last_1_var_1_24 ? (((var_1_6 * last_1_var_1_23) < var_1_7) ? (var_1_20 == ((unsigned short int) (var_1_4 + var_1_21))) : (var_1_20 == ((unsigned short int) var_1_4))) : (var_1_20 == ((unsigned short int) var_1_21)))) && ((var_1_12 <= var_1_14) ? (var_1_22 == ((signed char) var_1_19)) : (((((((var_1_3 * var_1_16)) < (var_1_20)) ? ((var_1_3 * var_1_16)) : (var_1_20))) > var_1_6) ? ((var_1_19 <= var_1_6) ? (var_1_22 == ((signed char) var_1_18)) : (var_1_22 == ((signed char) var_1_19))) : (var_1_22 == ((signed char) var_1_18))))) && ((var_1_14 < (9999.6f + var_1_12)) ? (var_1_23 == ((unsigned long int) var_1_20)) : ((var_1_14 <= (- (- var_1_14))) ? ((var_1_21 != (- (last_1_var_1_23 & var_1_20))) ? (var_1_23 == ((unsigned long int) var_1_20)) : (var_1_23 == ((unsigned long int) var_1_20))) : (var_1_23 == ((unsigned long int) var_1_3)))) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=-98305, var_1_21=-98305, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L201-L202] return (((((((((var_1_24 && ((var_1_3 - var_1_4) <= var_1_23)) ? (var_1_1 == ((unsigned long int) ((((((var_1_3 + var_1_4)) > ((var_1_6 - var_1_20))) ? ((var_1_3 + var_1_4)) : ((var_1_6 - var_1_20)))) + var_1_20))) : (var_1_1 == ((unsigned long int) var_1_4))) && (((256.2 * var_1_14) < var_1_14) ? (var_1_24 ? (var_1_9 == ((float) (var_1_12 + var_1_13))) : 1) : 1)) && ((last_1_var_1_15 >= (var_1_6 | ((((64u) < 0 ) ? -(64u) : (64u))))) ? (((8 + 5) < var_1_6) ? (var_1_14 == ((float) var_1_13)) : (var_1_14 == ((float) var_1_13))) : (var_1_14 == ((float) var_1_12)))) && ((var_1_24 && (var_1_20 < (3349670375u - var_1_4))) ? ((var_1_3 > var_1_4) ? (var_1_15 == ((unsigned long int) (4063422496u - 64u))) : (var_1_15 == ((unsigned long int) var_1_20))) : (var_1_15 == ((unsigned long int) var_1_20)))) && ((var_1_13 >= var_1_14) ? ((((- var_1_9) * (var_1_14 * var_1_13)) < var_1_12) ? (((- var_1_14) <= (((((var_1_9) > (4.375f)) ? (var_1_9) : (4.375f))) * (var_1_9 / var_1_17))) ? (var_1_16 == ((signed char) ((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_16 == ((signed char) 1))) : 1) : 1)) && (last_1_var_1_24 ? (((var_1_6 * last_1_var_1_23) < var_1_7) ? (var_1_20 == ((unsigned short int) (var_1_4 + var_1_21))) : (var_1_20 == ((unsigned short int) var_1_4))) : (var_1_20 == ((unsigned short int) var_1_21)))) && ((var_1_12 <= var_1_14) ? (var_1_22 == ((signed char) var_1_19)) : (((((((var_1_3 * var_1_16)) < (var_1_20)) ? ((var_1_3 * var_1_16)) : (var_1_20))) > var_1_6) ? ((var_1_19 <= var_1_6) ? (var_1_22 == ((signed char) var_1_18)) : (var_1_22 == ((signed char) var_1_19))) : (var_1_22 == ((signed char) var_1_18))))) && ((var_1_14 < (9999.6f + var_1_12)) ? (var_1_23 == ((unsigned long int) var_1_20)) : ((var_1_14 <= (- (- var_1_14))) ? ((var_1_21 != (- (last_1_var_1_23 & var_1_20))) ? (var_1_23 == ((unsigned long int) var_1_20)) : (var_1_23 == ((unsigned long int) var_1_20))) : (var_1_23 == ((unsigned long int) var_1_3))))) && ((last_1_var_1_14 >= (var_1_13 * last_1_var_1_9)) ? (var_1_2 ? (var_1_24 == ((unsigned char) var_1_25)) : (var_1_24 == ((unsigned char) (var_1_25 || var_1_26)))) : (var_1_25 ? (var_1_24 == ((unsigned char) (var_1_26 && var_1_27))) : ((last_1_var_1_15 == last_1_var_1_20) ? (var_1_24 == ((unsigned char) var_1_28)) : 1))) ; [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=-98305, var_1_21=-98305, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=31/2, last_1_var_1_15=100, last_1_var_1_20=64, last_1_var_1_23=8, last_1_var_1_24=0, last_1_var_1_9=47/5, var_1_12=2, var_1_14=2, var_1_15=32767, var_1_16=64, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=-98305, var_1_21=-98305, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_2=1, var_1_3=32767, var_1_4=0, var_1_6=-3221225473, var_1_7=0, var_1_9=47/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 194 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2349 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2249 mSDsluCounter, 3847 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2635 mSDsCounter, 888 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1409 IncrementalHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 888 mSolverCounterUnsat, 1212 mSDtfsCounter, 1409 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1356 GetRequests, 1268 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=8, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 282 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 2526 NumberOfCodeBlocks, 2526 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2685 ConstructedInterpolants, 0 QuantifiedInterpolants, 6298 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1694 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 22299/22680 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-17 03:08:44,116 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_loopvsstraightlinecode_100-1loop_file-69.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 0c87eeba4dcda455a6c9da98fd9c5772c12d1f9d0079ace848b4f4280aa9227e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:08:46,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:08:46,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:08:46,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:08:46,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:08:46,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:08:46,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:08:46,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:08:46,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:08:46,240 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:08:46,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:08:46,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:08:46,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:08:46,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:08:46,241 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:08:46,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:08:46,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:08:46,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:08:46,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:08:46,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:08:46,242 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:08:46,243 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:08:46,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:08:46,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:08:46,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:08:46,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:08:46,243 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 -> 0c87eeba4dcda455a6c9da98fd9c5772c12d1f9d0079ace848b4f4280aa9227e [2025-03-17 03:08:46,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:08:46,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:08:46,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:08:46,511 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:08:46,511 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:08:46,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i [2025-03-17 03:08:47,768 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69d86235/d7c7dc69c95f4d01918929923a2afc1e/FLAGb3e354542 [2025-03-17 03:08:47,993 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:08:47,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-69.i [2025-03-17 03:08:48,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69d86235/d7c7dc69c95f4d01918929923a2afc1e/FLAGb3e354542 [2025-03-17 03:08:48,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e69d86235/d7c7dc69c95f4d01918929923a2afc1e [2025-03-17 03:08:48,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:08:48,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:08:48,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:08:48,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:08:48,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:08:48,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78241712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48, skipping insertion in model container [2025-03-17 03:08:48,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:08:48,157 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_loopvsstraightlinecode_100-1loop_file-69.i[916,929] [2025-03-17 03:08:48,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:08:48,236 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:08:48,244 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_loopvsstraightlinecode_100-1loop_file-69.i[916,929] [2025-03-17 03:08:48,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:08:48,295 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:08:48,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48 WrapperNode [2025-03-17 03:08:48,297 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:08:48,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:08:48,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:08:48,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:08:48,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,343 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2025-03-17 03:08:48,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:08:48,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:08:48,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:08:48,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:08:48,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,380 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-17 03:08:48,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,392 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:08:48,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:08:48,398 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:08:48,398 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:08:48,399 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48" (1/1) ... [2025-03-17 03:08:48,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:08:48,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:08:48,434 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-17 03:08:48,437 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-17 03:08:48,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:08:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:08:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:08:48,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:08:48,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:08:48,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:08:48,531 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:08:48,533 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:09:08,972 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 03:09:08,972 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:09:08,982 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:09:08,982 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:09:08,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:09:08 BoogieIcfgContainer [2025-03-17 03:09:08,982 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:09:08,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:09:08,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:09:08,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:09:08,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:08:48" (1/3) ... [2025-03-17 03:09:08,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2750e9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:09:08, skipping insertion in model container [2025-03-17 03:09:08,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:08:48" (2/3) ... [2025-03-17 03:09:08,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2750e9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:09:08, skipping insertion in model container [2025-03-17 03:09:08,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:09:08" (3/3) ... [2025-03-17 03:09:08,989 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-69.i [2025-03-17 03:09:08,998 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:09:09,001 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-69.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:09:09,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:09:09,057 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;@6fd712e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:09:09,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:09:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 49 states have (on average 1.530612244897959) internal successors, (75), 50 states have internal predecessors, (75), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 03:09:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 03:09:09,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:09:09,087 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:09:09,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:09:09,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:09:09,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1888788126, now seen corresponding path program 1 times [2025-03-17 03:09:09,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:09:09,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982957278] [2025-03-17 03:09:09,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:09,102 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-17 03:09:09,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:09:09,105 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-17 03:09:09,106 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-17 03:09:09,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 03:09:09,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 03:09:09,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:09,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:09,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:09:09,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:09:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2025-03-17 03:09:09,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:09:09,842 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:09:09,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982957278] [2025-03-17 03:09:09,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982957278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:09:09,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:09:09,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:09:09,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774373617] [2025-03-17 03:09:09,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:09:09,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:09:09,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:09:09,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:09:09,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:09:09,867 INFO L87 Difference]: Start difference. First operand has 80 states, 49 states have (on average 1.530612244897959) internal successors, (75), 50 states have internal predecessors, (75), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 03:09:09,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:09:09,899 INFO L93 Difference]: Finished difference Result 159 states and 289 transitions. [2025-03-17 03:09:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:09:09,901 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 172 [2025-03-17 03:09:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:09:09,905 INFO L225 Difference]: With dead ends: 159 [2025-03-17 03:09:09,905 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 03:09:09,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 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-17 03:09:09,910 INFO L435 NwaCegarLoop]: 129 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, 129 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-17 03:09:09,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:09:09,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 03:09:09,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 03:09:09,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 48 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 03:09:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 127 transitions. [2025-03-17 03:09:09,948 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 127 transitions. Word has length 172 [2025-03-17 03:09:09,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:09:09,948 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 127 transitions. [2025-03-17 03:09:09,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-17 03:09:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 127 transitions. [2025-03-17 03:09:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 03:09:09,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:09:09,952 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:09:09,971 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-17 03:09:10,153 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-17 03:09:10,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:09:10,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:09:10,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1320579072, now seen corresponding path program 1 times [2025-03-17 03:09:10,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:09:10,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729572743] [2025-03-17 03:09:10,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:10,155 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-17 03:09:10,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:09:10,156 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-17 03:09:10,157 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-17 03:09:10,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 03:09:10,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 03:09:10,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:10,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:10,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 03:09:10,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:09:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2025-03-17 03:09:11,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:09:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-17 03:09:13,641 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:09:13,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729572743] [2025-03-17 03:09:13,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729572743] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:09:13,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:09:13,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-17 03:09:13,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544167568] [2025-03-17 03:09:13,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:09:13,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 03:09:13,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:09:13,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 03:09:13,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:09:13,643 INFO L87 Difference]: Start difference. First operand 78 states and 127 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-17 03:09:19,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:09:23,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:09:27,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:09:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:09:27,731 INFO L93 Difference]: Finished difference Result 163 states and 260 transitions. [2025-03-17 03:09:27,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 03:09:27,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 172 [2025-03-17 03:09:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:09:27,810 INFO L225 Difference]: With dead ends: 163 [2025-03-17 03:09:27,810 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 03:09:27,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:09:27,812 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 141 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 51 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2025-03-17 03:09:27,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 219 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 153 Invalid, 3 Unknown, 0 Unchecked, 13.8s Time] [2025-03-17 03:09:27,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 03:09:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2025-03-17 03:09:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 03:09:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2025-03-17 03:09:27,829 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 172 [2025-03-17 03:09:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:09:27,830 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2025-03-17 03:09:27,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-17 03:09:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2025-03-17 03:09:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 03:09:27,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:09:27,834 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:09:27,859 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-17 03:09:28,036 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-17 03:09:28,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:09:28,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:09:28,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1882023585, now seen corresponding path program 1 times [2025-03-17 03:09:28,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:09:28,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025007478] [2025-03-17 03:09:28,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:09:28,039 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-17 03:09:28,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:09:28,041 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-17 03:09:28,042 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-17 03:09:28,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 03:09:28,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 03:09:28,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:09:28,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:09:28,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 03:09:28,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:09:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 573 proven. 18 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2025-03-17 03:09:29,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 03:09:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 63 proven. 18 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-17 03:09:32,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:09:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025007478] [2025-03-17 03:09:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025007478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 03:09:32,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 03:09:32,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-17 03:09:32,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522160164] [2025-03-17 03:09:32,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 03:09:32,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:09:32,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:09:32,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:09:32,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:09:32,185 INFO L87 Difference]: Start difference. First operand 82 states and 129 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-17 03:09:39,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:09:43,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:09:47,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:09:51,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:09:55,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:09:59,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:10:03,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:10:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:10:03,927 INFO L93 Difference]: Finished difference Result 251 states and 391 transitions. [2025-03-17 03:10:03,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 03:10:03,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 172 [2025-03-17 03:10:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:10:03,929 INFO L225 Difference]: With dead ends: 251 [2025-03-17 03:10:03,929 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 03:10:03,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-17 03:10:03,930 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 202 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 114 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:10:03,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 291 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 30.7s Time] [2025-03-17 03:10:03,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 03:10:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 159. [2025-03-17 03:10:03,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 03:10:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 249 transitions. [2025-03-17 03:10:03,957 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 249 transitions. Word has length 172 [2025-03-17 03:10:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:10:03,959 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 249 transitions. [2025-03-17 03:10:03,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-17 03:10:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 249 transitions. [2025-03-17 03:10:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-17 03:10:03,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:10:03,961 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 03:10:03,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 03:10:04,161 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-17 03:10:04,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:10:04,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:10:04,162 INFO L85 PathProgramCache]: Analyzing trace with hash -994519904, now seen corresponding path program 1 times [2025-03-17 03:10:04,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:10:04,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839882542] [2025-03-17 03:10:04,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:10:04,162 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-17 03:10:04,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:10:04,165 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-17 03:10:04,166 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-17 03:10:04,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 03:10:04,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 03:10:04,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:10:04,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:10:04,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 03:10:04,791 INFO L279 TraceCheckSpWp]: Computing forward predicates...