./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-0.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 7061d7705e35ffb179f69b4cdd3a111dfb45a568e3f5347cc63566e16555668c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:12:30,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:12:30,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:12:30,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:12:30,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:12:30,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:12:30,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:12:30,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:12:30,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:12:30,104 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:12:30,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:12:30,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:12:30,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:12:30,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:12:30,106 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:12:30,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:12:30,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:12:30,106 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:12:30,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:12:30,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:12:30,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:12:30,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:12:30,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:12:30,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:12:30,107 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:12:30,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:12:30,107 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:12:30,107 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:12:30,107 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:12:30,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:12:30,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:12:30,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:12:30,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:12:30,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:12:30,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:12:30,108 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:12:30,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:12:30,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:12:30,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:12:30,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:12:30,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:12:30,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:12:30,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:12:30,108 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 -> 7061d7705e35ffb179f69b4cdd3a111dfb45a568e3f5347cc63566e16555668c [2025-03-17 03:12:30,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:12:30,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:12:30,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:12:30,373 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:12:30,374 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:12:30,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-0.i [2025-03-17 03:12:31,593 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe431c5bc/d10bd9ac92b0413bb86a579b8c99b301/FLAGe777f7460 [2025-03-17 03:12:31,852 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:12:31,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-0.i [2025-03-17 03:12:31,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe431c5bc/d10bd9ac92b0413bb86a579b8c99b301/FLAGe777f7460 [2025-03-17 03:12:31,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe431c5bc/d10bd9ac92b0413bb86a579b8c99b301 [2025-03-17 03:12:31,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:12:31,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:12:31,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:12:31,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:12:31,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:12:31,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:12:31" (1/1) ... [2025-03-17 03:12:31,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a328d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:31, skipping insertion in model container [2025-03-17 03:12:31,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:12:31" (1/1) ... [2025-03-17 03:12:31,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:12:32,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-0.i[915,928] [2025-03-17 03:12:32,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:12:32,122 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:12:32,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-0.i[915,928] [2025-03-17 03:12:32,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:12:32,198 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:12:32,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32 WrapperNode [2025-03-17 03:12:32,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:12:32,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:12:32,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:12:32,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:12:32,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32" (1/1) ... [2025-03-17 03:12:32,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32" (1/1) ... [2025-03-17 03:12:32,286 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2025-03-17 03:12:32,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:12:32,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:12:32,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:12:32,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:12:32,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32" (1/1) ... [2025-03-17 03:12:32,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32" (1/1) ... [2025-03-17 03:12:32,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32" (1/1) ... [2025-03-17 03:12:32,335 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:12:32,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32" (1/1) ... [2025-03-17 03:12:32,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32" (1/1) ... [2025-03-17 03:12:32,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32" (1/1) ... [2025-03-17 03:12:32,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32" (1/1) ... [2025-03-17 03:12:32,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32" (1/1) ... [2025-03-17 03:12:32,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32" (1/1) ... [2025-03-17 03:12:32,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:12:32,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:12:32,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:12:32,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:12:32,382 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32" (1/1) ... [2025-03-17 03:12:32,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:12:32,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:12:32,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:12:32,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:12:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:12:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:12:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:12:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:12:32,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:12:32,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:12:32,509 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:12:32,511 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:12:32,990 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L169: havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short22#1;havoc property_#t~ite25#1;havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short26#1; [2025-03-17 03:12:33,023 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-17 03:12:33,024 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:12:33,043 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:12:33,043 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:12:33,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:12:33 BoogieIcfgContainer [2025-03-17 03:12:33,044 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:12:33,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:12:33,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:12:33,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:12:33,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:12:31" (1/3) ... [2025-03-17 03:12:33,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca7917a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:12:33, skipping insertion in model container [2025-03-17 03:12:33,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:32" (2/3) ... [2025-03-17 03:12:33,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca7917a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:12:33, skipping insertion in model container [2025-03-17 03:12:33,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:12:33" (3/3) ... [2025-03-17 03:12:33,053 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-0.i [2025-03-17 03:12:33,064 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:12:33,066 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-0.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:12:33,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:12:33,115 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;@4891e312, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:12:33,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:12:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 03:12:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 03:12:33,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:12:33,132 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:12:33,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:12:33,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:12:33,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1509116765, now seen corresponding path program 1 times [2025-03-17 03:12:33,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:12:33,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624729436] [2025-03-17 03:12:33,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:12:33,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:12:33,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 03:12:33,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 03:12:33,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:12:33,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:12:33,422 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-17 03:12:33,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:12:33,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624729436] [2025-03-17 03:12:33,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624729436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:12:33,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606937048] [2025-03-17 03:12:33,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:12:33,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:12:33,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:12:33,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:12:33,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:12:33,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 03:12:33,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 03:12:33,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:12:33,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:12:33,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:12:33,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:12:33,586 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-17 03:12:33,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:12:33,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606937048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:12:33,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:12:33,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:12:33,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093038795] [2025-03-17 03:12:33,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:12:33,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:12:33,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:12:33,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:12:33,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:12:33,611 INFO L87 Difference]: Start difference. First operand has 98 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 03:12:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:12:33,638 INFO L93 Difference]: Finished difference Result 183 states and 309 transitions. [2025-03-17 03:12:33,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:12:33,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2025-03-17 03:12:33,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:12:33,647 INFO L225 Difference]: With dead ends: 183 [2025-03-17 03:12:33,647 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 03:12:33,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:12:33,653 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:12:33,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:12:33,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 03:12:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-17 03:12:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 03:12:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 130 transitions. [2025-03-17 03:12:33,689 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 130 transitions. Word has length 149 [2025-03-17 03:12:33,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:12:33,689 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 130 transitions. [2025-03-17 03:12:33,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 03:12:33,689 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 130 transitions. [2025-03-17 03:12:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 03:12:33,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:12:33,692 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:12:33,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:12:33,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:12:33,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:12:33,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:12:33,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1436170911, now seen corresponding path program 1 times [2025-03-17 03:12:33,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:12:33,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803535591] [2025-03-17 03:12:33,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:12:33,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:12:33,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 03:12:34,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 03:12:34,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:12:34,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:12:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-17 03:12:34,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:12:34,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803535591] [2025-03-17 03:12:34,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803535591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:12:34,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:12:34,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:12:34,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274476512] [2025-03-17 03:12:34,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:12:34,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:12:34,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:12:34,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:12:34,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:12:34,723 INFO L87 Difference]: Start difference. First operand 86 states and 130 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 03:12:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:12:35,070 INFO L93 Difference]: Finished difference Result 251 states and 376 transitions. [2025-03-17 03:12:35,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:12:35,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-03-17 03:12:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:12:35,072 INFO L225 Difference]: With dead ends: 251 [2025-03-17 03:12:35,073 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 03:12:35,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:12:35,074 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 275 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 03:12:35,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 310 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 03:12:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 03:12:35,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 120. [2025-03-17 03:12:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 95 states have internal predecessors, (132), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 03:12:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-03-17 03:12:35,099 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 149 [2025-03-17 03:12:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:12:35,099 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-03-17 03:12:35,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-17 03:12:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-03-17 03:12:35,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 03:12:35,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:12:35,101 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:12:35,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:12:35,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:12:35,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:12:35,101 INFO L85 PathProgramCache]: Analyzing trace with hash -925636734, now seen corresponding path program 1 times [2025-03-17 03:12:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:12:35,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769266406] [2025-03-17 03:12:35,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:12:35,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:12:35,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 03:12:35,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 03:12:35,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:12:35,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:12:35,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141877690] [2025-03-17 03:12:35,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:12:35,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:12:35,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:12:35,263 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:12:35,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:12:35,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 03:12:35,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 03:12:35,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:12:35,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:12:35,535 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:12:35,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 03:12:35,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 03:12:35,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:12:35,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:12:35,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:12:35,696 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:12:35,696 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:12:35,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 03:12:35,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 03:12:35,900 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 03:12:35,979 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:12:35,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:12:35 BoogieIcfgContainer [2025-03-17 03:12:35,983 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:12:35,984 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:12:35,984 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:12:35,984 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:12:35,985 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:12:33" (3/4) ... [2025-03-17 03:12:35,986 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:12:35,987 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:12:35,988 INFO L158 Benchmark]: Toolchain (without parser) took 4098.96ms. Allocated memory is still 201.3MB. Free memory was 158.4MB in the beginning and 69.1MB in the end (delta: 89.3MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2025-03-17 03:12:35,988 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:12:35,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.93ms. Allocated memory is still 201.3MB. Free memory was 158.4MB in the beginning and 141.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:12:35,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.51ms. Allocated memory is still 201.3MB. Free memory was 141.3MB in the beginning and 133.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:12:35,989 INFO L158 Benchmark]: Boogie Preprocessor took 92.28ms. Allocated memory is still 201.3MB. Free memory was 133.2MB in the beginning and 122.5MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:12:35,990 INFO L158 Benchmark]: IcfgBuilder took 662.89ms. Allocated memory is still 201.3MB. Free memory was 122.1MB in the beginning and 78.2MB in the end (delta: 43.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 03:12:35,990 INFO L158 Benchmark]: TraceAbstraction took 2936.41ms. Allocated memory is still 201.3MB. Free memory was 77.7MB in the beginning and 69.2MB in the end (delta: 8.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2025-03-17 03:12:35,990 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 201.3MB. Free memory was 69.2MB in the beginning and 69.1MB in the end (delta: 55.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:12:35,991 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.93ms. Allocated memory is still 201.3MB. Free memory was 158.4MB in the beginning and 141.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.51ms. Allocated memory is still 201.3MB. Free memory was 141.3MB in the beginning and 133.2MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.28ms. Allocated memory is still 201.3MB. Free memory was 133.2MB in the beginning and 122.5MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 662.89ms. Allocated memory is still 201.3MB. Free memory was 122.1MB in the beginning and 78.2MB in the end (delta: 43.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2936.41ms. Allocated memory is still 201.3MB. Free memory was 77.7MB in the beginning and 69.2MB in the end (delta: 8.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 201.3MB. Free memory was 69.2MB in the beginning and 69.1MB in the end (delta: 55.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 142, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someUnaryDOUBLEoperation at line 34, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryArithmeticFLOAToperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_2 = 99999999999.3; [L24] double var_1_3 = 1.7; [L25] signed long int var_1_6 = 2; [L26] signed long int var_1_8 = 1427256974; [L27] signed short int var_1_11 = 0; [L28] signed long int var_1_14 = 256; [L29] unsigned short int var_1_15 = 2; [L30] signed short int var_1_19 = 32; [L31] double var_1_23 = 4.7; [L32] double var_1_24 = 0.0; [L33] double var_1_25 = 128.25; [L34] float var_1_26 = -0.2; [L35] float var_1_27 = 31.25; [L36] float var_1_28 = 24.4; [L37] unsigned char var_1_29 = 1; [L38] unsigned char var_1_30 = 236; [L39] unsigned char var_1_31 = 5; [L40] unsigned char var_1_32 = 1; [L41] unsigned char var_1_33 = 64; [L42] unsigned char var_1_34 = 100; [L43] unsigned char var_1_35 = 5; [L44] double var_1_36 = 7.5; [L45] signed short int var_1_37 = 16; [L46] unsigned char var_1_38 = 64; [L47] signed char var_1_39 = -1; [L48] unsigned char var_1_40 = 0; [L49] unsigned char var_1_41 = 0; [L50] unsigned short int last_1_var_1_15 = 2; [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L166] last_1_var_1_15 = var_1_15 [L176] RET updateLastVariables() [L177] CALL updateVariables() [L128] var_1_2 = __VERIFIER_nondet_double() [L129] 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_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L129] 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_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_3=17/10, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L130] var_1_3 = __VERIFIER_nondet_double() [L131] 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_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L131] 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_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1427256974] [L132] var_1_8 = __VERIFIER_nondet_long() [L133] CALL assume_abort_if_not(var_1_8 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L133] RET assume_abort_if_not(var_1_8 >= 1073741823) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L134] CALL assume_abort_if_not(var_1_8 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L134] RET assume_abort_if_not(var_1_8 <= 2147483646) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_24=0, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L135] var_1_24 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_24 >= 4611686.018427382800e+12F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L136] RET assume_abort_if_not((var_1_24 >= 4611686.018427382800e+12F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_25=513/4, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L137] var_1_25 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_25 >= 0.0F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L138] RET assume_abort_if_not((var_1_25 >= 0.0F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_27=125/4, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L139] var_1_27 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 2305843.009213691390e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L140] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 2305843.009213691390e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_28=122/5, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L141] var_1_28 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L142] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=236, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L143] var_1_30 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_30 >= 222) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L144] RET assume_abort_if_not(var_1_30 >= 222) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L145] CALL assume_abort_if_not(var_1_30 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L145] RET assume_abort_if_not(var_1_30 <= 254) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=5, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L146] var_1_31 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L147] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L148] CALL assume_abort_if_not(var_1_31 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L148] RET assume_abort_if_not(var_1_31 <= 32) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=1, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L149] var_1_32 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L150] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L151] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L151] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=64, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L152] var_1_33 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_33 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L153] RET assume_abort_if_not(var_1_33 >= 63) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L154] CALL assume_abort_if_not(var_1_33 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L154] RET assume_abort_if_not(var_1_33 <= 127) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=100, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L155] var_1_34 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_34 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L156] RET assume_abort_if_not(var_1_34 >= 63) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L157] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L157] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=5, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L158] var_1_35 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L159] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L160] CALL assume_abort_if_not(var_1_35 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L160] RET assume_abort_if_not(var_1_35 <= 63) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=0, var_1_6=2, var_1_8=1073741823] [L161] var_1_41 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_41 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L162] RET assume_abort_if_not(var_1_41 >= 1) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L163] CALL assume_abort_if_not(var_1_41 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L163] RET assume_abort_if_not(var_1_41 <= 1) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=64, var_1_39=-1, var_1_40=0, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L177] RET updateVariables() [L178] CALL step() [L54] var_1_38 = var_1_31 [L55] var_1_39 = var_1_31 [L56] var_1_40 = var_1_41 [L57] unsigned char stepLocal_4 = var_1_40; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_4=1, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=1, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L58] COND TRUE stepLocal_4 && var_1_40 [L59] var_1_29 = (((var_1_30 - var_1_31) - var_1_32) - (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))))) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_36=15/2, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L61] COND TRUE \read(var_1_40) [L62] var_1_36 = (var_1_28 + var_1_27) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L66] signed long int stepLocal_1 = ~ var_1_29; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_1=-157, var_1_11=0, var_1_14=256, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L67] COND TRUE stepLocal_1 < var_1_8 [L68] var_1_14 = ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=156, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L70] unsigned char stepLocal_2 = var_1_29; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_2=156, var_1_11=0, var_1_14=156, var_1_15=2, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L71] COND FALSE !((last_1_var_1_15 + var_1_39) > stepLocal_2) [L76] var_1_15 = (var_1_38 + var_1_38) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=156, var_1_15=6, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L78] unsigned char stepLocal_3 = var_1_40; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_3=1, var_1_11=0, var_1_14=156, var_1_15=6, var_1_19=32, var_1_1=64, var_1_23=47/10, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L79] COND TRUE var_1_40 && stepLocal_3 [L80] var_1_19 = (var_1_29 + var_1_29) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=156, var_1_15=6, var_1_19=312, var_1_1=64, var_1_23=47/10, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L82] COND TRUE ((((var_1_19) < (var_1_38)) ? (var_1_19) : (var_1_38))) > (var_1_38 - ((((var_1_15) > (5)) ? (var_1_15) : (5)))) [L83] var_1_23 = (10.65 - (var_1_24 - var_1_25)) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=156, var_1_15=6, var_1_19=312, var_1_1=64, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L85] COND FALSE !(var_1_38 > var_1_38) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=156, var_1_15=6, var_1_19=312, var_1_1=64, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L90] COND FALSE !((var_1_2 - var_1_3) == (- var_1_26)) [L97] var_1_1 = var_1_29 VAL [isInitial=1, last_1_var_1_15=2, var_1_11=0, var_1_14=156, var_1_15=6, var_1_19=312, var_1_1=156, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=2, var_1_8=1073741823] [L99] var_1_6 = (var_1_15 - (((((var_1_8 - var_1_15)) < (var_1_38)) ? ((var_1_8 - var_1_15)) : (var_1_38)))) [L100] signed long int stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_0=1073741823, var_1_11=0, var_1_14=156, var_1_15=6, var_1_19=312, var_1_1=156, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, var_1_8=1073741823] [L101] COND TRUE \read(var_1_40) [L102] var_1_11 = var_1_39 VAL [isInitial=1, last_1_var_1_15=2, stepLocal_0=1073741823, var_1_11=3, var_1_14=156, var_1_15=6, var_1_19=312, var_1_1=156, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, var_1_8=1073741823] [L108] unsigned char stepLocal_7 = var_1_40; [L109] signed char stepLocal_6 = var_1_39; [L110] unsigned char stepLocal_5 = var_1_29; VAL [isInitial=1, last_1_var_1_15=2, stepLocal_0=1073741823, stepLocal_5=156, stepLocal_6=3, stepLocal_7=1, var_1_11=3, var_1_14=156, var_1_15=6, var_1_19=312, var_1_1=156, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=16, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, var_1_8=1073741823] [L111] COND FALSE !(((var_1_35 / var_1_34) % var_1_30) >= stepLocal_5) [L124] var_1_37 = var_1_32 VAL [isInitial=1, last_1_var_1_15=2, stepLocal_0=1073741823, stepLocal_6=3, stepLocal_7=1, var_1_11=3, var_1_14=156, var_1_15=6, var_1_19=312, var_1_1=156, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=63, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, var_1_8=1073741823] [L178] RET step() [L179] CALL, EXPR property() [L169] EXPR (((((((((var_1_2 - var_1_3) == (- var_1_26)) ? ((var_1_3 <= ((var_1_26 * 1.5) + 127.4)) ? (var_1_1 == ((signed short int) var_1_29)) : (var_1_1 == ((signed short int) var_1_29))) : (var_1_1 == ((signed short int) var_1_29))) && (var_1_6 == ((signed long int) (var_1_15 - (((((var_1_8 - var_1_15)) < (var_1_38)) ? ((var_1_8 - var_1_15)) : (var_1_38))))))) && (var_1_40 ? (var_1_11 == ((signed short int) var_1_39)) : ((var_1_8 <= ((((var_1_1) > (var_1_39)) ? (var_1_1) : (var_1_39)))) ? (var_1_11 == ((signed short int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1))) && (((~ var_1_29) < var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1)) && (((last_1_var_1_15 + var_1_39) > var_1_29) ? (var_1_40 ? (var_1_15 == ((unsigned short int) (((((var_1_38) < (var_1_38)) ? (var_1_38) : (var_1_38))) + var_1_29))) : 1) : (var_1_15 == ((unsigned short int) (var_1_38 + var_1_38))))) && ((var_1_40 && var_1_40) ? (var_1_19 == ((signed short int) (var_1_29 + var_1_29))) : 1)) && ((((((var_1_19) < (var_1_38)) ? (var_1_19) : (var_1_38))) > (var_1_38 - ((((var_1_15) > (5)) ? (var_1_15) : (5))))) ? (var_1_23 == ((double) (10.65 - (var_1_24 - var_1_25)))) : 1)) && ((var_1_38 > var_1_38) ? (((var_1_38 ^ var_1_29) < var_1_8) ? (var_1_26 == ((float) (((128.05f - var_1_27) + ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) + var_1_25))) : 1) : 1) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=3, var_1_14=156, var_1_15=6, var_1_19=312, var_1_1=156, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=63, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, var_1_8=1073741823] [L169] EXPR ((((((((((((var_1_2 - var_1_3) == (- var_1_26)) ? ((var_1_3 <= ((var_1_26 * 1.5) + 127.4)) ? (var_1_1 == ((signed short int) var_1_29)) : (var_1_1 == ((signed short int) var_1_29))) : (var_1_1 == ((signed short int) var_1_29))) && (var_1_6 == ((signed long int) (var_1_15 - (((((var_1_8 - var_1_15)) < (var_1_38)) ? ((var_1_8 - var_1_15)) : (var_1_38))))))) && (var_1_40 ? (var_1_11 == ((signed short int) var_1_39)) : ((var_1_8 <= ((((var_1_1) > (var_1_39)) ? (var_1_1) : (var_1_39)))) ? (var_1_11 == ((signed short int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1))) && (((~ var_1_29) < var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1)) && (((last_1_var_1_15 + var_1_39) > var_1_29) ? (var_1_40 ? (var_1_15 == ((unsigned short int) (((((var_1_38) < (var_1_38)) ? (var_1_38) : (var_1_38))) + var_1_29))) : 1) : (var_1_15 == ((unsigned short int) (var_1_38 + var_1_38))))) && ((var_1_40 && var_1_40) ? (var_1_19 == ((signed short int) (var_1_29 + var_1_29))) : 1)) && ((((((var_1_19) < (var_1_38)) ? (var_1_19) : (var_1_38))) > (var_1_38 - ((((var_1_15) > (5)) ? (var_1_15) : (5))))) ? (var_1_23 == ((double) (10.65 - (var_1_24 - var_1_25)))) : 1)) && ((var_1_38 > var_1_38) ? (((var_1_38 ^ var_1_29) < var_1_8) ? (var_1_26 == ((float) (((128.05f - var_1_27) + ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) + var_1_25))) : 1) : 1)) && ((var_1_40 && var_1_40) ? (var_1_29 == ((unsigned char) (((var_1_30 - var_1_31) - var_1_32) - (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))))))) : 1)) && (var_1_40 ? (var_1_36 == ((double) (var_1_28 + var_1_27))) : (var_1_36 == ((double) ((var_1_27 + var_1_28) + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))))) && ((((var_1_35 / var_1_34) % var_1_30) >= var_1_29) ? ((var_1_40 || var_1_40) ? (((var_1_39 * (var_1_38 & 64)) < var_1_39) ? (((var_1_27 - var_1_24) <= var_1_3) ? (var_1_37 == ((signed short int) (var_1_33 - var_1_11))) : (var_1_37 == ((signed short int) ((((var_1_32) < ((((((var_1_33) < (var_1_35)) ? (var_1_33) : (var_1_35))) + var_1_39))) ? (var_1_32) : ((((((var_1_33) < (var_1_35)) ? (var_1_33) : (var_1_35))) + var_1_39))))))) : (var_1_37 == ((signed short int) ((((((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) < (var_1_11)) ? (((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) : (var_1_11)))))) : 1) : (var_1_37 == ((signed short int) var_1_32))) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=3, var_1_14=156, var_1_15=6, var_1_19=312, var_1_1=156, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=63, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, var_1_8=1073741823] [L169-L170] return (((((((((((((((var_1_2 - var_1_3) == (- var_1_26)) ? ((var_1_3 <= ((var_1_26 * 1.5) + 127.4)) ? (var_1_1 == ((signed short int) var_1_29)) : (var_1_1 == ((signed short int) var_1_29))) : (var_1_1 == ((signed short int) var_1_29))) && (var_1_6 == ((signed long int) (var_1_15 - (((((var_1_8 - var_1_15)) < (var_1_38)) ? ((var_1_8 - var_1_15)) : (var_1_38))))))) && (var_1_40 ? (var_1_11 == ((signed short int) var_1_39)) : ((var_1_8 <= ((((var_1_1) > (var_1_39)) ? (var_1_1) : (var_1_39)))) ? (var_1_11 == ((signed short int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1))) && (((~ var_1_29) < var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_39) > (var_1_29)) ? (var_1_39) : (var_1_29))))) : 1)) && (((last_1_var_1_15 + var_1_39) > var_1_29) ? (var_1_40 ? (var_1_15 == ((unsigned short int) (((((var_1_38) < (var_1_38)) ? (var_1_38) : (var_1_38))) + var_1_29))) : 1) : (var_1_15 == ((unsigned short int) (var_1_38 + var_1_38))))) && ((var_1_40 && var_1_40) ? (var_1_19 == ((signed short int) (var_1_29 + var_1_29))) : 1)) && ((((((var_1_19) < (var_1_38)) ? (var_1_19) : (var_1_38))) > (var_1_38 - ((((var_1_15) > (5)) ? (var_1_15) : (5))))) ? (var_1_23 == ((double) (10.65 - (var_1_24 - var_1_25)))) : 1)) && ((var_1_38 > var_1_38) ? (((var_1_38 ^ var_1_29) < var_1_8) ? (var_1_26 == ((float) (((128.05f - var_1_27) + ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))) + var_1_25))) : 1) : 1)) && ((var_1_40 && var_1_40) ? (var_1_29 == ((unsigned char) (((var_1_30 - var_1_31) - var_1_32) - (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))))))) : 1)) && (var_1_40 ? (var_1_36 == ((double) (var_1_28 + var_1_27))) : (var_1_36 == ((double) ((var_1_27 + var_1_28) + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))))) && ((((var_1_35 / var_1_34) % var_1_30) >= var_1_29) ? ((var_1_40 || var_1_40) ? (((var_1_39 * (var_1_38 & 64)) < var_1_39) ? (((var_1_27 - var_1_24) <= var_1_3) ? (var_1_37 == ((signed short int) (var_1_33 - var_1_11))) : (var_1_37 == ((signed short int) ((((var_1_32) < ((((((var_1_33) < (var_1_35)) ? (var_1_33) : (var_1_35))) + var_1_39))) ? (var_1_32) : ((((((var_1_33) < (var_1_35)) ? (var_1_33) : (var_1_35))) + var_1_39))))))) : (var_1_37 == ((signed short int) ((((((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) < (var_1_11)) ? (((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) : (var_1_11)))))) : 1) : (var_1_37 == ((signed short int) var_1_32)))) && (var_1_38 == ((unsigned char) var_1_31))) && (var_1_39 == ((signed char) var_1_31))) && (var_1_40 == ((unsigned char) var_1_41)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=2, var_1_11=3, var_1_14=156, var_1_15=6, var_1_19=312, var_1_1=156, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=63, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, var_1_8=1073741823] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=2, var_1_11=3, var_1_14=156, var_1_15=6, var_1_19=312, var_1_1=156, var_1_29=156, var_1_30=222, var_1_31=-253, var_1_32=63, var_1_33=319, var_1_34=63, var_1_35=63, var_1_37=63, var_1_38=-253, var_1_39=3, var_1_40=1, var_1_41=1, var_1_6=3, var_1_8=1073741823] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 175 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 3, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 275 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 438 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 190 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 295 mSDtfsCounter, 190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 46 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 357 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2730/2772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:12:36,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-0.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 7061d7705e35ffb179f69b4cdd3a111dfb45a568e3f5347cc63566e16555668c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:12:37,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:12:37,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:12:37,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:12:37,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:12:37,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:12:37,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:12:37,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:12:37,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:12:37,966 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:12:37,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:12:37,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:12:37,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:12:37,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:12:37,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:12:37,967 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:12:37,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:12:37,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:12:37,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:12:37,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:12:37,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:12:37,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:12:37,968 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:12:37,968 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:12:37,968 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:12:37,968 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:12:37,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:12:37,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:12:37,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:12:37,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:12:37,968 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 -> 7061d7705e35ffb179f69b4cdd3a111dfb45a568e3f5347cc63566e16555668c [2025-03-17 03:12:38,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:12:38,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:12:38,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:12:38,228 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:12:38,228 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:12:38,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-0.i [2025-03-17 03:12:39,336 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/084f795a8/f8a5547755c84fc592de529b294902c3/FLAG49c4de68a [2025-03-17 03:12:39,535 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:12:39,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-0.i [2025-03-17 03:12:39,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/084f795a8/f8a5547755c84fc592de529b294902c3/FLAG49c4de68a [2025-03-17 03:12:39,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/084f795a8/f8a5547755c84fc592de529b294902c3 [2025-03-17 03:12:39,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:12:39,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:12:39,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:12:39,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:12:39,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:12:39,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:12:39" (1/1) ... [2025-03-17 03:12:39,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4138786d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:39, skipping insertion in model container [2025-03-17 03:12:39,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:12:39" (1/1) ... [2025-03-17 03:12:39,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:12:40,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-0.i[915,928] [2025-03-17 03:12:40,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:12:40,096 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:12:40,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-0.i[915,928] [2025-03-17 03:12:40,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:12:40,143 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:12:40,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40 WrapperNode [2025-03-17 03:12:40,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:12:40,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:12:40,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:12:40,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:12:40,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40" (1/1) ... [2025-03-17 03:12:40,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40" (1/1) ... [2025-03-17 03:12:40,177 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2025-03-17 03:12:40,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:12:40,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:12:40,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:12:40,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:12:40,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40" (1/1) ... [2025-03-17 03:12:40,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40" (1/1) ... [2025-03-17 03:12:40,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40" (1/1) ... [2025-03-17 03:12:40,199 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:12:40,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40" (1/1) ... [2025-03-17 03:12:40,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40" (1/1) ... [2025-03-17 03:12:40,210 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40" (1/1) ... [2025-03-17 03:12:40,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40" (1/1) ... [2025-03-17 03:12:40,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40" (1/1) ... [2025-03-17 03:12:40,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40" (1/1) ... [2025-03-17 03:12:40,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:12:40,217 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:12:40,217 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:12:40,217 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:12:40,218 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40" (1/1) ... [2025-03-17 03:12:40,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:12:40,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:12:40,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:12:40,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:12:40,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:12:40,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:12:40,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:12:40,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:12:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:12:40,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:12:40,354 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:12:40,356 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:12:51,664 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-17 03:12:51,664 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:12:51,677 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:12:51,677 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:12:51,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:12:51 BoogieIcfgContainer [2025-03-17 03:12:51,678 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:12:51,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:12:51,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:12:51,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:12:51,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:12:39" (1/3) ... [2025-03-17 03:12:51,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70405adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:12:51, skipping insertion in model container [2025-03-17 03:12:51,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:12:40" (2/3) ... [2025-03-17 03:12:51,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70405adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:12:51, skipping insertion in model container [2025-03-17 03:12:51,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:12:51" (3/3) ... [2025-03-17 03:12:51,684 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-0.i [2025-03-17 03:12:51,692 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:12:51,693 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-0.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:12:51,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:12:51,735 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;@5f86af40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:12:51,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:12:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 47 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 03:12:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 03:12:51,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:12:51,747 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:12:51,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:12:51,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:12:51,750 INFO L85 PathProgramCache]: Analyzing trace with hash 619427748, now seen corresponding path program 1 times [2025-03-17 03:12:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:12:51,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071263911] [2025-03-17 03:12:51,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:12:51,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:12:51,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:12:51,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:12:51,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:12:51,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 03:12:52,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 03:12:52,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:12:52,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:12:52,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:12:52,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:12:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-17 03:12:52,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:12:52,283 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:12:52,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071263911] [2025-03-17 03:12:52,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071263911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:12:52,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:12:52,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:12:52,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683178063] [2025-03-17 03:12:52,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:12:52,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:12:52,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:12:52,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:12:52,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:12:52,305 INFO L87 Difference]: Start difference. First operand has 71 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 47 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 03:12:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:12:52,320 INFO L93 Difference]: Finished difference Result 138 states and 240 transitions. [2025-03-17 03:12:52,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:12:52,321 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2025-03-17 03:12:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:12:52,325 INFO L225 Difference]: With dead ends: 138 [2025-03-17 03:12:52,325 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 03:12:52,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:12:52,330 INFO L435 NwaCegarLoop]: 104 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, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:12:52,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:12:52,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 03:12:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 03:12:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 03:12:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2025-03-17 03:12:52,364 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 144 [2025-03-17 03:12:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:12:52,366 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2025-03-17 03:12:52,366 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, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 03:12:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2025-03-17 03:12:52,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 03:12:52,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:12:52,369 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:12:52,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:12:52,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:12:52,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:12:52,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:12:52,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1665226714, now seen corresponding path program 1 times [2025-03-17 03:12:52,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:12:52,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659095112] [2025-03-17 03:12:52,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:12:52,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:12:52,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:12:52,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:12:52,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:12:52,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 03:12:53,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 03:12:53,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:12:53,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:12:53,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 03:12:53,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:12:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-17 03:12:53,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:12:53,763 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:12:53,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659095112] [2025-03-17 03:12:53,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659095112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:12:53,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:12:53,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 03:12:53,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454116091] [2025-03-17 03:12:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:12:53,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 03:12:53,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:12:53,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 03:12:53,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 03:12:53,765 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 03:12:59,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:13:03,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:13:07,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:13:11,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:13:14,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:13:16,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:13:16,200 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2025-03-17 03:13:16,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 03:13:16,201 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2025-03-17 03:13:16,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:13:16,202 INFO L225 Difference]: With dead ends: 191 [2025-03-17 03:13:16,202 INFO L226 Difference]: Without dead ends: 124 [2025-03-17 03:13:16,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2025-03-17 03:13:16,203 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 149 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 129 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2025-03-17 03:13:16,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 437 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 600 Invalid, 4 Unknown, 0 Unchecked, 21.7s Time] [2025-03-17 03:13:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-17 03:13:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2025-03-17 03:13:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 67 states have internal predecessors, (76), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-17 03:13:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2025-03-17 03:13:16,220 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 144 [2025-03-17 03:13:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:13:16,221 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2025-03-17 03:13:16,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-17 03:13:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2025-03-17 03:13:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 03:13:16,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:13:16,222 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:13:16,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 03:13:16,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:13:16,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:13:16,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:13:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash 131724645, now seen corresponding path program 1 times [2025-03-17 03:13:16,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:13:16,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482788101] [2025-03-17 03:13:16,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:13:16,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:13:16,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:13:16,430 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:13:16,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 03:13:16,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 03:13:17,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 03:13:17,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:13:17,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:13:17,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-17 03:13:17,366 INFO L279 TraceCheckSpWp]: Computing forward predicates...