./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_codestructure_steplocals_file-65.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 62b118b0522f1cc3ca03510b37586a3e00d107529042f88171f638147e431ac4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:15:58,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:15:58,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:15:58,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:15:58,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:15:58,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:15:58,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:15:58,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:15:58,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:15:58,755 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:15:58,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:15:58,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:15:58,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:15:58,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:15:58,756 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:15:58,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:15:58,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:15:58,756 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:15:58,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:15:58,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:15:58,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:15:58,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:15:58,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:15:58,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:15:58,758 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:15:58,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:15:58,758 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:15:58,758 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:15:58,758 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:15:58,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:15:58,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:15:58,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:15:58,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:15:58,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:15:58,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:15:58,759 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:15:58,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:15:58,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:15:58,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:15:58,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:15:58,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:15:58,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:15:58,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:15:58,760 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 -> 62b118b0522f1cc3ca03510b37586a3e00d107529042f88171f638147e431ac4 [2025-03-08 10:15:58,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:15:58,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:15:58,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:15:58,979 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:15:58,979 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:15:58,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i [2025-03-08 10:16:00,087 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f97be67/a8af119554144ca89badad8510fa8141/FLAG12e1bfce6 [2025-03-08 10:16:00,302 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:16:00,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i [2025-03-08 10:16:00,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f97be67/a8af119554144ca89badad8510fa8141/FLAG12e1bfce6 [2025-03-08 10:16:00,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f97be67/a8af119554144ca89badad8510fa8141 [2025-03-08 10:16:00,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:16:00,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:16:00,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:16:00,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:16:00,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:16:00,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df3a61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00, skipping insertion in model container [2025-03-08 10:16:00,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:16:00,425 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_codestructure_steplocals_file-65.i[917,930] [2025-03-08 10:16:00,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:16:00,483 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:16:00,492 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_codestructure_steplocals_file-65.i[917,930] [2025-03-08 10:16:00,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:16:00,542 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:16:00,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00 WrapperNode [2025-03-08 10:16:00,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:16:00,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:16:00,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:16:00,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:16:00,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,592 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2025-03-08 10:16:00,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:16:00,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:16:00,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:16:00,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:16:00,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,626 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-08 10:16:00,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:16:00,653 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:16:00,653 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:16:00,653 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:16:00,654 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (1/1) ... [2025-03-08 10:16:00,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:16:00,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:16:00,680 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-08 10:16:00,683 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-08 10:16:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:16:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:16:00,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:16:00,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:16:00,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:16:00,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:16:00,768 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:16:00,769 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:16:01,093 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L153: havoc property_#t~bitwise26#1;havoc property_#t~short27#1;havoc property_#t~bitwise28#1;havoc property_#t~short29#1; [2025-03-08 10:16:01,127 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-08 10:16:01,127 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:16:01,158 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:16:01,159 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:16:01,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:16:01 BoogieIcfgContainer [2025-03-08 10:16:01,160 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:16:01,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:16:01,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:16:01,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:16:01,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:16:00" (1/3) ... [2025-03-08 10:16:01,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566777c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:16:01, skipping insertion in model container [2025-03-08 10:16:01,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:00" (2/3) ... [2025-03-08 10:16:01,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566777c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:16:01, skipping insertion in model container [2025-03-08 10:16:01,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:16:01" (3/3) ... [2025-03-08 10:16:01,167 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-65.i [2025-03-08 10:16:01,179 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:16:01,181 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-65.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:16:01,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:16:01,236 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;@6a2f35c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:16:01,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:16:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 68 states have internal predecessors, (91), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 10:16:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 10:16:01,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:01,255 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:16:01,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:01,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:01,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1666788862, now seen corresponding path program 1 times [2025-03-08 10:16:01,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:01,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500126322] [2025-03-08 10:16:01,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:01,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:01,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 10:16:01,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 10:16:01,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:01,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2025-03-08 10:16:01,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:01,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500126322] [2025-03-08 10:16:01,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500126322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:16:01,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22043804] [2025-03-08 10:16:01,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:01,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:16:01,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:16:01,533 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-08 10:16:01,535 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-08 10:16:01,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 10:16:01,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 10:16:01,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:01,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:01,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:16:01,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:16:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2025-03-08 10:16:01,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:16:01,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22043804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:01,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:16:01,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:16:01,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033343726] [2025-03-08 10:16:01,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:01,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:16:01,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:01,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:16:01,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:16:01,773 INFO L87 Difference]: Start difference. First operand has 106 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 68 states have internal predecessors, (91), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-08 10:16:01,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:01,809 INFO L93 Difference]: Finished difference Result 206 states and 357 transitions. [2025-03-08 10:16:01,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:16:01,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 224 [2025-03-08 10:16:01,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:01,817 INFO L225 Difference]: With dead ends: 206 [2025-03-08 10:16:01,817 INFO L226 Difference]: Without dead ends: 103 [2025-03-08 10:16:01,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 225 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-08 10:16:01,821 INFO L435 NwaCegarLoop]: 154 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, 154 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-08 10:16:01,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:16:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-08 10:16:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-08 10:16:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 10:16:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 158 transitions. [2025-03-08 10:16:01,866 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 158 transitions. Word has length 224 [2025-03-08 10:16:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:01,866 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 158 transitions. [2025-03-08 10:16:01,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-08 10:16:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 158 transitions. [2025-03-08 10:16:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 10:16:01,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:01,871 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:16:01,877 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-08 10:16:02,071 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-08 10:16:02,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:02,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:02,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1763176386, now seen corresponding path program 1 times [2025-03-08 10:16:02,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:02,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802668830] [2025-03-08 10:16:02,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:02,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:02,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 10:16:02,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 10:16:02,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:02,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-08 10:16:03,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:03,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802668830] [2025-03-08 10:16:03,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802668830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:03,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:03,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:16:03,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641406477] [2025-03-08 10:16:03,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:03,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:16:03,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:03,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:16:03,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:16:03,767 INFO L87 Difference]: Start difference. First operand 103 states and 158 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:04,070 INFO L93 Difference]: Finished difference Result 242 states and 371 transitions. [2025-03-08 10:16:04,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:16:04,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 224 [2025-03-08 10:16:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:04,073 INFO L225 Difference]: With dead ends: 242 [2025-03-08 10:16:04,073 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 10:16:04,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:16:04,074 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 89 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:04,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 498 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:16:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 10:16:04,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 123. [2025-03-08 10:16:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 85 states have (on average 1.388235294117647) internal successors, (118), 85 states have internal predecessors, (118), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 10:16:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2025-03-08 10:16:04,085 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 224 [2025-03-08 10:16:04,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:04,086 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 190 transitions. [2025-03-08 10:16:04,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:04,086 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions. [2025-03-08 10:16:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 10:16:04,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:04,088 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:16:04,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:16:04,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:04,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:04,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1687319039, now seen corresponding path program 1 times [2025-03-08 10:16:04,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:04,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808369995] [2025-03-08 10:16:04,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:04,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:04,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 10:16:04,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 10:16:04,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:04,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-08 10:16:06,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:06,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808369995] [2025-03-08 10:16:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808369995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:06,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:06,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:16:06,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73981668] [2025-03-08 10:16:06,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:06,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:16:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:06,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:16:06,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:16:06,112 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:06,486 INFO L93 Difference]: Finished difference Result 351 states and 537 transitions. [2025-03-08 10:16:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:16:06,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 224 [2025-03-08 10:16:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:06,490 INFO L225 Difference]: With dead ends: 351 [2025-03-08 10:16:06,490 INFO L226 Difference]: Without dead ends: 231 [2025-03-08 10:16:06,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:16:06,493 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 123 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:06,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 479 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:16:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-08 10:16:06,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 132. [2025-03-08 10:16:06,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 10:16:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 205 transitions. [2025-03-08 10:16:06,510 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 205 transitions. Word has length 224 [2025-03-08 10:16:06,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:06,510 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 205 transitions. [2025-03-08 10:16:06,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 205 transitions. [2025-03-08 10:16:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 10:16:06,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:06,513 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:16:06,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:16:06,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:06,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2008421990, now seen corresponding path program 1 times [2025-03-08 10:16:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:06,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192760764] [2025-03-08 10:16:06,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:06,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:06,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 10:16:06,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 10:16:06,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:06,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-08 10:16:08,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:08,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192760764] [2025-03-08 10:16:08,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192760764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:08,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:08,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:16:08,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105017936] [2025-03-08 10:16:08,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:08,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:16:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:08,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:16:08,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:16:08,837 INFO L87 Difference]: Start difference. First operand 132 states and 205 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:09,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:09,303 INFO L93 Difference]: Finished difference Result 342 states and 523 transitions. [2025-03-08 10:16:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:16:09,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 225 [2025-03-08 10:16:09,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:09,305 INFO L225 Difference]: With dead ends: 342 [2025-03-08 10:16:09,305 INFO L226 Difference]: Without dead ends: 213 [2025-03-08 10:16:09,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:16:09,307 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 93 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:09,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 540 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:16:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-08 10:16:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 132. [2025-03-08 10:16:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 10:16:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 204 transitions. [2025-03-08 10:16:09,315 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 204 transitions. Word has length 225 [2025-03-08 10:16:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:09,316 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 204 transitions. [2025-03-08 10:16:09,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 204 transitions. [2025-03-08 10:16:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 10:16:09,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:09,317 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:16:09,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:16:09,318 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:09,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:09,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1011349637, now seen corresponding path program 1 times [2025-03-08 10:16:09,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:09,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526064217] [2025-03-08 10:16:09,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:09,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:09,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 10:16:09,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 10:16:09,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:09,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-08 10:16:10,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:10,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526064217] [2025-03-08 10:16:10,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526064217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:10,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:10,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:16:10,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297741447] [2025-03-08 10:16:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:10,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:16:10,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:10,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:16:10,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:16:10,003 INFO L87 Difference]: Start difference. First operand 132 states and 204 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:10,493 INFO L93 Difference]: Finished difference Result 426 states and 632 transitions. [2025-03-08 10:16:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:16:10,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 225 [2025-03-08 10:16:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:10,496 INFO L225 Difference]: With dead ends: 426 [2025-03-08 10:16:10,496 INFO L226 Difference]: Without dead ends: 297 [2025-03-08 10:16:10,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:16:10,497 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 262 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:10,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 849 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:16:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-08 10:16:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 233. [2025-03-08 10:16:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 192 states have (on average 1.4427083333333333) internal successors, (277), 193 states have internal predecessors, (277), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 10:16:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 353 transitions. [2025-03-08 10:16:10,528 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 353 transitions. Word has length 225 [2025-03-08 10:16:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:10,529 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 353 transitions. [2025-03-08 10:16:10,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 353 transitions. [2025-03-08 10:16:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 10:16:10,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:10,532 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:16:10,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:16:10,532 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:10,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash 496202172, now seen corresponding path program 1 times [2025-03-08 10:16:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:10,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491354525] [2025-03-08 10:16:10,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:10,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 10:16:10,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 10:16:10,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:10,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-08 10:16:14,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:14,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491354525] [2025-03-08 10:16:14,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491354525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:14,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:14,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:16:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578188546] [2025-03-08 10:16:14,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:14,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:16:14,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:14,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:16:14,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:16:14,907 INFO L87 Difference]: Start difference. First operand 233 states and 353 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:15,593 INFO L93 Difference]: Finished difference Result 600 states and 893 transitions. [2025-03-08 10:16:15,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:16:15,594 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 225 [2025-03-08 10:16:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:15,597 INFO L225 Difference]: With dead ends: 600 [2025-03-08 10:16:15,597 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 10:16:15,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:16:15,600 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 151 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:15,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 854 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:16:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 10:16:15,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 196. [2025-03-08 10:16:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 155 states have (on average 1.4129032258064516) internal successors, (219), 156 states have internal predecessors, (219), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 10:16:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 295 transitions. [2025-03-08 10:16:15,616 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 295 transitions. Word has length 225 [2025-03-08 10:16:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:15,618 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 295 transitions. [2025-03-08 10:16:15,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 295 transitions. [2025-03-08 10:16:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-08 10:16:15,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:15,620 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:16:15,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:16:15,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:15,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash 875248700, now seen corresponding path program 1 times [2025-03-08 10:16:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:15,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831132894] [2025-03-08 10:16:15,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:15,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:15,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 10:16:15,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 10:16:15,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:15,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:15,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-08 10:16:15,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:15,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831132894] [2025-03-08 10:16:15,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831132894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:15,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:15,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:16:15,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418011120] [2025-03-08 10:16:15,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:15,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:16:15,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:15,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:16:15,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:16:15,777 INFO L87 Difference]: Start difference. First operand 196 states and 295 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:16,012 INFO L93 Difference]: Finished difference Result 674 states and 1010 transitions. [2025-03-08 10:16:16,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:16:16,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 226 [2025-03-08 10:16:16,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:16,016 INFO L225 Difference]: With dead ends: 674 [2025-03-08 10:16:16,016 INFO L226 Difference]: Without dead ends: 481 [2025-03-08 10:16:16,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:16:16,019 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 189 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:16,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 424 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:16:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-08 10:16:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 476. [2025-03-08 10:16:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 383 states have (on average 1.4099216710182767) internal successors, (540), 387 states have internal predecessors, (540), 86 states have call successors, (86), 6 states have call predecessors, (86), 6 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 10:16:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 712 transitions. [2025-03-08 10:16:16,056 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 712 transitions. Word has length 226 [2025-03-08 10:16:16,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:16,057 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 712 transitions. [2025-03-08 10:16:16,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 712 transitions. [2025-03-08 10:16:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-08 10:16:16,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:16,059 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:16:16,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:16:16,060 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:16,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:16,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1004331419, now seen corresponding path program 1 times [2025-03-08 10:16:16,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:16,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451631249] [2025-03-08 10:16:16,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:16,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:16,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 10:16:16,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 10:16:16,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:16,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-08 10:16:17,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:16:17,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451631249] [2025-03-08 10:16:17,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451631249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:17,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:17,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 10:16:17,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655637832] [2025-03-08 10:16:17,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:17,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 10:16:17,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:16:17,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 10:16:17,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:16:17,347 INFO L87 Difference]: Start difference. First operand 476 states and 712 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:18,167 INFO L93 Difference]: Finished difference Result 1202 states and 1757 transitions. [2025-03-08 10:16:18,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:16:18,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 226 [2025-03-08 10:16:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:18,172 INFO L225 Difference]: With dead ends: 1202 [2025-03-08 10:16:18,173 INFO L226 Difference]: Without dead ends: 729 [2025-03-08 10:16:18,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:16:18,176 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 274 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:16:18,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 584 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:16:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-08 10:16:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 611. [2025-03-08 10:16:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 497 states have (on average 1.3843058350100603) internal successors, (688), 503 states have internal predecessors, (688), 102 states have call successors, (102), 11 states have call predecessors, (102), 11 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-08 10:16:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 892 transitions. [2025-03-08 10:16:18,222 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 892 transitions. Word has length 226 [2025-03-08 10:16:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:18,223 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 892 transitions. [2025-03-08 10:16:18,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-08 10:16:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 892 transitions. [2025-03-08 10:16:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-08 10:16:18,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:18,225 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:16:18,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:16:18,225 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:18,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:18,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1937326180, now seen corresponding path program 1 times [2025-03-08 10:16:18,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:16:18,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511543196] [2025-03-08 10:16:18,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:18,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:16:18,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 10:16:18,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 10:16:18,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:18,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:16:18,269 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:16:18,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 10:16:18,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 10:16:18,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:18,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:16:18,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:16:18,371 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:16:18,371 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:16:18,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:16:18,375 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:16:18,466 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:16:18,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:16:18 BoogieIcfgContainer [2025-03-08 10:16:18,468 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:16:18,468 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:16:18,469 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:16:18,469 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:16:18,469 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:16:01" (3/4) ... [2025-03-08 10:16:18,471 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:16:18,471 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:16:18,472 INFO L158 Benchmark]: Toolchain (without parser) took 18150.08ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 113.2MB in the beginning and 280.5MB in the end (delta: -167.3MB). Peak memory consumption was 393.1MB. Max. memory is 16.1GB. [2025-03-08 10:16:18,472 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:16:18,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.08ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.2MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:16:18,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.34ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 94.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:16:18,472 INFO L158 Benchmark]: Boogie Preprocessor took 55.00ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 90.7MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:16:18,472 INFO L158 Benchmark]: IcfgBuilder took 507.10ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 61.0MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:16:18,473 INFO L158 Benchmark]: TraceAbstraction took 17306.45ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 60.6MB in the beginning and 280.6MB in the end (delta: -220.0MB). Peak memory consumption was 342.8MB. Max. memory is 16.1GB. [2025-03-08 10:16:18,473 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 704.6MB. Free memory was 280.6MB in the beginning and 280.5MB in the end (delta: 147.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:16:18,474 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.23ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.08ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.2MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.34ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 94.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.00ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 90.7MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 507.10ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 61.0MB in the end (delta: 29.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17306.45ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 60.6MB in the beginning and 280.6MB in the end (delta: -220.0MB). Peak memory consumption was 342.8MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 704.6MB. Free memory was 280.6MB in the beginning and 280.5MB in the end (delta: 147.2kB). 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 someBinaryArithmeticDOUBLEoperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 153, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_2 = 16; [L24] unsigned short int var_1_3 = 100; [L25] unsigned short int var_1_4 = 10; [L26] signed short int var_1_5 = 256; [L27] signed short int var_1_6 = -10; [L28] signed short int var_1_7 = -25; [L29] unsigned short int var_1_8 = 64; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 1; [L32] unsigned short int var_1_11 = 256; [L33] unsigned short int var_1_12 = 0; [L34] unsigned short int var_1_13 = 64; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 0; [L37] signed char var_1_16 = 50; [L38] float var_1_17 = 8.25; [L39] float var_1_18 = 1.25; [L40] signed char var_1_19 = -100; [L41] double var_1_20 = 100000000.8; [L42] double var_1_21 = 15.125; [L43] double var_1_22 = 99.22; [L44] signed long int var_1_23 = -16; [L45] unsigned char var_1_24 = 1; [L46] signed char var_1_25 = 10; [L47] signed char var_1_26 = 16; [L48] unsigned char var_1_27 = 0; [L49] double var_1_28 = 5.5; VAL [isInitial=0, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_2=16, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L157] isInitial = 1 [L158] FCALL initially() [L159] COND TRUE 1 [L160] FCALL updateLastVariables() [L161] CALL updateVariables() [L93] var_1_2 = __VERIFIER_nondet_ushort() [L94] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L94] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L95] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L96] var_1_3 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L97] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L98] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L99] var_1_4 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L100] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L101] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L101] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L102] var_1_5 = __VERIFIER_nondet_short() [L103] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L103] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L104] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L104] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L105] var_1_6 = __VERIFIER_nondet_short() [L106] CALL assume_abort_if_not(var_1_6 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L106] RET assume_abort_if_not(var_1_6 >= -8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L107] CALL assume_abort_if_not(var_1_6 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L107] RET assume_abort_if_not(var_1_6 <= 8192) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L108] var_1_7 = __VERIFIER_nondet_short() [L109] CALL assume_abort_if_not(var_1_7 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L109] RET assume_abort_if_not(var_1_7 >= -8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_7 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L110] RET assume_abort_if_not(var_1_7 <= 8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L111] var_1_9 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64] [L112] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64] [L113] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L113] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L114] var_1_10 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L115] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L116] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L116] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L117] var_1_11 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L119] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L119] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L120] var_1_12 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L122] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L122] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L123] var_1_13 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L125] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L125] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L126] var_1_15 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L127] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L128] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L128] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L129] var_1_17 = __VERIFIER_nondet_float() [L130] 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, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L130] 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, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L131] var_1_18 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L132] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L133] var_1_19 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L134] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L135] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L136] var_1_21 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L137] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L138] var_1_22 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L139] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L140] var_1_25 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L141] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L142] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L143] var_1_26 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L144] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L145] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L146] var_1_27 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L147] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L148] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L161] RET updateVariables() [L162] CALL step() [L53] unsigned char stepLocal_0 = var_1_4 > 4; VAL [isInitial=1, stepLocal_0=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L54] COND TRUE (var_1_2 <= var_1_3) || stepLocal_0 [L55] var_1_1 = (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=8191, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L59] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=8191, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L64] signed short int stepLocal_1 = var_1_5; VAL [isInitial=1, stepLocal_1=0, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=8191, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L65] EXPR var_1_6 ^ var_1_7 VAL [isInitial=1, stepLocal_1=0, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=8191, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L65] COND FALSE !(stepLocal_1 > (var_1_4 + (var_1_6 ^ var_1_7))) [L68] unsigned short int stepLocal_3 = var_1_4; [L69] unsigned char stepLocal_2 = var_1_14; VAL [isInitial=1, stepLocal_2=1, stepLocal_3=8191, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=8191, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L70] COND FALSE !(var_1_1 < stepLocal_3) [L81] var_1_16 = 100 VAL [isInitial=1, stepLocal_2=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=8191, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L83] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) VAL [isInitial=1, stepLocal_2=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=8191, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L84] EXPR ((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6 VAL [isInitial=1, stepLocal_2=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=8191, var_1_23=-16, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L84] COND FALSE !((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) [L87] var_1_23 = ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16))) VAL [isInitial=1, stepLocal_2=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=8191, var_1_23=32767, var_1_24=1, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L89] var_1_24 = ((var_1_16 <= (var_1_25 - var_1_26)) && var_1_27) [L90] var_1_28 = var_1_21 VAL [isInitial=1, stepLocal_2=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=8191, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L162] RET step() [L163] CALL, EXPR property() [L153] EXPR ((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=8191, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L153] EXPR var_1_6 ^ var_1_7 VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=8191, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L153] EXPR ((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=8191, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L153] EXPR (((((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1)) && ((var_1_1 < var_1_4) ? (((! (var_1_10 || var_1_9)) && var_1_14) ? ((((((2.75f) > (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f))))) ? (2.75f) : (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f)))))) != var_1_18) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16)))))) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=8191, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L153-L154] return (((((((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1)) && ((var_1_1 < var_1_4) ? (((! (var_1_10 || var_1_9)) && var_1_14) ? ((((((2.75f) > (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f))))) ? (2.75f) : (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f)))))) != var_1_18) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16))))))) && (var_1_24 == ((unsigned char) ((var_1_16 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L163] RET, EXPR property() [L163] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=8191, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=32767, var_1_12=32767, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=8191, var_1_21=100000005, var_1_23=32767, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=8191, var_1_5=0, var_1_6=0, var_1_7=8191, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 199 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 9, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1183 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1181 mSDsluCounter, 4382 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3147 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2689 IncrementalHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 1235 mSDtfsCounter, 2689 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=611occurred in iteration=8, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 560 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 2249 NumberOfCodeBlocks, 2249 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2014 ConstructedInterpolants, 0 QuantifiedInterpolants, 11737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 22610/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-08 10:16:18,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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_codestructure_steplocals_file-65.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 62b118b0522f1cc3ca03510b37586a3e00d107529042f88171f638147e431ac4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:16:20,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:16:20,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:16:20,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:16:20,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:16:20,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:16:20,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:16:20,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:16:20,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:16:20,426 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:16:20,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:16:20,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:16:20,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:16:20,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:16:20,427 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:16:20,428 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:16:20,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:16:20,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:16:20,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:16:20,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:16:20,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:16:20,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:16:20,428 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:16:20,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:16:20,428 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:16:20,428 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:16:20,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:16:20,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:16:20,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:16:20,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:16:20,429 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 -> 62b118b0522f1cc3ca03510b37586a3e00d107529042f88171f638147e431ac4 [2025-03-08 10:16:20,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:16:20,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:16:20,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:16:20,656 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:16:20,657 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:16:20,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i [2025-03-08 10:16:21,760 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d158709a5/2964059eb9114b0591b8b64e811e2578/FLAG03124e26a [2025-03-08 10:16:21,947 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:16:21,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-65.i [2025-03-08 10:16:21,954 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d158709a5/2964059eb9114b0591b8b64e811e2578/FLAG03124e26a [2025-03-08 10:16:21,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d158709a5/2964059eb9114b0591b8b64e811e2578 [2025-03-08 10:16:21,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:16:21,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:16:21,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:16:21,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:16:21,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:16:21,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:16:21" (1/1) ... [2025-03-08 10:16:21,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7aec69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:21, skipping insertion in model container [2025-03-08 10:16:21,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:16:21" (1/1) ... [2025-03-08 10:16:21,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:16:22,099 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_codestructure_steplocals_file-65.i[917,930] [2025-03-08 10:16:22,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:16:22,175 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:16:22,182 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_codestructure_steplocals_file-65.i[917,930] [2025-03-08 10:16:22,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:16:22,216 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:16:22,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22 WrapperNode [2025-03-08 10:16:22,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:16:22,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:16:22,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:16:22,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:16:22,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22" (1/1) ... [2025-03-08 10:16:22,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22" (1/1) ... [2025-03-08 10:16:22,261 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2025-03-08 10:16:22,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:16:22,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:16:22,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:16:22,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:16:22,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22" (1/1) ... [2025-03-08 10:16:22,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22" (1/1) ... [2025-03-08 10:16:22,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22" (1/1) ... [2025-03-08 10:16:22,297 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-08 10:16:22,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22" (1/1) ... [2025-03-08 10:16:22,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22" (1/1) ... [2025-03-08 10:16:22,307 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22" (1/1) ... [2025-03-08 10:16:22,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22" (1/1) ... [2025-03-08 10:16:22,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22" (1/1) ... [2025-03-08 10:16:22,316 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22" (1/1) ... [2025-03-08 10:16:22,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:16:22,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:16:22,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:16:22,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:16:22,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22" (1/1) ... [2025-03-08 10:16:22,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:16:22,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:16:22,352 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-08 10:16:22,357 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-08 10:16:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:16:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:16:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:16:22,373 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:16:22,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:16:22,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:16:22,441 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:16:22,442 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:16:23,605 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 10:16:23,605 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:16:23,613 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:16:23,614 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:16:23,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:16:23 BoogieIcfgContainer [2025-03-08 10:16:23,614 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:16:23,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:16:23,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:16:23,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:16:23,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:16:21" (1/3) ... [2025-03-08 10:16:23,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142fdab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:16:23, skipping insertion in model container [2025-03-08 10:16:23,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:16:22" (2/3) ... [2025-03-08 10:16:23,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142fdab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:16:23, skipping insertion in model container [2025-03-08 10:16:23,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:16:23" (3/3) ... [2025-03-08 10:16:23,622 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-65.i [2025-03-08 10:16:23,631 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:16:23,632 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-65.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:16:23,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:16:23,685 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;@69aa9209, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:16:23,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:16:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 10:16:23,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 10:16:23,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:23,699 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:16:23,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:23,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:23,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1588912699, now seen corresponding path program 1 times [2025-03-08 10:16:23,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:16:23,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784503221] [2025-03-08 10:16:23,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:23,716 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-08 10:16:23,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:16:23,718 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-08 10:16:23,719 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-08 10:16:23,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 10:16:24,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 10:16:24,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:24,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:24,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:16:24,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:16:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2025-03-08 10:16:24,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:16:24,081 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:16:24,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784503221] [2025-03-08 10:16:24,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784503221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:16:24,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:16:24,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:16:24,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239340975] [2025-03-08 10:16:24,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:16:24,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:16:24,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:16:24,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:16:24,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:16:24,102 INFO L87 Difference]: Start difference. First operand has 86 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-08 10:16:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:16:24,124 INFO L93 Difference]: Finished difference Result 166 states and 293 transitions. [2025-03-08 10:16:24,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:16:24,125 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 218 [2025-03-08 10:16:24,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:16:24,129 INFO L225 Difference]: With dead ends: 166 [2025-03-08 10:16:24,130 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 10:16:24,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 217 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-08 10:16:24,134 INFO L435 NwaCegarLoop]: 126 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, 126 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-08 10:16:24,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:16:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 10:16:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-08 10:16:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 10:16:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions. [2025-03-08 10:16:24,171 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 218 [2025-03-08 10:16:24,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:16:24,171 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions. [2025-03-08 10:16:24,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-08 10:16:24,171 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions. [2025-03-08 10:16:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 10:16:24,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:16:24,176 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:16:24,186 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-08 10:16:24,377 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-08 10:16:24,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:16:24,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:16:24,378 INFO L85 PathProgramCache]: Analyzing trace with hash -650072059, now seen corresponding path program 1 times [2025-03-08 10:16:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:16:24,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124550171] [2025-03-08 10:16:24,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:16:24,379 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-08 10:16:24,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:16:24,381 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-08 10:16:24,383 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-08 10:16:24,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 10:16:24,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 10:16:24,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:16:24,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:16:24,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 10:16:24,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:17:14,276 WARN L286 SmtUtils]: Spent 17.58s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)