./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.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_fillercode_fillercodesize_ps-cn-10_file-13.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 baf007038ec211927102538fb438f8b8b8e367c83c4b464050e93294cddd4b17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:43:27,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:43:27,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:43:27,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:43:27,614 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:43:27,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:43:27,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:43:27,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:43:27,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:43:27,637 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:43:27,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:43:27,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:43:27,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:43:27,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:43:27,638 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:43:27,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:43:27,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:43:27,639 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:43:27,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:43:27,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:43:27,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:43:27,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:43:27,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:43:27,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:43:27,640 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:43:27,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:43:27,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:43:27,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:43:27,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:43:27,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:43:27,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:43:27,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:43:27,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:43:27,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:43:27,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:43:27,641 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:43:27,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:43:27,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:43:27,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:43:27,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:43:27,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:43:27,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:43:27,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:43:27,641 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 -> baf007038ec211927102538fb438f8b8b8e367c83c4b464050e93294cddd4b17 [2025-03-08 10:43:27,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:43:27,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:43:27,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:43:27,857 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:43:27,857 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:43:27,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2025-03-08 10:43:29,004 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c0881f2/fb31996416d047ebad0d9c0dc4d040fb/FLAG474567d3b [2025-03-08 10:43:29,257 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:43:29,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2025-03-08 10:43:29,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c0881f2/fb31996416d047ebad0d9c0dc4d040fb/FLAG474567d3b [2025-03-08 10:43:29,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79c0881f2/fb31996416d047ebad0d9c0dc4d040fb [2025-03-08 10:43:29,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:43:29,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:43:29,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:43:29,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:43:29,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:43:29,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:43:29" (1/1) ... [2025-03-08 10:43:29,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6d9ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:29, skipping insertion in model container [2025-03-08 10:43:29,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:43:29" (1/1) ... [2025-03-08 10:43:29,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:43:29,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i[915,928] [2025-03-08 10:43:29,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:43:29,732 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:43:29,739 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i[915,928] [2025-03-08 10:43:29,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:43:29,776 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:43:29,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:29 WrapperNode [2025-03-08 10:43:29,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:43:29,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:43:29,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:43:29,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:43:29,783 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:43:29" (1/1) ... [2025-03-08 10:43:29,792 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:43:29" (1/1) ... [2025-03-08 10:43:29,813 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2025-03-08 10:43:29,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:43:29,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:43:29,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:43:29,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:43:29,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:29" (1/1) ... [2025-03-08 10:43:29,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:29" (1/1) ... [2025-03-08 10:43:29,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:29" (1/1) ... [2025-03-08 10:43:29,850 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:43:29,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:29" (1/1) ... [2025-03-08 10:43:29,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:29" (1/1) ... [2025-03-08 10:43:29,862 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:29" (1/1) ... [2025-03-08 10:43:29,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:29" (1/1) ... [2025-03-08 10:43:29,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:29" (1/1) ... [2025-03-08 10:43:29,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:29" (1/1) ... [2025-03-08 10:43:29,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:43:29,874 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:43:29,874 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:43:29,874 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:43:29,875 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:29" (1/1) ... [2025-03-08 10:43:29,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:43:29,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:43:29,900 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:43:29,903 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:43:29,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:43:29,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:43:29,920 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:43:29,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:43:29,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:43:29,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:43:29,980 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:43:29,981 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:43:30,216 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc property_#t~bitwise21#1; [2025-03-08 10:43:30,244 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 10:43:30,244 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:43:30,256 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:43:30,256 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:43:30,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:43:30 BoogieIcfgContainer [2025-03-08 10:43:30,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:43:30,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:43:30,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:43:30,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:43:30,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:43:29" (1/3) ... [2025-03-08 10:43:30,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396793e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:43:30, skipping insertion in model container [2025-03-08 10:43:30,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:29" (2/3) ... [2025-03-08 10:43:30,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396793e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:43:30, skipping insertion in model container [2025-03-08 10:43:30,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:43:30" (3/3) ... [2025-03-08 10:43:30,264 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2025-03-08 10:43:30,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:43:30,275 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-13.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:43:30,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:43:30,320 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;@3d1d1f5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:43:30,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:43:30,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:43:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 10:43:30,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:43:30,334 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:30,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:43:30,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:43:30,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1283931320, now seen corresponding path program 1 times [2025-03-08 10:43:30,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:43:30,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933716784] [2025-03-08 10:43:30,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:43:30,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:43:30,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 10:43:30,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 10:43:30,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:43:30,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:43:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 10:43:30,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:43:30,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933716784] [2025-03-08 10:43:30,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933716784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:43:30,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349645361] [2025-03-08 10:43:30,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:43:30,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:43:30,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:43:30,601 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:43:30,602 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:43:30,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 10:43:30,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 10:43:30,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:43:30,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:43:30,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:43:30,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:43:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 10:43:30,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:43:30,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349645361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:43:30,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:43:30,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:43:30,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249782571] [2025-03-08 10:43:30,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:43:30,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:43:30,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:43:30,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:43:30,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:43:30,828 INFO L87 Difference]: Start difference. First operand has 81 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) 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, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 10:43:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:43:30,855 INFO L93 Difference]: Finished difference Result 156 states and 266 transitions. [2025-03-08 10:43:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:43:30,857 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, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2025-03-08 10:43:30,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:43:30,863 INFO L225 Difference]: With dead ends: 156 [2025-03-08 10:43:30,863 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 10:43:30,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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:43:30,868 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:43:30,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:43:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 10:43:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-08 10:43:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 49 states have internal predecessors, (62), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:43:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2025-03-08 10:43:30,898 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 175 [2025-03-08 10:43:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:43:30,898 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2025-03-08 10:43:30,898 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, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 10:43:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2025-03-08 10:43:30,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 10:43:30,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:43:30,900 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:30,907 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:43:31,101 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:43:31,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:43:31,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:43:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1820341699, now seen corresponding path program 1 times [2025-03-08 10:43:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:43:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739433795] [2025-03-08 10:43:31,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:43:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:43:31,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 10:43:31,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 10:43:31,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:43:31,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:43:31,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:43:31,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:43:31,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739433795] [2025-03-08 10:43:31,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739433795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:43:31,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:43:31,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:43:31,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037382779] [2025-03-08 10:43:31,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:43:31,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:43:31,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:43:31,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:43:31,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:43:31,334 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:43:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:43:31,374 INFO L93 Difference]: Finished difference Result 187 states and 275 transitions. [2025-03-08 10:43:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:43:31,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-08 10:43:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:43:31,377 INFO L225 Difference]: With dead ends: 187 [2025-03-08 10:43:31,377 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 10:43:31,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:43:31,379 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 39 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:43:31,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 250 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:43:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 10:43:31,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2025-03-08 10:43:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 73 states have (on average 1.273972602739726) internal successors, (93), 74 states have internal predecessors, (93), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:43:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2025-03-08 10:43:31,399 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 175 [2025-03-08 10:43:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:43:31,399 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2025-03-08 10:43:31,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:43:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2025-03-08 10:43:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 10:43:31,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:43:31,401 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:31,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:43:31,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:43:31,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:43:31,402 INFO L85 PathProgramCache]: Analyzing trace with hash -967073788, now seen corresponding path program 1 times [2025-03-08 10:43:31,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:43:31,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759977644] [2025-03-08 10:43:31,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:43:31,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:43:31,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 10:43:31,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 10:43:31,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:43:31,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:43:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:43:31,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:43:31,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759977644] [2025-03-08 10:43:31,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759977644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:43:31,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:43:31,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 10:43:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849636331] [2025-03-08 10:43:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:43:31,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 10:43:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:43:31,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 10:43:31,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 10:43:31,871 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:43:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:43:32,238 INFO L93 Difference]: Finished difference Result 310 states and 456 transitions. [2025-03-08 10:43:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:43:32,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2025-03-08 10:43:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:43:32,242 INFO L225 Difference]: With dead ends: 310 [2025-03-08 10:43:32,242 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 10:43:32,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:43:32,243 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 83 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:43:32,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 404 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:43:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 10:43:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 162. [2025-03-08 10:43:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 99 states have internal predecessors, (120), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 10:43:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 240 transitions. [2025-03-08 10:43:32,266 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 240 transitions. Word has length 175 [2025-03-08 10:43:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:43:32,267 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 240 transitions. [2025-03-08 10:43:32,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:43:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 240 transitions. [2025-03-08 10:43:32,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 10:43:32,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:43:32,271 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:32,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:43:32,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:43:32,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:43:32,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1767643550, now seen corresponding path program 1 times [2025-03-08 10:43:32,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:43:32,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216604800] [2025-03-08 10:43:32,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:43:32,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:43:32,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 10:43:32,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 10:43:32,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:43:32,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:43:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:43:32,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:43:32,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216604800] [2025-03-08 10:43:32,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216604800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:43:32,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:43:32,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 10:43:32,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96651688] [2025-03-08 10:43:32,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:43:32,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:43:32,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:43:32,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:43:32,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:43:32,522 INFO L87 Difference]: Start difference. First operand 162 states and 240 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:43:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:43:32,728 INFO L93 Difference]: Finished difference Result 350 states and 511 transitions. [2025-03-08 10:43:32,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:43:32,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2025-03-08 10:43:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:43:32,731 INFO L225 Difference]: With dead ends: 350 [2025-03-08 10:43:32,731 INFO L226 Difference]: Without dead ends: 244 [2025-03-08 10:43:32,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:43:32,732 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 140 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:43:32,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 352 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:43:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-08 10:43:32,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 168. [2025-03-08 10:43:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 105 states have internal predecessors, (128), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 10:43:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2025-03-08 10:43:32,766 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 176 [2025-03-08 10:43:32,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:43:32,767 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2025-03-08 10:43:32,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:43:32,768 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2025-03-08 10:43:32,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 10:43:32,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:43:32,770 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:32,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:43:32,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:43:32,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:43:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2061046557, now seen corresponding path program 1 times [2025-03-08 10:43:32,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:43:32,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522819795] [2025-03-08 10:43:32,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:43:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:43:32,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 10:43:32,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 10:43:32,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:43:32,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:43:32,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1863958001] [2025-03-08 10:43:32,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:43:32,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:43:32,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:43:32,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:43:32,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:43:32,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 10:43:33,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 10:43:33,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:43:33,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:43:33,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:43:33,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 10:43:33,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 10:43:33,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:43:33,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:43:33,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:43:33,139 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:43:33,140 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:43:33,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 10:43:33,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:43:33,344 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 10:43:33,428 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:43:33,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:43:33 BoogieIcfgContainer [2025-03-08 10:43:33,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:43:33,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:43:33,432 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:43:33,432 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:43:33,432 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:43:30" (3/4) ... [2025-03-08 10:43:33,434 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:43:33,434 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:43:33,435 INFO L158 Benchmark]: Toolchain (without parser) took 3863.86ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 98.2MB in the end (delta: 33.3MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2025-03-08 10:43:33,435 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:43:33,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.04ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 116.7MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:43:33,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.05ms. Allocated memory is still 167.8MB. Free memory was 116.7MB in the beginning and 113.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:43:33,435 INFO L158 Benchmark]: Boogie Preprocessor took 58.68ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 108.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:43:33,435 INFO L158 Benchmark]: IcfgBuilder took 382.62ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 84.3MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 10:43:33,436 INFO L158 Benchmark]: TraceAbstraction took 3172.12ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 98.3MB in the end (delta: -14.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:43:33,436 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 98.2MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:43:33,437 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.04ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 116.7MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.05ms. Allocated memory is still 167.8MB. Free memory was 116.7MB in the beginning and 113.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.68ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 108.4MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 382.62ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 84.3MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3172.12ms. Allocated memory is still 167.8MB. Free memory was 83.5MB in the beginning and 98.3MB in the end (delta: -14.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 167.8MB. Free memory was 98.3MB in the beginning and 98.2MB in the end (delta: 46.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 someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 140. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed char var_1_4 = 16; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 64; [L30] signed char var_1_12 = -10; [L31] signed char var_1_13 = -10; [L32] signed char var_1_14 = -25; [L33] double var_1_15 = 64.875; [L34] double var_1_17 = 1.625; [L35] double var_1_18 = 32.2; [L36] double var_1_19 = 8.6; [L37] double var_1_20 = 10.5; [L38] signed short int var_1_21 = -64; [L39] unsigned char var_1_22 = 25; [L40] unsigned char var_1_23 = 0; [L41] unsigned long int var_1_24 = 5; [L42] double var_1_25 = 0.75; [L43] double var_1_26 = 99999999999999.5; [L44] unsigned char var_1_27 = 4; [L45] unsigned char var_1_28 = 64; [L46] signed long int var_1_29 = 128; [L47] signed char var_1_30 = -5; [L48] signed char var_1_31 = -100; [L49] unsigned long int var_1_32 = 1; [L50] unsigned long int var_1_33 = 8; [L51] unsigned char var_1_34 = 5; [L52] double var_1_35 = 10000.225; [L53] signed short int last_1_var_1_21 = -64; [L54] unsigned char last_1_var_1_22 = 25; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L154] last_1_var_1_21 = var_1_21 [L155] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=16, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L109] var_1_4 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L110] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L111] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L112] var_1_5 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L113] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L114] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L115] var_1_6 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_8=1, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L117] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L118] var_1_9 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L119] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1] [L120] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L120] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L121] var_1_10 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L122] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L123] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L123] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L124] var_1_11 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L125] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L126] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L126] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L127] var_1_13 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L128] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L129] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L129] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L130] var_1_14 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L131] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L132] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L133] var_1_17 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L134] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L135] var_1_18 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L136] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L137] var_1_19 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L138] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L139] var_1_20 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L140] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_26=199999999999999/2, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L141] var_1_26 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L142] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=64, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L143] var_1_28 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L145] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=-100, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L146] var_1_31 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L148] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=8, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L149] var_1_33 = __VERIFIER_nondet_ulong() [L150] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L150] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_28=1, var_1_29=128, var_1_30=-5, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L166] RET updateVariables() [L167] CALL step() [L58] var_1_25 = var_1_26 [L59] var_1_27 = var_1_28 [L60] var_1_29 = var_1_28 [L61] var_1_30 = var_1_31 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L62] COND TRUE ((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31))) < var_1_29 [L63] var_1_32 = var_1_33 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=5, var_1_35=400009/40, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L65] var_1_34 = var_1_28 [L66] var_1_35 = var_1_26 [L67] signed long int stepLocal_1 = ~ last_1_var_1_21; [L68] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L69] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=1, stepLocal_1=63, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L69] COND TRUE stepLocal_1 != (last_1_var_1_22 >> var_1_4) [L70] COND TRUE stepLocal_0 || var_1_6 [L71] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L78] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L81] unsigned short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_3=0, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L82] COND FALSE !(var_1_4 > stepLocal_3) [L85] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L87] COND TRUE ((- var_1_11) < 8) || var_1_9 [L88] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=0, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L90] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=5, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L91] COND TRUE var_1_18 <= var_1_20 [L92] var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L98] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L103] signed short int stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_2=-64, var_1_10=-129, var_1_11=63, var_1_12=-10, var_1_13=31, var_1_14=-17, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L104] COND TRUE var_1_10 > stepLocal_2 [L105] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=14, var_1_13=31, var_1_14=-17, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=14, var_1_13=31, var_1_14=-17, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L158-L159] return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1)) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=14, var_1_13=31, var_1_14=-17, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=-129, var_1_11=63, var_1_12=14, var_1_13=31, var_1_14=-17, var_1_15=3, var_1_17=3, var_1_1=0, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=2, var_1_4=0, var_1_5=1, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 149 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 1120 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 656 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 295 IncrementalHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 464 mSDtfsCounter, 295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=4, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 121 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1228 NumberOfCodeBlocks, 1228 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 871 ConstructedInterpolants, 0 QuantifiedInterpolants, 2592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 6968/7020 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:43:33,453 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_fillercode_fillercodesize_ps-cn-10_file-13.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 baf007038ec211927102538fb438f8b8b8e367c83c4b464050e93294cddd4b17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:43:35,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:43:35,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:43:35,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:43:35,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:43:35,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:43:35,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:43:35,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:43:35,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:43:35,293 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:43:35,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:43:35,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:43:35,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:43:35,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:43:35,293 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:43:35,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:43:35,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:43:35,294 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:43:35,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:43:35,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:43:35,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:43:35,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:43:35,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:43:35,294 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:43:35,294 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:43:35,294 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:43:35,295 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:43:35,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:43:35,295 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:43:35,295 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:43:35,295 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:43:35,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:43:35,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:43:35,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:43:35,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:43:35,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:43:35,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:43:35,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:43:35,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:43:35,296 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:43:35,296 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:43:35,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:43:35,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:43:35,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:43:35,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:43:35,296 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 -> baf007038ec211927102538fb438f8b8b8e367c83c4b464050e93294cddd4b17 [2025-03-08 10:43:35,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:43:35,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:43:35,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:43:35,534 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:43:35,534 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:43:35,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2025-03-08 10:43:36,650 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ac9a913/877effea3dfd4743b1962942076db76f/FLAGe6a1219d2 [2025-03-08 10:43:36,813 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:43:36,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2025-03-08 10:43:36,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ac9a913/877effea3dfd4743b1962942076db76f/FLAGe6a1219d2 [2025-03-08 10:43:37,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73ac9a913/877effea3dfd4743b1962942076db76f [2025-03-08 10:43:37,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:43:37,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:43:37,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:43:37,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:43:37,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:43:37,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:43:37" (1/1) ... [2025-03-08 10:43:37,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7a081e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:37, skipping insertion in model container [2025-03-08 10:43:37,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:43:37" (1/1) ... [2025-03-08 10:43:37,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:43:37,328 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i[915,928] [2025-03-08 10:43:37,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:43:37,384 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:43:37,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-13.i[915,928] [2025-03-08 10:43:37,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:43:37,426 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:43:37,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:37 WrapperNode [2025-03-08 10:43:37,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:43:37,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:43:37,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:43:37,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:43:37,434 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:43:37" (1/1) ... [2025-03-08 10:43:37,445 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:43:37" (1/1) ... [2025-03-08 10:43:37,473 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2025-03-08 10:43:37,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:43:37,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:43:37,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:43:37,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:43:37,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:37" (1/1) ... [2025-03-08 10:43:37,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:37" (1/1) ... [2025-03-08 10:43:37,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:37" (1/1) ... [2025-03-08 10:43:37,496 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:43:37,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:37" (1/1) ... [2025-03-08 10:43:37,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:37" (1/1) ... [2025-03-08 10:43:37,511 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:37" (1/1) ... [2025-03-08 10:43:37,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:37" (1/1) ... [2025-03-08 10:43:37,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:37" (1/1) ... [2025-03-08 10:43:37,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:37" (1/1) ... [2025-03-08 10:43:37,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:43:37,525 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:43:37,525 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:43:37,525 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:43:37,526 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:37" (1/1) ... [2025-03-08 10:43:37,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:43:37,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:43:37,551 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:43:37,554 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:43:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:43:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:43:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:43:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:43:37,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:43:37,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:43:37,648 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:43:37,650 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:43:41,404 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 10:43:41,405 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:43:41,412 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:43:41,413 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:43:41,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:43:41 BoogieIcfgContainer [2025-03-08 10:43:41,414 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:43:41,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:43:41,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:43:41,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:43:41,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:43:37" (1/3) ... [2025-03-08 10:43:41,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c10166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:43:41, skipping insertion in model container [2025-03-08 10:43:41,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:43:37" (2/3) ... [2025-03-08 10:43:41,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c10166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:43:41, skipping insertion in model container [2025-03-08 10:43:41,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:43:41" (3/3) ... [2025-03-08 10:43:41,424 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-13.i [2025-03-08 10:43:41,434 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:43:41,437 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-13.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:43:41,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:43:41,493 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;@582d145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:43:41,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:43:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:43:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 10:43:41,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:43:41,508 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:41,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:43:41,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:43:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash 203833185, now seen corresponding path program 1 times [2025-03-08 10:43:41,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:43:41,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656808903] [2025-03-08 10:43:41,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:43:41,524 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:43:41,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:43:41,527 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:43:41,528 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:43:41,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 10:43:41,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 10:43:41,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:43:41,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:43:41,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:43:41,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:43:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-08 10:43:41,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:43:41,913 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:43:41,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656808903] [2025-03-08 10:43:41,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656808903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:43:41,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:43:41,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:43:41,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925227404] [2025-03-08 10:43:41,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:43:41,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:43:41,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:43:41,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:43:41,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:43:41,934 INFO L87 Difference]: Start difference. First operand has 76 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 10:43:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:43:41,957 INFO L93 Difference]: Finished difference Result 146 states and 252 transitions. [2025-03-08 10:43:41,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:43:41,959 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 172 [2025-03-08 10:43:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:43:41,963 INFO L225 Difference]: With dead ends: 146 [2025-03-08 10:43:41,963 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 10:43:41,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:43:41,967 INFO L435 NwaCegarLoop]: 109 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, 109 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:43:41,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:43:41,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 10:43:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-08 10:43:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:43:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2025-03-08 10:43:42,006 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 172 [2025-03-08 10:43:42,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:43:42,007 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2025-03-08 10:43:42,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 10:43:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2025-03-08 10:43:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 10:43:42,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:43:42,012 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:42,023 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:43:42,213 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:43:42,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:43:42,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:43:42,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2145474246, now seen corresponding path program 1 times [2025-03-08 10:43:42,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:43:42,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783569411] [2025-03-08 10:43:42,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:43:42,214 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:43:42,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:43:42,217 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:43:42,217 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:43:42,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 10:43:42,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 10:43:42,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:43:42,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:43:42,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 10:43:42,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:43:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:43:43,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:43:43,863 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:43:43,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783569411] [2025-03-08 10:43:43,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783569411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:43:43,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:43:43,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:43:43,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143926296] [2025-03-08 10:43:43,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:43:43,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 10:43:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:43:43,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 10:43:43,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:43:43,865 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:43:45,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:43:47,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:43:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:43:47,154 INFO L93 Difference]: Finished difference Result 214 states and 322 transitions. [2025-03-08 10:43:47,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 10:43:47,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-08 10:43:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:43:47,176 INFO L225 Difference]: With dead ends: 214 [2025-03-08 10:43:47,176 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 10:43:47,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:43:47,177 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 63 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:43:47,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 351 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 10:43:47,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 10:43:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2025-03-08 10:43:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 68 states have internal predecessors, (80), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 10:43:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 188 transitions. [2025-03-08 10:43:47,210 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 188 transitions. Word has length 172 [2025-03-08 10:43:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:43:47,210 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 188 transitions. [2025-03-08 10:43:47,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:43:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 188 transitions. [2025-03-08 10:43:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 10:43:47,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:43:47,215 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:47,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 10:43:47,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:43:47,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:43:47,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:43:47,416 INFO L85 PathProgramCache]: Analyzing trace with hash 666632195, now seen corresponding path program 1 times [2025-03-08 10:43:47,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:43:47,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629788590] [2025-03-08 10:43:47,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:43:47,419 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:43:47,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:43:47,421 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:43:47,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 10:43:47,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 10:43:47,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 10:43:47,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:43:47,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:43:47,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 10:43:47,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:43:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:43:47,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:43:47,726 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:43:47,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629788590] [2025-03-08 10:43:47,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629788590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:43:47,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:43:47,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:43:47,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997883482] [2025-03-08 10:43:47,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:43:47,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:43:47,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:43:47,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:43:47,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:43:47,728 INFO L87 Difference]: Start difference. First operand 125 states and 188 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:43:49,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:43:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:43:49,254 INFO L93 Difference]: Finished difference Result 226 states and 336 transitions. [2025-03-08 10:43:49,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:43:49,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2025-03-08 10:43:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:43:49,256 INFO L225 Difference]: With dead ends: 226 [2025-03-08 10:43:49,256 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 10:43:49,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:43:49,257 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 35 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:43:49,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 234 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 10:43:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 10:43:49,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2025-03-08 10:43:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 89 states have (on average 1.202247191011236) internal successors, (107), 90 states have internal predecessors, (107), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 10:43:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 227 transitions. [2025-03-08 10:43:49,281 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 227 transitions. Word has length 173 [2025-03-08 10:43:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:43:49,283 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 227 transitions. [2025-03-08 10:43:49,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:43:49,283 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 227 transitions. [2025-03-08 10:43:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-08 10:43:49,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:43:49,286 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:49,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 10:43:49,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:43:49,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:43:49,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:43:49,489 INFO L85 PathProgramCache]: Analyzing trace with hash 373229188, now seen corresponding path program 1 times [2025-03-08 10:43:49,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:43:49,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945452600] [2025-03-08 10:43:49,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:43:49,490 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:43:49,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:43:49,491 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:43:49,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 10:43:49,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-08 10:43:49,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-08 10:43:49,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:43:49,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:43:49,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 10:43:49,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:44:25,356 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:44:37,302 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:44:45,387 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:44:52,028 WARN L286 SmtUtils]: Spent 6.64s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:44:58,812 WARN L286 SmtUtils]: Spent 6.78s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:45:05,238 WARN L286 SmtUtils]: Spent 6.43s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)