./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-80.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 4bb7209f06eb90a60dcbe2d649d5deab37b76f9df595c124e6bf4c05ffd58895 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:59:08,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:59:08,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:59:08,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:59:08,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:59:08,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:59:08,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:59:08,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:59:08,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:59:08,221 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:59:08,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:59:08,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:59:08,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:59:08,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:59:08,222 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:59:08,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:59:08,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:59:08,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:59:08,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:59:08,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:59:08,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:59:08,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:59:08,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:59:08,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:59:08,223 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:59:08,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:59:08,223 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:59:08,223 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:59:08,223 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:59:08,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:59:08,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:59:08,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:59:08,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:59:08,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:59:08,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:59:08,224 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:59:08,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:59:08,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:59:08,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:59:08,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:59:08,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:59:08,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:59:08,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:59:08,225 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 -> 4bb7209f06eb90a60dcbe2d649d5deab37b76f9df595c124e6bf4c05ffd58895 [2025-03-16 23:59:08,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:59:08,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:59:08,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:59:08,445 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:59:08,445 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:59:08,447 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-80.i [2025-03-16 23:59:09,591 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/506fa21ef/205d3d7a417749078c6812766fd228e5/FLAG167348bb3 [2025-03-16 23:59:09,901 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:59:09,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-80.i [2025-03-16 23:59:09,912 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/506fa21ef/205d3d7a417749078c6812766fd228e5/FLAG167348bb3 [2025-03-16 23:59:10,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/506fa21ef/205d3d7a417749078c6812766fd228e5 [2025-03-16 23:59:10,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:59:10,167 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:59:10,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:59:10,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:59:10,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:59:10,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a132d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10, skipping insertion in model container [2025-03-16 23:59:10,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:59:10,269 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-80.i[915,928] [2025-03-16 23:59:10,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:59:10,322 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:59:10,329 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-80.i[915,928] [2025-03-16 23:59:10,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:59:10,372 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:59:10,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10 WrapperNode [2025-03-16 23:59:10,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:59:10,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:59:10,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:59:10,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:59:10,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,419 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-03-16 23:59:10,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:59:10,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:59:10,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:59:10,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:59:10,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,446 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-16 23:59:10,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:59:10,470 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:59:10,471 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:59:10,471 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:59:10,471 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:59:10,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:59:10,500 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-16 23:59:10,506 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-16 23:59:10,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:59:10,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:59:10,520 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:59:10,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:59:10,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:59:10,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:59:10,587 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:59:10,589 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:59:10,835 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 23:59:10,835 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:59:10,853 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:59:10,853 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:59:10,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:59:10 BoogieIcfgContainer [2025-03-16 23:59:10,853 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:59:10,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:59:10,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:59:10,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:59:10,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:59:10" (1/3) ... [2025-03-16 23:59:10,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5296cbe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:59:10, skipping insertion in model container [2025-03-16 23:59:10,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (2/3) ... [2025-03-16 23:59:10,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5296cbe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:59:10, skipping insertion in model container [2025-03-16 23:59:10,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:59:10" (3/3) ... [2025-03-16 23:59:10,860 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-80.i [2025-03-16 23:59:10,870 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:59:10,872 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-80.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:59:10,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:59:10,925 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;@3d778919, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:59:10,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:59:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:59:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 23:59:10,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:10,940 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:10,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:10,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:10,944 INFO L85 PathProgramCache]: Analyzing trace with hash -199533039, now seen corresponding path program 1 times [2025-03-16 23:59:10,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:10,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601980792] [2025-03-16 23:59:10,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:10,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:11,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:59:11,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:59:11,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:11,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-16 23:59:11,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:11,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601980792] [2025-03-16 23:59:11,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601980792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:59:11,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327391772] [2025-03-16 23:59:11,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:11,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:59:11,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:59:11,203 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-16 23:59:11,205 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-16 23:59:11,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:59:11,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:59:11,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:11,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:11,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:59:11,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:59:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-16 23:59:11,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:59:11,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327391772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:11,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:59:11,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:59:11,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830930772] [2025-03-16 23:59:11,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:11,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:59:11,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:11,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:59:11,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:59:11,472 INFO L87 Difference]: Start difference. First operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-16 23:59:11,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:11,497 INFO L93 Difference]: Finished difference Result 151 states and 268 transitions. [2025-03-16 23:59:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:59:11,499 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 185 [2025-03-16 23:59:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:11,504 INFO L225 Difference]: With dead ends: 151 [2025-03-16 23:59:11,504 INFO L226 Difference]: Without dead ends: 75 [2025-03-16 23:59:11,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 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-16 23:59:11,509 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:11,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:59:11,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-16 23:59:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-16 23:59:11,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:59:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 116 transitions. [2025-03-16 23:59:11,552 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 116 transitions. Word has length 185 [2025-03-16 23:59:11,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:11,553 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 116 transitions. [2025-03-16 23:59:11,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-16 23:59:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 116 transitions. [2025-03-16 23:59:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 23:59:11,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:11,557 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:11,564 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-16 23:59:11,758 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-16 23:59:11,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:11,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:11,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1074835859, now seen corresponding path program 1 times [2025-03-16 23:59:11,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:11,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058577366] [2025-03-16 23:59:11,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:11,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:11,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:59:11,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:59:11,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:11,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-16 23:59:12,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:12,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058577366] [2025-03-16 23:59:12,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058577366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:12,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:12,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:59:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329175303] [2025-03-16 23:59:12,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:12,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:59:12,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:12,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:59:12,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:59:12,063 INFO L87 Difference]: Start difference. First operand 75 states and 116 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:59:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:12,129 INFO L93 Difference]: Finished difference Result 223 states and 346 transitions. [2025-03-16 23:59:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:59:12,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 185 [2025-03-16 23:59:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:12,131 INFO L225 Difference]: With dead ends: 223 [2025-03-16 23:59:12,131 INFO L226 Difference]: Without dead ends: 149 [2025-03-16 23:59:12,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:59:12,132 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 112 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:12,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 326 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:59:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-16 23:59:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 77. [2025-03-16 23:59:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:59:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 118 transitions. [2025-03-16 23:59:12,144 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 118 transitions. Word has length 185 [2025-03-16 23:59:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:12,147 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 118 transitions. [2025-03-16 23:59:12,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:59:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2025-03-16 23:59:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 23:59:12,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:12,150 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:12,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:59:12,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:12,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:12,151 INFO L85 PathProgramCache]: Analyzing trace with hash -732618604, now seen corresponding path program 1 times [2025-03-16 23:59:12,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:12,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598681652] [2025-03-16 23:59:12,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:12,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:12,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:59:12,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:59:12,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:12,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-16 23:59:12,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:12,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598681652] [2025-03-16 23:59:12,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598681652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:12,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:12,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:59:12,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435713563] [2025-03-16 23:59:12,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:12,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:59:12,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:12,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:59:12,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:59:12,423 INFO L87 Difference]: Start difference. First operand 77 states and 118 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:59:12,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:12,481 INFO L93 Difference]: Finished difference Result 229 states and 352 transitions. [2025-03-16 23:59:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:59:12,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 185 [2025-03-16 23:59:12,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:12,486 INFO L225 Difference]: With dead ends: 229 [2025-03-16 23:59:12,487 INFO L226 Difference]: Without dead ends: 153 [2025-03-16 23:59:12,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-16 23:59:12,489 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 54 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:12,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 226 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:59:12,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-16 23:59:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2025-03-16 23:59:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 88 states have (on average 1.25) internal successors, (110), 88 states have internal predecessors, (110), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-16 23:59:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 230 transitions. [2025-03-16 23:59:12,515 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 230 transitions. Word has length 185 [2025-03-16 23:59:12,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:12,516 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 230 transitions. [2025-03-16 23:59:12,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:59:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2025-03-16 23:59:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 23:59:12,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:12,519 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:12,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:59:12,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:12,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash -722115500, now seen corresponding path program 1 times [2025-03-16 23:59:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:12,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627679633] [2025-03-16 23:59:12,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:12,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:12,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:59:12,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:59:12,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:12,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-16 23:59:12,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:12,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627679633] [2025-03-16 23:59:12,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627679633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:12,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:12,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:59:12,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141187219] [2025-03-16 23:59:12,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:12,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:59:12,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:12,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:59:12,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:59:12,649 INFO L87 Difference]: Start difference. First operand 151 states and 230 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:59:12,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:12,677 INFO L93 Difference]: Finished difference Result 225 states and 340 transitions. [2025-03-16 23:59:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:59:12,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 185 [2025-03-16 23:59:12,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:12,681 INFO L225 Difference]: With dead ends: 225 [2025-03-16 23:59:12,682 INFO L226 Difference]: Without dead ends: 75 [2025-03-16 23:59:12,682 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-16 23:59:12,683 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:12,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:59:12,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-16 23:59:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-16 23:59:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:59:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 110 transitions. [2025-03-16 23:59:12,697 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 110 transitions. Word has length 185 [2025-03-16 23:59:12,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:12,697 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 110 transitions. [2025-03-16 23:59:12,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:59:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 110 transitions. [2025-03-16 23:59:12,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-16 23:59:12,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:12,699 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:12,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:59:12,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:12,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:12,700 INFO L85 PathProgramCache]: Analyzing trace with hash -220195341, now seen corresponding path program 1 times [2025-03-16 23:59:12,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:12,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863604488] [2025-03-16 23:59:12,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:12,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:12,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 23:59:12,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 23:59:12,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:12,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:59:12,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:59:12,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 23:59:12,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 23:59:12,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:12,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:59:13,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:59:13,002 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:59:13,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:59:13,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:59:13,007 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-16 23:59:13,130 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:59:13,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:59:13 BoogieIcfgContainer [2025-03-16 23:59:13,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:59:13,135 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:59:13,135 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:59:13,135 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:59:13,135 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:59:10" (3/4) ... [2025-03-16 23:59:13,137 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:59:13,137 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:59:13,138 INFO L158 Benchmark]: Toolchain (without parser) took 2970.93ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 121.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:59:13,138 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:59:13,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.02ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 107.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:59:13,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.73ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:59:13,139 INFO L158 Benchmark]: Boogie Preprocessor took 49.64ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 96.9MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:59:13,139 INFO L158 Benchmark]: IcfgBuilder took 383.47ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 72.5MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 23:59:13,139 INFO L158 Benchmark]: TraceAbstraction took 2279.66ms. Allocated memory is still 167.8MB. Free memory was 72.0MB in the beginning and 121.3MB in the end (delta: -49.3MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2025-03-16 23:59:13,140 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 121.3MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:59:13,140 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.63ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.02ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 107.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.73ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.64ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 96.9MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 383.47ms. Allocated memory is still 167.8MB. Free memory was 96.9MB in the beginning and 72.5MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2279.66ms. Allocated memory is still 167.8MB. Free memory was 72.0MB in the beginning and 121.3MB in the end (delta: -49.3MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 121.3MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 146, overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryFLOATComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] float var_1_24 = 9999999999.375; [L43] unsigned short int var_1_25 = 0; [L44] unsigned short int var_1_26 = 10; [L45] float var_1_27 = 128.75; [L46] double var_1_28 = 9.25; [L47] signed short int var_1_29 = -2; [L48] signed short int var_1_30 = 2; [L49] float var_1_31 = 32.25; [L50] unsigned short int var_1_32 = 128; [L51] unsigned short int var_1_33 = 8; [L52] signed char var_1_34 = -64; [L53] signed char var_1_35 = 64; [L54] float var_1_36 = 256.5; [L55] unsigned char last_1_var_1_10 = 200; [L165] isInitial = 1 [L166] FCALL initially() [L167] COND TRUE 1 [L168] CALL updateLastVariables() [L158] last_1_var_1_10 = var_1_10 [L168] RET updateLastVariables() [L169] CALL updateVariables() [L107] var_1_2 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L108] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L109] var_1_3 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L110] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L111] var_1_4 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_5=99/2, var_1_9=-25] [L112] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_5=99/2, var_1_9=-25] [L113] var_1_5 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L114] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L115] var_1_11 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L116] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L117] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L117] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L118] var_1_12 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L119] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L120] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L120] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L121] var_1_13 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L122] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L123] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L123] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L124] var_1_15 = __VERIFIER_nondet_float() [L125] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L125] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L126] var_1_16 = __VERIFIER_nondet_float() [L127] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L127] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L128] var_1_17 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L129] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L130] var_1_20 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L131] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L132] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L132] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L133] var_1_21 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L134] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L135] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L135] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L136] var_1_23 = __VERIFIER_nondet_ulong() [L137] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L137] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L138] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L138] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_25=0, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L139] var_1_25 = __VERIFIER_nondet_ushort() [L140] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L140] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L141] CALL assume_abort_if_not(var_1_25 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L141] RET assume_abort_if_not(var_1_25 <= 65535) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_26=10, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L142] var_1_26 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L143] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L144] CALL assume_abort_if_not(var_1_26 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L144] RET assume_abort_if_not(var_1_26 <= 65535) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_27=515/4, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L145] var_1_27 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L146] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=2, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L147] var_1_30 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_30 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L148] RET assume_abort_if_not(var_1_30 >= -32767) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L149] CALL assume_abort_if_not(var_1_30 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L149] RET assume_abort_if_not(var_1_30 <= 32766) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=8, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L150] var_1_33 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L151] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L152] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L152] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=64, var_1_36=513/2, var_1_9=-25] [L153] var_1_35 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_35 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=-127, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=-127, var_1_36=513/2, var_1_9=-25] [L154] RET assume_abort_if_not(var_1_35 >= -127) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=-127, var_1_36=513/2, var_1_9=-25] [L155] CALL assume_abort_if_not(var_1_35 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=-127, var_1_36=513/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=-127, var_1_36=513/2, var_1_9=-25] [L155] RET assume_abort_if_not(var_1_35 <= 126) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=-127, var_1_36=513/2, var_1_9=-25] [L169] RET updateVariables() [L170] CALL step() [L59] EXPR var_1_25 & var_1_26 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=79999999995/8, var_1_25=0, var_1_26=0, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=-127, var_1_36=513/2, var_1_9=-25] [L59] COND TRUE (var_1_25 & var_1_26) >= -2 [L60] var_1_24 = var_1_27 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=37/4, var_1_29=-2, var_1_30=32766, var_1_31=129/4, var_1_32=128, var_1_33=-2, var_1_34=-64, var_1_35=-127, var_1_36=513/2, var_1_9=-25] [L62] var_1_28 = var_1_27 [L63] var_1_29 = var_1_30 [L64] var_1_31 = var_1_27 [L65] var_1_32 = var_1_33 [L66] var_1_34 = var_1_35 [L67] var_1_36 = var_1_27 [L68] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=32766, var_1_30=32766, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=-127, var_1_35=-127, var_1_36=10000000004, var_1_9=-25] [L69] COND TRUE stepLocal_0 >= last_1_var_1_10 [L70] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=32766, var_1_30=32766, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=-127, var_1_35=-127, var_1_36=10000000004, var_1_9=-56] [L74] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=32766, var_1_30=32766, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=-127, var_1_35=-127, var_1_36=10000000004, var_1_9=-56] [L75] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=32766, var_1_30=32766, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=-127, var_1_35=-127, var_1_36=10000000004, var_1_9=-56] [L78] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=32766, var_1_30=32766, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=-127, var_1_35=-127, var_1_36=10000000004, var_1_9=-56] [L81] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L82] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=32766, var_1_30=32766, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=-127, var_1_35=-127, var_1_36=10000000004, var_1_9=-56] [L85] COND FALSE !(((var_1_2 - var_1_3) * var_1_4) < var_1_5) [L88] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=32766, var_1_30=32766, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=-127, var_1_35=-127, var_1_36=10000000004, var_1_9=-56] [L90] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=32766, var_1_30=32766, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=-127, var_1_35=-127, var_1_36=10000000004, var_1_9=-56] [L93] COND FALSE !(\read(var_1_19)) [L96] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=32766, var_1_30=32766, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=-127, var_1_35=-127, var_1_36=10000000004, var_1_9=-56] [L98] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=32766, var_1_30=32766, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=-127, var_1_35=-127, var_1_36=10000000004, var_1_9=-56] [L99] COND TRUE ((var_1_15 - var_1_16) - var_1_17) <= var_1_13 [L100] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=32766, var_1_30=32766, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=-127, var_1_35=-127, var_1_36=10000000004, var_1_9=-56] [L170] RET step() [L171] CALL, EXPR property() [L161-L162] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; [L171] RET, EXPR property() [L171] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=32766, var_1_30=32766, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=-127, var_1_35=-127, var_1_36=10000000004, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-4294967298, var_1_24=10000000004, var_1_25=0, var_1_26=0, var_1_27=10000000004, var_1_28=10000000004, var_1_29=32766, var_1_30=32766, var_1_31=10000000004, var_1_32=-2, var_1_33=-2, var_1_34=-127, var_1_35=-127, var_1_36=10000000004, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 150 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 5, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 878 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 423 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 455 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=3, InterpolantAutomatonStates: 12, 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, 74 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1112 NumberOfCodeBlocks, 1112 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 920 ConstructedInterpolants, 0 QuantifiedInterpolants, 1502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 439 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 8642/8700 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-16 23:59:13,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-80.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 4bb7209f06eb90a60dcbe2d649d5deab37b76f9df595c124e6bf4c05ffd58895 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:59:15,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:59:15,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:59:15,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:59:15,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:59:15,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:59:15,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:59:15,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:59:15,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:59:15,241 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:59:15,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:59:15,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:59:15,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:59:15,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:59:15,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:59:15,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:59:15,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:59:15,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:59:15,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:59:15,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:59:15,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:59:15,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:59:15,243 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:59:15,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:59:15,243 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:59:15,243 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:59:15,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:59:15,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:59:15,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:59:15,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:59:15,243 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4bb7209f06eb90a60dcbe2d649d5deab37b76f9df595c124e6bf4c05ffd58895 [2025-03-16 23:59:15,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:59:15,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:59:15,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:59:15,495 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:59:15,495 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:59:15,497 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-80.i [2025-03-16 23:59:16,692 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f2e8ba3/3d378ac118b4437da3206cffe6d81b24/FLAGa9a1cfba1 [2025-03-16 23:59:16,906 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:59:16,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-80.i [2025-03-16 23:59:16,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f2e8ba3/3d378ac118b4437da3206cffe6d81b24/FLAGa9a1cfba1 [2025-03-16 23:59:16,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6f2e8ba3/3d378ac118b4437da3206cffe6d81b24 [2025-03-16 23:59:16,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:59:16,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:59:16,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:59:16,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:59:16,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:59:16,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:59:16" (1/1) ... [2025-03-16 23:59:16,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63209d77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:16, skipping insertion in model container [2025-03-16 23:59:16,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:59:16" (1/1) ... [2025-03-16 23:59:16,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:59:17,074 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-80.i[915,928] [2025-03-16 23:59:17,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:59:17,157 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:59:17,166 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-80.i[915,928] [2025-03-16 23:59:17,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:59:17,214 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:59:17,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17 WrapperNode [2025-03-16 23:59:17,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:59:17,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:59:17,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:59:17,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:59:17,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17" (1/1) ... [2025-03-16 23:59:17,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17" (1/1) ... [2025-03-16 23:59:17,262 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2025-03-16 23:59:17,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:59:17,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:59:17,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:59:17,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:59:17,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17" (1/1) ... [2025-03-16 23:59:17,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17" (1/1) ... [2025-03-16 23:59:17,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17" (1/1) ... [2025-03-16 23:59:17,301 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-16 23:59:17,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17" (1/1) ... [2025-03-16 23:59:17,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17" (1/1) ... [2025-03-16 23:59:17,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17" (1/1) ... [2025-03-16 23:59:17,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17" (1/1) ... [2025-03-16 23:59:17,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17" (1/1) ... [2025-03-16 23:59:17,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17" (1/1) ... [2025-03-16 23:59:17,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:59:17,335 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:59:17,335 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:59:17,335 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:59:17,336 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17" (1/1) ... [2025-03-16 23:59:17,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:59:17,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:59:17,362 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-16 23:59:17,366 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-16 23:59:17,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:59:17,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:59:17,387 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:59:17,387 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:59:17,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:59:17,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:59:17,448 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:59:17,449 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:59:40,981 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-16 23:59:40,981 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:59:40,990 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:59:40,990 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:59:40,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:59:40 BoogieIcfgContainer [2025-03-16 23:59:40,992 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:59:40,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:59:40,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:59:40,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:59:40,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:59:16" (1/3) ... [2025-03-16 23:59:40,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd45440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:59:40, skipping insertion in model container [2025-03-16 23:59:40,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:17" (2/3) ... [2025-03-16 23:59:40,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd45440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:59:40, skipping insertion in model container [2025-03-16 23:59:40,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:59:40" (3/3) ... [2025-03-16 23:59:41,000 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-80.i [2025-03-16 23:59:41,009 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:59:41,010 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-80.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:59:41,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:59:41,059 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;@41423e07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:59:41,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:59:41,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:59:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-16 23:59:41,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:41,072 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:41,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:41,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:41,076 INFO L85 PathProgramCache]: Analyzing trace with hash -37811082, now seen corresponding path program 1 times [2025-03-16 23:59:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:59:41,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154631716] [2025-03-16 23:59:41,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:41,084 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-16 23:59:41,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:59:41,086 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-16 23:59:41,088 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-16 23:59:41,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-16 23:59:42,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-16 23:59:42,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:42,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:42,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:59:42,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:59:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 778 proven. 0 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2025-03-16 23:59:42,161 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:59:42,162 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:59:42,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154631716] [2025-03-16 23:59:42,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154631716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:42,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:42,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:59:42,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196137267] [2025-03-16 23:59:42,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:42,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:59:42,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:59:42,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:59:42,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:59:42,184 INFO L87 Difference]: Start difference. First operand has 74 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-16 23:59:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:42,208 INFO L93 Difference]: Finished difference Result 145 states and 258 transitions. [2025-03-16 23:59:42,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:59:42,209 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 184 [2025-03-16 23:59:42,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:42,222 INFO L225 Difference]: With dead ends: 145 [2025-03-16 23:59:42,222 INFO L226 Difference]: Without dead ends: 72 [2025-03-16 23:59:42,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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-16 23:59:42,229 INFO L435 NwaCegarLoop]: 110 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, 110 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-16 23:59:42,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:59:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-16 23:59:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-16 23:59:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:59:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2025-03-16 23:59:42,261 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 184 [2025-03-16 23:59:42,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:42,262 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2025-03-16 23:59:42,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-16 23:59:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2025-03-16 23:59:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-16 23:59:42,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:42,265 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:42,292 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-16 23:59:42,469 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-16 23:59:42,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:42,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:42,470 INFO L85 PathProgramCache]: Analyzing trace with hash -135249740, now seen corresponding path program 1 times [2025-03-16 23:59:42,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:59:42,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756542829] [2025-03-16 23:59:42,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:42,471 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-16 23:59:42,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:59:42,473 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-16 23:59:42,476 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-16 23:59:42,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-16 23:59:43,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-16 23:59:43,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:43,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:43,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 23:59:43,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:59:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-16 23:59:43,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:59:43,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:59:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756542829] [2025-03-16 23:59:43,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756542829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:43,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:43,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:59:43,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703894107] [2025-03-16 23:59:43,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:43,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:59:43,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:59:43,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:59:43,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:59:43,710 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:59:48,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 23:59:52,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 23:59:56,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:00:00,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 00:00:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:00,363 INFO L93 Difference]: Finished difference Result 214 states and 328 transitions. [2025-03-17 00:00:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:00:00,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2025-03-17 00:00:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:00,477 INFO L225 Difference]: With dead ends: 214 [2025-03-17 00:00:00,477 INFO L226 Difference]: Without dead ends: 143 [2025-03-17 00:00:00,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:00:00,478 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 106 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:00,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 312 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 4 Unknown, 0 Unchecked, 16.5s Time] [2025-03-17 00:00:00,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-17 00:00:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 74. [2025-03-17 00:00:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 00:00:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2025-03-17 00:00:00,500 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 184 [2025-03-17 00:00:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:00,502 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2025-03-17 00:00:00,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 00:00:00,503 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2025-03-17 00:00:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 00:00:00,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:00,505 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:00:00,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 00:00:00,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:00:00,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:00,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:00,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1942704203, now seen corresponding path program 1 times [2025-03-17 00:00:00,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:00:00,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106912921] [2025-03-17 00:00:00,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:00,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:00:00,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:00:00,708 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:00:00,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 00:00:00,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 00:00:01,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 00:00:01,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:01,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:01,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 00:00:01,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:00:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-17 00:00:07,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:00:07,465 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:00:07,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106912921] [2025-03-17 00:00:07,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106912921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:07,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:07,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 00:00:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296224930] [2025-03-17 00:00:07,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:07,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:00:07,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:00:07,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:00:07,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:00:07,466 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 00:00:12,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:00:16,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:00:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:00:16,042 INFO L93 Difference]: Finished difference Result 218 states and 330 transitions. [2025-03-17 00:00:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:00:16,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2025-03-17 00:00:16,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:00:16,178 INFO L225 Difference]: With dead ends: 218 [2025-03-17 00:00:16,178 INFO L226 Difference]: Without dead ends: 145 [2025-03-17 00:00:16,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:00:16,180 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 13 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:00:16,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 210 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-03-17 00:00:16,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-17 00:00:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2025-03-17 00:00:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 80 states have (on average 1.175) internal successors, (94), 80 states have internal predecessors, (94), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 00:00:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2025-03-17 00:00:16,213 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 184 [2025-03-17 00:00:16,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:00:16,214 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2025-03-17 00:00:16,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 00:00:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2025-03-17 00:00:16,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 00:00:16,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:00:16,216 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:00:16,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 00:00:16,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:00:16,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:00:16,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:00:16,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1932201099, now seen corresponding path program 1 times [2025-03-17 00:00:16,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 00:00:16,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358304571] [2025-03-17 00:00:16,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:00:16,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 00:00:16,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 00:00:16,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 00:00:16,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 (5)] Waiting until timeout for monitored process [2025-03-17 00:00:16,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 00:00:17,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 00:00:17,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:00:17,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:00:17,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 00:00:17,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:00:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-17 00:00:23,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:00:23,566 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 00:00:23,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358304571] [2025-03-17 00:00:23,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358304571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:00:23,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:00:23,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:00:23,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117088352] [2025-03-17 00:00:23,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:00:23,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:00:23,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 00:00:23,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:00:23,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:00:23,570 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-17 00:00:29,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:00:33,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:00:37,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:00:41,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:00:45,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:00:50,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 00:00:51,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []