./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.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-17.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 e0367532259248ca682cef23c751a4218c077539166eeae78f6da36c114ad9d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:13:42,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:13:43,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:13:43,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:13:43,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:13:43,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:13:43,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:13:43,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:13:43,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:13:43,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:13:43,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:13:43,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:13:43,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:13:43,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:13:43,050 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:13:43,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:13:43,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:13:43,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:13:43,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:13:43,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:13:43,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:13:43,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:13:43,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:13:43,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:13:43,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:13:43,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:13:43,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:13:43,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:13:43,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:13:43,051 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 -> e0367532259248ca682cef23c751a4218c077539166eeae78f6da36c114ad9d6 [2025-03-17 03:13:43,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:13:43,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:13:43,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:13:43,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:13:43,331 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:13:43,332 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-17.i [2025-03-17 03:13:44,489 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96cf0142e/3b58ca79116a452a8076ee1eb0891a7b/FLAGb50168840 [2025-03-17 03:13:44,715 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:13:44,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.i [2025-03-17 03:13:44,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96cf0142e/3b58ca79116a452a8076ee1eb0891a7b/FLAGb50168840 [2025-03-17 03:13:44,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96cf0142e/3b58ca79116a452a8076ee1eb0891a7b [2025-03-17 03:13:44,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:13:44,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:13:44,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:13:44,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:13:44,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:13:44,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:13:44" (1/1) ... [2025-03-17 03:13:44,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161f0ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:44, skipping insertion in model container [2025-03-17 03:13:44,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:13:44" (1/1) ... [2025-03-17 03:13:44,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:13:44,858 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-17.i[916,929] [2025-03-17 03:13:44,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:13:44,935 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:13:44,945 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-17.i[916,929] [2025-03-17 03:13:44,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:13:44,997 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:13:44,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:44 WrapperNode [2025-03-17 03:13:44,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:13:44,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:13:44,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:13:44,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:13:45,004 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:13:44" (1/1) ... [2025-03-17 03:13:45,023 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:13:44" (1/1) ... [2025-03-17 03:13:45,057 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2025-03-17 03:13:45,058 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:13:45,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:13:45,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:13:45,059 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:13:45,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:44" (1/1) ... [2025-03-17 03:13:45,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:44" (1/1) ... [2025-03-17 03:13:45,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:44" (1/1) ... [2025-03-17 03:13:45,091 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:13:45,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:44" (1/1) ... [2025-03-17 03:13:45,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:44" (1/1) ... [2025-03-17 03:13:45,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:44" (1/1) ... [2025-03-17 03:13:45,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:44" (1/1) ... [2025-03-17 03:13:45,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:44" (1/1) ... [2025-03-17 03:13:45,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:44" (1/1) ... [2025-03-17 03:13:45,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:13:45,110 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:13:45,110 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:13:45,110 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:13:45,111 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:44" (1/1) ... [2025-03-17 03:13:45,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:13:45,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:13:45,146 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:13:45,205 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:13:45,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:13:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:13:45,224 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:13:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:13:45,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:13:45,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:13:45,283 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:13:45,285 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:13:45,683 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: havoc property_#t~bitwise20#1;havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-03-17 03:13:45,720 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-17 03:13:45,721 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:13:45,738 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:13:45,739 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:13:45,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:13:45 BoogieIcfgContainer [2025-03-17 03:13:45,739 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:13:45,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:13:45,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:13:45,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:13:45,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:13:44" (1/3) ... [2025-03-17 03:13:45,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1187012b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:13:45, skipping insertion in model container [2025-03-17 03:13:45,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:44" (2/3) ... [2025-03-17 03:13:45,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1187012b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:13:45, skipping insertion in model container [2025-03-17 03:13:45,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:13:45" (3/3) ... [2025-03-17 03:13:45,748 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-17.i [2025-03-17 03:13:45,759 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:13:45,760 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-17.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:13:45,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:13:45,803 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;@2bdfbf3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:13:45,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:13:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:13:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 03:13:45,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:13:45,816 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:13:45,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:13:45,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1445018197, now seen corresponding path program 1 times [2025-03-17 03:13:45,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:13:45,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305519753] [2025-03-17 03:13:45,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:13:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:13:45,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:13:45,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:13:45,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:13:45,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:13:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-17 03:13:46,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:13:46,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305519753] [2025-03-17 03:13:46,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305519753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:13:46,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596937975] [2025-03-17 03:13:46,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:13:46,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:13:46,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:13:46,120 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:13:46,122 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:13:46,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:13:46,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:13:46,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:13:46,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:13:46,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:13:46,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:13:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-03-17 03:13:46,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:13:46,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596937975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:13:46,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:13:46,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:13:46,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632624409] [2025-03-17 03:13:46,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:13:46,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:13:46,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:13:46,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:13:46,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:13:46,379 INFO L87 Difference]: Start difference. First operand has 91 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 03:13:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:13:46,412 INFO L93 Difference]: Finished difference Result 179 states and 302 transitions. [2025-03-17 03:13:46,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:13:46,417 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2025-03-17 03:13:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:13:46,426 INFO L225 Difference]: With dead ends: 179 [2025-03-17 03:13:46,426 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 03:13:46,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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:13:46,430 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:13:46,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:13:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 03:13:46,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 03:13:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:13:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 136 transitions. [2025-03-17 03:13:46,476 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 136 transitions. Word has length 164 [2025-03-17 03:13:46,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:13:46,477 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 136 transitions. [2025-03-17 03:13:46,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 03:13:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 136 transitions. [2025-03-17 03:13:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 03:13:46,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:13:46,479 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,486 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:13:46,684 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:13:46,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:13:46,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:13:46,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1518720175, now seen corresponding path program 1 times [2025-03-17 03:13:46,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:13:46,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473283031] [2025-03-17 03:13:46,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:13:46,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:13:46,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 03:13:46,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 03:13:46,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:13:46,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:13:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:13:47,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:13:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473283031] [2025-03-17 03:13:47,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473283031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:13:47,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:13:47,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 03:13:47,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619471121] [2025-03-17 03:13:47,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:13:47,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:13:47,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:13:47,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:13:47,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:13:47,110 INFO L87 Difference]: Start difference. First operand 89 states and 136 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:13:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:13:47,363 INFO L93 Difference]: Finished difference Result 277 states and 426 transitions. [2025-03-17 03:13:47,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 03:13:47,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2025-03-17 03:13:47,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:13:47,367 INFO L225 Difference]: With dead ends: 277 [2025-03-17 03:13:47,369 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 03:13:47,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 03:13:47,370 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 197 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:13:47,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 363 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:13:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 03:13:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 174. [2025-03-17 03:13:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 123 states have (on average 1.3902439024390243) internal successors, (171), 123 states have internal predecessors, (171), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:13:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 267 transitions. [2025-03-17 03:13:47,406 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 267 transitions. Word has length 164 [2025-03-17 03:13:47,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:13:47,408 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 267 transitions. [2025-03-17 03:13:47,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:13:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 267 transitions. [2025-03-17 03:13:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 03:13:47,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:13:47,412 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:13:47,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:13:47,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:13:47,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1398725145, now seen corresponding path program 1 times [2025-03-17 03:13:47,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:13:47,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880037297] [2025-03-17 03:13:47,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:13:47,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:13:47,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:13:47,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:13:47,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:13:47,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:13:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:13:48,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:13:48,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880037297] [2025-03-17 03:13:48,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880037297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:13:48,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:13:48,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 03:13:48,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685358635] [2025-03-17 03:13:48,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:13:48,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 03:13:48,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:13:48,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 03:13:48,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:13:48,729 INFO L87 Difference]: Start difference. First operand 174 states and 267 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:13:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:13:49,435 INFO L93 Difference]: Finished difference Result 452 states and 688 transitions. [2025-03-17 03:13:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 03:13:49,435 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-17 03:13:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:13:49,437 INFO L225 Difference]: With dead ends: 452 [2025-03-17 03:13:49,438 INFO L226 Difference]: Without dead ends: 364 [2025-03-17 03:13:49,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 03:13:49,442 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 248 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:13:49,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 499 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 03:13:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-17 03:13:49,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 230. [2025-03-17 03:13:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 154 states have internal predecessors, (210), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 03:13:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2025-03-17 03:13:49,492 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 165 [2025-03-17 03:13:49,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:13:49,493 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2025-03-17 03:13:49,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:13:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2025-03-17 03:13:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 03:13:49,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:13:49,496 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 03:13:49,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:13:49,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:13:49,497 INFO L85 PathProgramCache]: Analyzing trace with hash 554253274, now seen corresponding path program 1 times [2025-03-17 03:13:49,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:13:49,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789332170] [2025-03-17 03:13:49,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:13:49,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:13:49,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:13:49,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:13:49,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:13:49,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:13:49,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1875976207] [2025-03-17 03:13:49,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:13:49,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:13:49,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:13:49,645 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:13:49,646 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:13:49,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 03:13:49,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 03:13:49,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:13:49,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:13:49,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 03:13:49,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:13:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:13:50,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:13:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:13:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789332170] [2025-03-17 03:13:50,164 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 03:13:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875976207] [2025-03-17 03:13:50,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875976207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:13:50,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:13:50,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:13:50,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941989380] [2025-03-17 03:13:50,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:13:50,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:13:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:13:50,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:13:50,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:13:50,171 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:13:50,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:13:50,407 INFO L93 Difference]: Finished difference Result 481 states and 736 transitions. [2025-03-17 03:13:50,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:13:50,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-03-17 03:13:50,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:13:50,412 INFO L225 Difference]: With dead ends: 481 [2025-03-17 03:13:50,413 INFO L226 Difference]: Without dead ends: 300 [2025-03-17 03:13:50,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:13:50,415 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 93 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 03:13:50,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 440 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 03:13:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-17 03:13:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 230. [2025-03-17 03:13:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 03:13:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2025-03-17 03:13:50,449 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 165 [2025-03-17 03:13:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:13:50,449 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2025-03-17 03:13:50,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:13:50,449 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2025-03-17 03:13:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-17 03:13:50,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:13:50,451 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,458 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:13:50,651 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,SelfDestructingSolverStorable3 [2025-03-17 03:13:50,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:13:50,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:13:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash 929369073, now seen corresponding path program 1 times [2025-03-17 03:13:50,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:13:50,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97988501] [2025-03-17 03:13:50,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:13:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:13:50,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 03:13:50,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 03:13:50,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:13:50,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:13:50,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2077758541] [2025-03-17 03:13:50,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:13:50,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:13:50,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:13:50,753 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:13:50,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 03:13:50,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 03:13:51,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 03:13:51,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:13:51,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:13:51,142 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:13:51,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 03:13:51,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 03:13:51,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:13:51,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:13:51,315 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:13:51,315 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:13:51,316 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:13:51,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 03:13:51,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:13:51,521 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 03:13:51,590 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:13:51,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:13:51 BoogieIcfgContainer [2025-03-17 03:13:51,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:13:51,597 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:13:51,597 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:13:51,597 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:13:51,598 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:13:45" (3/4) ... [2025-03-17 03:13:51,599 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:13:51,600 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:13:51,601 INFO L158 Benchmark]: Toolchain (without parser) took 6864.90ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 121.7MB in the beginning and 130.7MB in the end (delta: -8.9MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2025-03-17 03:13:51,602 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:13:51,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.94ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 105.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:13:51,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.49ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 100.2MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:13:51,603 INFO L158 Benchmark]: Boogie Preprocessor took 50.64ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 93.8MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:13:51,603 INFO L158 Benchmark]: IcfgBuilder took 629.07ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 60.8MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 03:13:51,603 INFO L158 Benchmark]: TraceAbstraction took 5855.50ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 60.3MB in the beginning and 130.7MB in the end (delta: -70.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:13:51,604 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 209.7MB. Free memory was 130.7MB in the beginning and 130.7MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:13:51,605 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.14ms. Allocated memory is still 201.3MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.94ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 105.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.49ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 100.2MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.64ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 93.8MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 629.07ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 60.8MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5855.50ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 60.3MB in the beginning and 130.7MB in the end (delta: -70.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 209.7MB. Free memory was 130.7MB in the beginning and 130.7MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 77, overapproximation of someBinaryArithmeticDOUBLEoperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someUnaryDOUBLEoperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 146, overapproximation of someBinaryArithmeticFLOAToperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_8 = 0; [L24] unsigned char var_1_9 = 1; [L25] signed short int var_1_10 = 1000; [L26] signed long int var_1_11 = -10; [L27] signed short int var_1_12 = 16; [L28] signed short int var_1_14 = 0; [L29] double var_1_16 = 7.3; [L30] double var_1_17 = 0.2; [L31] float var_1_18 = 3.5; [L32] float var_1_19 = 128.2; [L33] float var_1_20 = 5.8; [L34] signed char var_1_21 = 16; [L35] unsigned char var_1_22 = 1; [L36] signed long int var_1_23 = -128; [L37] unsigned short int var_1_24 = 128; [L38] float var_1_26 = 31.25; [L39] float var_1_27 = 0.6; [L40] float var_1_28 = 127.2; [L41] float var_1_29 = 128.18; [L42] float var_1_30 = 31.8; [L43] unsigned char var_1_31 = 25; [L44] unsigned char var_1_33 = 5; [L45] unsigned char var_1_34 = 2; [L46] unsigned char var_1_35 = 128; [L47] unsigned char last_1_var_1_1 = 1; [L48] signed short int last_1_var_1_14 = 0; [L49] signed long int last_1_var_1_23 = -128; [L50] unsigned char last_1_var_1_31 = 25; [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_14 = var_1_14 [L174] last_1_var_1_23 = var_1_23 [L175] last_1_var_1_31 = var_1_31 [L185] RET updateLastVariables() [L186] CALL updateVariables() [L132] var_1_8 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L133] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L134] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L135] var_1_9 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L137] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L137] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-10, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L138] var_1_11 = __VERIFIER_nondet_long() [L139] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=16, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L142] var_1_12 = __VERIFIER_nondet_short() [L143] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_17=1/5, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L145] var_1_17 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_19=641/5, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L147] var_1_19 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L148] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=16, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L149] var_1_21 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_21 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_21 >= -128) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L151] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L151] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_27=3/5, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L153] var_1_27 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_27 >= -115292.1504606845700e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 1152921.504606845700e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not((var_1_27 >= -115292.1504606845700e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 1152921.504606845700e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_28=636/5, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L155] var_1_28 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_28 >= -115292.1504606845700e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 1152921.504606845700e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L156] RET assume_abort_if_not((var_1_28 >= -115292.1504606845700e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 1152921.504606845700e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_29=6409/50, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L157] var_1_29 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not((var_1_29 >= 0.0F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_30=159/5, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L159] var_1_30 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=5, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L161] var_1_33 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L162] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_33 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not(var_1_33 <= 64) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=2, var_1_35=128, var_1_8=0, var_1_9=1] [L164] var_1_34 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L165] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_35=128, var_1_8=0, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L166] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=128, var_1_8=0, var_1_9=1] [L167] var_1_35 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_35 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L168] RET assume_abort_if_not(var_1_35 >= 127) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L169] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=1000, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L186] RET updateVariables() [L187] CALL step() [L54] COND TRUE (-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11) [L55] var_1_10 = ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L59] signed long int stepLocal_8 = last_1_var_1_14; [L60] unsigned char stepLocal_7 = last_1_var_1_14 <= (last_1_var_1_14 * var_1_12); VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_7=1, stepLocal_8=0, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L61] COND TRUE stepLocal_7 && last_1_var_1_1 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_8=0, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=25, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L62] COND FALSE !(last_1_var_1_31 <= stepLocal_8) [L69] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=0, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L74] var_1_14 = (-2 + (last_1_var_1_31 + last_1_var_1_31)) [L75] unsigned char stepLocal_1 = var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_1=0, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=73/10, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L76] COND TRUE stepLocal_1 == (-128 * var_1_31) [L77] var_1_16 = (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=125/4, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L81] COND FALSE !(\read(var_1_8)) [L84] var_1_26 = ((((var_1_17) < ((var_1_29 - var_1_30))) ? (var_1_17) : ((var_1_29 - var_1_30)))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L86] signed short int stepLocal_6 = var_1_10; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_6=-128, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=128, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L87] COND TRUE stepLocal_6 >= ((((var_1_11) < ((var_1_31 * var_1_14))) ? (var_1_11) : ((var_1_31 * var_1_14)))) [L88] var_1_24 = ((((var_1_31) < (var_1_31)) ? (var_1_31) : (var_1_31))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L92] signed long int stepLocal_5 = 25 * var_1_14; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_5=1200, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L93] COND TRUE ! (var_1_31 <= var_1_10) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_5=1200, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-128, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L94] COND FALSE !(var_1_10 >= stepLocal_5) [L97] var_1_23 = ((var_1_10 + var_1_14) + var_1_24) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L100] unsigned char stepLocal_0 = ((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_0=0, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L101] EXPR var_1_31 | var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_0=0, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=1, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L101] COND TRUE ((var_1_31 | var_1_24) <= var_1_31) || stepLocal_0 [L102] var_1_1 = ((! 1) && var_1_8) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=0, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L106] unsigned char stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_2=0, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_18=7/2, var_1_1=0, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L107] COND TRUE ((var_1_24 + -16) * var_1_23) >= stepLocal_2 [L108] var_1_18 = (64.9f + var_1_19) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L112] signed long int stepLocal_3 = var_1_14 % var_1_21; VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_3=48, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L113] EXPR var_1_31 & var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_3=48, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_1=0, var_1_20=29/5, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L113] COND TRUE stepLocal_3 >= (var_1_31 & var_1_24) [L114] var_1_20 = ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L118] unsigned long int stepLocal_4 = ~ (var_1_31 * 128u); VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_4=4294967295, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L119] COND FALSE !(! (var_1_10 <= var_1_23)) [L128] var_1_22 = var_1_9 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, stepLocal_4=4294967295, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L187] RET step() [L188] CALL, EXPR property() [L178] EXPR var_1_31 | var_1_24 VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L178] EXPR ((((((((var_1_31 | var_1_24) <= var_1_31) || (((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31)) ? (var_1_1 == ((unsigned char) ((! 1) && var_1_8))) : (var_1_1 == ((unsigned char) var_1_9))) && (((-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11)) ? (var_1_10 == ((signed short int) ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))))) : (var_1_10 == ((signed short int) (last_1_var_1_31 - last_1_var_1_31))))) && (var_1_14 == ((signed short int) (-2 + (last_1_var_1_31 + last_1_var_1_31))))) && ((var_1_31 == (-128 * var_1_31)) ? (var_1_16 == ((double) (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))))) : (var_1_16 == ((double) var_1_17)))) && ((((var_1_24 + -16) * var_1_23) >= var_1_31) ? (var_1_18 == ((float) (64.9f + var_1_19))) : (var_1_18 == ((float) var_1_17)))) && (((var_1_14 % var_1_21) >= (var_1_31 & var_1_24)) ? (var_1_20 == ((float) ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))))) : (var_1_20 == ((float) var_1_19))) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L178-L179] return (((((((((((((var_1_31 | var_1_24) <= var_1_31) || (((((var_1_24) < (var_1_14)) ? (var_1_24) : (var_1_14))) > var_1_31)) ? (var_1_1 == ((unsigned char) ((! 1) && var_1_8))) : (var_1_1 == ((unsigned char) var_1_9))) && (((-16 * last_1_var_1_23) > (((((last_1_var_1_23) < (last_1_var_1_23)) ? (last_1_var_1_23) : (last_1_var_1_23))) / var_1_11)) ? (var_1_10 == ((signed short int) ((((last_1_var_1_14) < (last_1_var_1_23)) ? (last_1_var_1_14) : (last_1_var_1_23))))) : (var_1_10 == ((signed short int) (last_1_var_1_31 - last_1_var_1_31))))) && (var_1_14 == ((signed short int) (-2 + (last_1_var_1_31 + last_1_var_1_31))))) && ((var_1_31 == (-128 * var_1_31)) ? (var_1_16 == ((double) (((((0.875 + (var_1_17 + 64.4))) > (1.0000000000000005E15)) ? ((0.875 + (var_1_17 + 64.4))) : (1.0000000000000005E15))))) : (var_1_16 == ((double) var_1_17)))) && ((((var_1_24 + -16) * var_1_23) >= var_1_31) ? (var_1_18 == ((float) (64.9f + var_1_19))) : (var_1_18 == ((float) var_1_17)))) && (((var_1_14 % var_1_21) >= (var_1_31 & var_1_24)) ? (var_1_20 == ((float) ((((((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) < (var_1_19)) ? (((((63.5f + var_1_17) < 0 ) ? -(63.5f + var_1_17) : (63.5f + var_1_17)))) : (var_1_19))))) : (var_1_20 == ((float) var_1_19)))) && ((! (var_1_10 <= var_1_23)) ? (var_1_1 ? (((~ (var_1_31 * 128u)) == var_1_23) ? (var_1_22 == ((unsigned char) (! var_1_9))) : 1) : (var_1_22 == ((unsigned char) var_1_9))) : (var_1_22 == ((unsigned char) var_1_9)))) && ((! (var_1_31 <= var_1_10)) ? ((var_1_10 >= (25 * var_1_14)) ? (var_1_23 == ((signed long int) ((((var_1_24) < (var_1_10)) ? (var_1_24) : (var_1_10))))) : (var_1_23 == ((signed long int) ((var_1_10 + var_1_14) + var_1_24)))) : 1)) && ((var_1_10 >= ((((var_1_11) < ((var_1_31 * var_1_14))) ? (var_1_11) : ((var_1_31 * var_1_14))))) ? (var_1_24 == ((unsigned short int) ((((var_1_31) < (var_1_31)) ? (var_1_31) : (var_1_31))))) : (var_1_24 == ((unsigned short int) var_1_31)))) && (var_1_8 ? (var_1_26 == ((float) (var_1_19 + ((var_1_27 + var_1_28) + var_1_17)))) : (var_1_26 == ((float) ((((var_1_17) < ((var_1_29 - var_1_30))) ? (var_1_17) : ((var_1_29 - var_1_30)))))))) && (((last_1_var_1_14 <= (last_1_var_1_14 * var_1_12)) && last_1_var_1_1) ? ((last_1_var_1_31 <= last_1_var_1_14) ? (((- var_1_19) >= var_1_17) ? (var_1_31 == ((unsigned char) (128 - ((((100) < ((var_1_33 + var_1_34))) ? (100) : ((var_1_33 + var_1_34))))))) : (var_1_31 == ((unsigned char) (var_1_35 - 5)))) : (var_1_31 == ((unsigned char) var_1_33))) : (var_1_31 == ((unsigned char) var_1_33))) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=0, last_1_var_1_1=1, last_1_var_1_23=-128, last_1_var_1_31=25, var_1_10=-128, var_1_11=-129, var_1_12=0, var_1_14=48, var_1_16=2, var_1_17=3, var_1_19=0, var_1_1=0, var_1_20=4, var_1_21=49, var_1_22=1, var_1_23=-80, var_1_24=0, var_1_26=3, var_1_31=0, var_1_33=0, var_1_34=0, var_1_35=127, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 164 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 5, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 1434 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 920 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 601 IncrementalHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 514 mSDtfsCounter, 601 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=3, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 219 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1319 NumberOfCodeBlocks, 1319 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 817 ConstructedInterpolants, 0 QuantifiedInterpolants, 4219 SizeOfPredicates, 3 NumberOfNonLiveVariables, 793 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 5474/5520 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:13:51,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.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 e0367532259248ca682cef23c751a4218c077539166eeae78f6da36c114ad9d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:13:53,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:13:53,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:13:53,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:13:53,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:13:53,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:13:53,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:13:53,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:13:53,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:13:53,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:13:53,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:13:53,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:13:53,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:13:53,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:13:53,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:13:53,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:13:53,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:13:53,781 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 -> e0367532259248ca682cef23c751a4218c077539166eeae78f6da36c114ad9d6 [2025-03-17 03:13:54,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:13:54,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:13:54,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:13:54,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:13:54,044 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:13:54,046 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-17.i [2025-03-17 03:13:55,228 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51838bb20/5b914583c43c4906b9a388126411eab7/FLAG9d65e3e14 [2025-03-17 03:13:55,435 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:13:55,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-17.i [2025-03-17 03:13:55,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51838bb20/5b914583c43c4906b9a388126411eab7/FLAG9d65e3e14 [2025-03-17 03:13:55,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51838bb20/5b914583c43c4906b9a388126411eab7 [2025-03-17 03:13:55,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:13:55,469 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:13:55,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:13:55,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:13:55,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:13:55,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:13:55" (1/1) ... [2025-03-17 03:13:55,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154d89a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:55, skipping insertion in model container [2025-03-17 03:13:55,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:13:55" (1/1) ... [2025-03-17 03:13:55,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:13:55,600 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-17.i[916,929] [2025-03-17 03:13:55,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:13:55,679 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:13:55,687 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-17.i[916,929] [2025-03-17 03:13:55,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:13:55,730 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:13:55,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:55 WrapperNode [2025-03-17 03:13:55,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:13:55,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:13:55,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:13:55,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:13:55,737 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:13:55" (1/1) ... [2025-03-17 03:13:55,751 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:13:55" (1/1) ... [2025-03-17 03:13:55,781 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2025-03-17 03:13:55,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:13:55,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:13:55,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:13:55,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:13:55,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:55" (1/1) ... [2025-03-17 03:13:55,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:55" (1/1) ... [2025-03-17 03:13:55,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:55" (1/1) ... [2025-03-17 03:13:55,813 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:13:55,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:55" (1/1) ... [2025-03-17 03:13:55,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:55" (1/1) ... [2025-03-17 03:13:55,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:55" (1/1) ... [2025-03-17 03:13:55,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:55" (1/1) ... [2025-03-17 03:13:55,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:55" (1/1) ... [2025-03-17 03:13:55,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:55" (1/1) ... [2025-03-17 03:13:55,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:13:55,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:13:55,839 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:13:55,839 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:13:55,840 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:55" (1/1) ... [2025-03-17 03:13:55,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:13:55,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:13:55,874 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:13:55,877 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:13:55,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:13:55,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:13:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:13:55,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:13:55,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:13:55,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:13:55,967 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:13:55,968 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:14:09,629 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-17 03:14:09,629 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:14:09,636 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:14:09,636 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:14:09,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:14:09 BoogieIcfgContainer [2025-03-17 03:14:09,637 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:14:09,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:14:09,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:14:09,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:14:09,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:13:55" (1/3) ... [2025-03-17 03:14:09,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489fd421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:14:09, skipping insertion in model container [2025-03-17 03:14:09,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:13:55" (2/3) ... [2025-03-17 03:14:09,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489fd421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:14:09, skipping insertion in model container [2025-03-17 03:14:09,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:14:09" (3/3) ... [2025-03-17 03:14:09,643 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-17.i [2025-03-17 03:14:09,653 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:14:09,654 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-17.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:14:09,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:14:09,706 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;@6dbfaf9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:14:09,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:14:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:14:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 03:14:09,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:09,720 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:09,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:09,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1196226571, now seen corresponding path program 1 times [2025-03-17 03:14:09,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:14:09,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138617545] [2025-03-17 03:14:09,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:09,732 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:14:09,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:14:09,734 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:14:09,746 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:14:09,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 03:14:10,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 03:14:10,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:10,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:10,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:14:10,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:14:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2025-03-17 03:14:10,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:14:10,619 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:14:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138617545] [2025-03-17 03:14:10,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138617545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:10,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:10,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:14:10,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498960] [2025-03-17 03:14:10,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:10,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:14:10,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:14:10,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:14:10,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:14:10,644 INFO L87 Difference]: Start difference. First operand has 74 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 03:14:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:10,666 INFO L93 Difference]: Finished difference Result 145 states and 250 transitions. [2025-03-17 03:14:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:14:10,668 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2025-03-17 03:14:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:10,673 INFO L225 Difference]: With dead ends: 145 [2025-03-17 03:14:10,673 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 03:14:10,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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:14:10,679 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:10,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:14:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 03:14:10,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-17 03:14:10,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 03:14:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2025-03-17 03:14:10,720 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 157 [2025-03-17 03:14:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:10,721 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2025-03-17 03:14:10,721 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-17 03:14:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2025-03-17 03:14:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-17 03:14:10,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:10,725 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:10,752 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:14:10,925 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:14:10,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:10,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash 792985893, now seen corresponding path program 1 times [2025-03-17 03:14:10,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:14:10,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217812755] [2025-03-17 03:14:10,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:10,928 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:14:10,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:14:10,930 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:14:10,931 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:14:10,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 03:14:11,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 03:14:11,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:11,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:11,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:14:11,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:14:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:14:17,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:14:17,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:14:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217812755] [2025-03-17 03:14:17,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217812755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:17,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:17,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:14:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360535869] [2025-03-17 03:14:17,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:17,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:14:17,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:14:17,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:14:17,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:14:17,403 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:14:22,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:14:26,730 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:14:30,732 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:14:35,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:14:39,247 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:14:43,253 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:14:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:14:43,254 INFO L93 Difference]: Finished difference Result 215 states and 329 transitions. [2025-03-17 03:14:43,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 03:14:43,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2025-03-17 03:14:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:14:43,357 INFO L225 Difference]: With dead ends: 215 [2025-03-17 03:14:43,357 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 03:14:43,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 03:14:43,358 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 67 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 49 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:14:43,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 359 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 25.6s Time] [2025-03-17 03:14:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 03:14:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2025-03-17 03:14:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 67 states have internal predecessors, (84), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:14:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 180 transitions. [2025-03-17 03:14:43,385 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 180 transitions. Word has length 157 [2025-03-17 03:14:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:14:43,385 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 180 transitions. [2025-03-17 03:14:43,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:14:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 180 transitions. [2025-03-17 03:14:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-17 03:14:43,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:14:43,387 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:43,419 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:14:43,587 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:14:43,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:14:43,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:14:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1674142812, now seen corresponding path program 1 times [2025-03-17 03:14:43,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:14:43,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579445206] [2025-03-17 03:14:43,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:14:43,589 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:14:43,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:14:43,595 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:14:43,598 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:14:43,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-17 03:14:44,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-17 03:14:44,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:14:44,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:14:44,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 03:14:44,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:14:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-03-17 03:14:51,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:14:51,115 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:14:51,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579445206] [2025-03-17 03:14:51,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579445206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:14:51,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:14:51,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 03:14:51,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121966724] [2025-03-17 03:14:51,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:14:51,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 03:14:51,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:14:51,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 03:14:51,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 03:14:51,116 INFO L87 Difference]: Start difference. First operand 118 states and 180 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:14:56,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:15:00,463 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:15:05,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 03:15:09,103 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:15:13,109 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:15:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:15:13,112 INFO L93 Difference]: Finished difference Result 260 states and 397 transitions. [2025-03-17 03:15:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 03:15:13,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2025-03-17 03:15:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:15:13,210 INFO L225 Difference]: With dead ends: 260 [2025-03-17 03:15:13,210 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 03:15:13,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 03:15:13,211 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 161 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2025-03-17 03:15:13,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 461 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 41 Invalid, 5 Unknown, 0 Unchecked, 21.6s Time] [2025-03-17 03:15:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 03:15:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 127. [2025-03-17 03:15:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 03:15:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2025-03-17 03:15:13,233 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 158 [2025-03-17 03:15:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:15:13,233 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2025-03-17 03:15:13,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-03-17 03:15:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2025-03-17 03:15:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 03:15:13,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:15:13,237 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:13,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 03:15:13,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:15:13,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:15:13,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:15:13,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1219392294, now seen corresponding path program 1 times [2025-03-17 03:15:13,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:15:13,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853777519] [2025-03-17 03:15:13,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:15:13,439 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:15:13,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:15:13,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:15:13,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 03:15:13,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 03:15:14,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 03:15:14,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:15:14,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:15:14,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 03:15:14,208 INFO L279 TraceCheckSpWp]: Computing forward predicates...