./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_operatoramount_amount100_file-6.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 2d3e3fe1097eb5cc161ed209d4e6f9c5a89785e619e27e5f9e0923413431f0b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:57:16,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:57:16,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:57:16,126 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:57:16,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:57:16,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:57:16,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:57:16,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:57:16,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:57:16,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:57:16,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:57:16,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:57:16,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:57:16,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:57:16,143 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:57:16,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:57:16,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:57:16,144 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:57:16,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:57:16,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:57:16,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:57:16,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:57:16,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:57:16,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:57:16,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:57:16,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:57:16,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:57:16,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:57:16,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:57:16,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:57:16,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:57:16,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:57:16,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:57:16,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:57:16,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:57:16,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:57:16,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:57:16,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:57:16,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:57:16,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:57:16,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:57:16,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:57:16,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:57:16,146 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 -> 2d3e3fe1097eb5cc161ed209d4e6f9c5a89785e619e27e5f9e0923413431f0b1 [2025-03-03 23:57:16,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:57:16,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:57:16,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:57:16,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:57:16,388 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:57:16,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i [2025-03-03 23:57:17,583 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095cc1643/a0e675495ac84a29bbc24b6adb6c5056/FLAG1513faab1 [2025-03-03 23:57:17,849 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:57:17,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i [2025-03-03 23:57:17,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095cc1643/a0e675495ac84a29bbc24b6adb6c5056/FLAG1513faab1 [2025-03-03 23:57:18,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/095cc1643/a0e675495ac84a29bbc24b6adb6c5056 [2025-03-03 23:57:18,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:57:18,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:57:18,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:57:18,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:57:18,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:57:18,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,174 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37cc4922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18, skipping insertion in model container [2025-03-03 23:57:18,174 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:57:18,280 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_operatoramount_amount100_file-6.i[915,928] [2025-03-03 23:57:18,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:57:18,345 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:57:18,352 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_operatoramount_amount100_file-6.i[915,928] [2025-03-03 23:57:18,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:57:18,386 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:57:18,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18 WrapperNode [2025-03-03 23:57:18,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:57:18,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:57:18,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:57:18,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:57:18,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,428 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2025-03-03 23:57:18,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:57:18,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:57:18,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:57:18,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:57:18,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,471 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-03 23:57:18,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,484 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:57:18,499 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:57:18,499 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:57:18,499 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:57:18,500 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18" (1/1) ... [2025-03-03 23:57:18,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:57:18,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:18,525 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-03 23:57:18,530 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-03 23:57:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:57:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:57:18,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:57:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:57:18,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:57:18,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:57:18,594 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:57:18,596 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:57:18,966 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L179: havoc property_#t~ite20#1;havoc property_#t~ite19#1;havoc property_#t~bitwise18#1;havoc property_#t~short21#1; [2025-03-03 23:57:18,990 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-03-03 23:57:18,990 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:57:19,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:57:19,012 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:57:19,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:57:19 BoogieIcfgContainer [2025-03-03 23:57:19,012 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:57:19,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:57:19,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:57:19,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:57:19,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:57:18" (1/3) ... [2025-03-03 23:57:19,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263115ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:57:19, skipping insertion in model container [2025-03-03 23:57:19,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:18" (2/3) ... [2025-03-03 23:57:19,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263115ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:57:19, skipping insertion in model container [2025-03-03 23:57:19,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:57:19" (3/3) ... [2025-03-03 23:57:19,021 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-6.i [2025-03-03 23:57:19,031 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:57:19,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-6.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:57:19,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:57:19,091 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;@c8d301c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:57:19,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:57:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:57:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 23:57:19,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:19,106 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:57:19,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:19,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:19,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1706672128, now seen corresponding path program 1 times [2025-03-03 23:57:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:19,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638455043] [2025-03-03 23:57:19,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:19,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:19,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 23:57:19,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 23:57:19,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:19,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 23:57:19,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:19,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638455043] [2025-03-03 23:57:19,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638455043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:57:19,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738887669] [2025-03-03 23:57:19,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:19,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:19,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:19,352 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-03 23:57:19,353 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-03 23:57:19,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 23:57:19,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 23:57:19,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:19,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:19,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:57:19,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 23:57:19,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:57:19,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738887669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:19,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:57:19,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:57:19,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620991472] [2025-03-03 23:57:19,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:19,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:57:19,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:19,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:57:19,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:57:19,539 INFO L87 Difference]: Start difference. First operand has 90 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:57:19,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:19,560 INFO L93 Difference]: Finished difference Result 173 states and 294 transitions. [2025-03-03 23:57:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:57:19,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153 [2025-03-03 23:57:19,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:19,567 INFO L225 Difference]: With dead ends: 173 [2025-03-03 23:57:19,567 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 23:57:19,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 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-03 23:57:19,573 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:19,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:57:19,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 23:57:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-03 23:57:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:57:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 131 transitions. [2025-03-03 23:57:19,611 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 131 transitions. Word has length 153 [2025-03-03 23:57:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:19,611 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 131 transitions. [2025-03-03 23:57:19,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:57:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 131 transitions. [2025-03-03 23:57:19,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 23:57:19,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:19,614 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:57:19,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:57:19,814 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-03 23:57:19,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:19,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1212136349, now seen corresponding path program 1 times [2025-03-03 23:57:19,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:19,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829680029] [2025-03-03 23:57:19,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:19,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 23:57:19,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 23:57:19,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:19,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 23:57:20,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:20,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829680029] [2025-03-03 23:57:20,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829680029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:20,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:20,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:57:20,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491162919] [2025-03-03 23:57:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:20,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:57:20,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:20,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:57:20,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:57:20,076 INFO L87 Difference]: Start difference. First operand 86 states and 131 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:57:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:20,183 INFO L93 Difference]: Finished difference Result 253 states and 378 transitions. [2025-03-03 23:57:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:57:20,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 153 [2025-03-03 23:57:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:20,186 INFO L225 Difference]: With dead ends: 253 [2025-03-03 23:57:20,186 INFO L226 Difference]: Without dead ends: 170 [2025-03-03 23:57:20,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:57:20,187 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 153 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:20,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 336 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:57:20,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-03 23:57:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 143. [2025-03-03 23:57:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 115 states have (on average 1.434782608695652) internal successors, (165), 116 states have internal predecessors, (165), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:57:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2025-03-03 23:57:20,200 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 153 [2025-03-03 23:57:20,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:20,201 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2025-03-03 23:57:20,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:57:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2025-03-03 23:57:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 23:57:20,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:20,203 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:57:20,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:57:20,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:20,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash 701602172, now seen corresponding path program 1 times [2025-03-03 23:57:20,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:20,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843427840] [2025-03-03 23:57:20,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:20,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:20,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 23:57:20,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 23:57:20,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:20,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 23:57:21,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:21,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843427840] [2025-03-03 23:57:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843427840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:57:21,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238849938] [2025-03-03 23:57:21,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:21,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:21,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:21,595 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-03 23:57:21,597 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-03 23:57:21,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 23:57:21,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 23:57:21,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:21,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:21,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 23:57:21,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:22,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 481 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-03 23:57:22,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:57:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2025-03-03 23:57:22,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238849938] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:57:22,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:57:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-03 23:57:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740487302] [2025-03-03 23:57:22,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:57:22,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 23:57:22,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:22,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 23:57:22,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2025-03-03 23:57:22,652 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand has 27 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 7 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 6 states have call predecessors, (39), 7 states have call successors, (39) [2025-03-03 23:57:25,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:25,007 INFO L93 Difference]: Finished difference Result 559 states and 788 transitions. [2025-03-03 23:57:25,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-03 23:57:25,007 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 7 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 6 states have call predecessors, (39), 7 states have call successors, (39) Word has length 153 [2025-03-03 23:57:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:25,011 INFO L225 Difference]: With dead ends: 559 [2025-03-03 23:57:25,012 INFO L226 Difference]: Without dead ends: 419 [2025-03-03 23:57:25,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1432, Invalid=4730, Unknown=0, NotChecked=0, Total=6162 [2025-03-03 23:57:25,018 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 843 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:25,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1162 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 23:57:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-03 23:57:25,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 269. [2025-03-03 23:57:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 194 states have (on average 1.3144329896907216) internal successors, (255), 197 states have internal predecessors, (255), 63 states have call successors, (63), 11 states have call predecessors, (63), 11 states have return successors, (63), 60 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-03 23:57:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 381 transitions. [2025-03-03 23:57:25,056 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 381 transitions. Word has length 153 [2025-03-03 23:57:25,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:25,057 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 381 transitions. [2025-03-03 23:57:25,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 7 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 6 states have call predecessors, (39), 7 states have call successors, (39) [2025-03-03 23:57:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 381 transitions. [2025-03-03 23:57:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 23:57:25,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:25,059 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:57:25,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 23:57:25,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 23:57:25,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:25,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1049309949, now seen corresponding path program 1 times [2025-03-03 23:57:25,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:25,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148702726] [2025-03-03 23:57:25,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:25,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 23:57:25,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 23:57:25,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:25,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 23:57:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:25,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148702726] [2025-03-03 23:57:25,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148702726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:57:25,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378703350] [2025-03-03 23:57:25,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:25,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:25,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:25,533 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-03 23:57:25,535 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-03 23:57:25,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 23:57:25,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 23:57:25,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:25,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:25,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:57:25,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-03 23:57:25,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:57:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 23:57:25,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378703350] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:57:25,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:57:25,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-03-03 23:57:25,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402418065] [2025-03-03 23:57:25,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:57:25,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 23:57:25,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:25,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 23:57:25,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-03 23:57:25,967 INFO L87 Difference]: Start difference. First operand 269 states and 381 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-03-03 23:57:26,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:26,108 INFO L93 Difference]: Finished difference Result 439 states and 615 transitions. [2025-03-03 23:57:26,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:57:26,109 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 154 [2025-03-03 23:57:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:26,111 INFO L225 Difference]: With dead ends: 439 [2025-03-03 23:57:26,111 INFO L226 Difference]: Without dead ends: 226 [2025-03-03 23:57:26,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:57:26,112 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 119 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:26,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 239 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:57:26,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-03 23:57:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 216. [2025-03-03 23:57:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 156 states have (on average 1.294871794871795) internal successors, (202), 158 states have internal predecessors, (202), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:57:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 298 transitions. [2025-03-03 23:57:26,140 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 298 transitions. Word has length 154 [2025-03-03 23:57:26,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:26,140 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 298 transitions. [2025-03-03 23:57:26,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-03-03 23:57:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 298 transitions. [2025-03-03 23:57:26,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 23:57:26,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:26,143 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:57:26,149 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-03 23:57:26,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:57:26,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:26,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1349096172, now seen corresponding path program 1 times [2025-03-03 23:57:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:26,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720437269] [2025-03-03 23:57:26,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:26,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:26,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 23:57:26,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 23:57:26,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:26,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 23:57:26,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:57:26,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720437269] [2025-03-03 23:57:26,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720437269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:26,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:26,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:57:26,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022665843] [2025-03-03 23:57:26,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:26,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:57:26,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:57:26,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:57:26,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:57:26,402 INFO L87 Difference]: Start difference. First operand 216 states and 298 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:57:26,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:26,437 INFO L93 Difference]: Finished difference Result 446 states and 625 transitions. [2025-03-03 23:57:26,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:57:26,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2025-03-03 23:57:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:26,439 INFO L225 Difference]: With dead ends: 446 [2025-03-03 23:57:26,439 INFO L226 Difference]: Without dead ends: 290 [2025-03-03 23:57:26,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:57:26,440 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 42 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:57:26,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 247 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:57:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-03 23:57:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 258. [2025-03-03 23:57:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 198 states have (on average 1.3181818181818181) internal successors, (261), 200 states have internal predecessors, (261), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 23:57:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 357 transitions. [2025-03-03 23:57:26,472 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 357 transitions. Word has length 154 [2025-03-03 23:57:26,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:26,473 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 357 transitions. [2025-03-03 23:57:26,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:57:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 357 transitions. [2025-03-03 23:57:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 23:57:26,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:26,476 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:57:26,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 23:57:26,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:26,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1415670958, now seen corresponding path program 1 times [2025-03-03 23:57:26,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:57:26,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814874274] [2025-03-03 23:57:26,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:26,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:57:26,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 23:57:26,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 23:57:26,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:26,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:57:26,547 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:57:26,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-03 23:57:26,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 23:57:26,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:26,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:57:26,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:57:26,642 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:57:26,642 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:57:26,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 23:57:26,650 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 23:57:26,738 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:57:26,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:57:26 BoogieIcfgContainer [2025-03-03 23:57:26,740 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:57:26,741 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:57:26,741 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:57:26,741 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:57:26,741 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:57:19" (3/4) ... [2025-03-03 23:57:26,743 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:57:26,743 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:57:26,744 INFO L158 Benchmark]: Toolchain (without parser) took 8574.57ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 124.3MB in the beginning and 272.9MB in the end (delta: -148.7MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2025-03-03 23:57:26,744 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:57:26,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.15ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 108.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:57:26,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.08ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 103.4MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:57:26,744 INFO L158 Benchmark]: Boogie Preprocessor took 69.50ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 94.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:57:26,744 INFO L158 Benchmark]: IcfgBuilder took 513.45ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 65.1MB in the end (delta: 29.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 23:57:26,745 INFO L158 Benchmark]: TraceAbstraction took 7726.13ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 65.1MB in the beginning and 273.0MB in the end (delta: -207.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:57:26,745 INFO L158 Benchmark]: Witness Printer took 2.60ms. Allocated memory is still 369.1MB. Free memory was 273.0MB in the beginning and 272.9MB in the end (delta: 75.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:57:26,746 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.21ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.15ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 108.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.08ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 103.4MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.50ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 94.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 513.45ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 65.1MB in the end (delta: 29.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7726.13ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 65.1MB in the beginning and 273.0MB in the end (delta: -207.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.60ms. Allocated memory is still 369.1MB. Free memory was 273.0MB in the beginning and 272.9MB in the end (delta: 75.1kB). Peak memory consumption was 8.4MB. 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 74, overapproximation of someBinaryArithmeticDOUBLEoperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 173, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 155, overapproximation of someBinaryDOUBLEComparisonOperation at line 169. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned short int var_1_5 = 34011; [L26] unsigned short int var_1_6 = 2; [L27] signed short int var_1_7 = -4; [L28] signed long int var_1_9 = -4; [L29] unsigned short int var_1_10 = 4; [L30] double var_1_12 = 1.8; [L31] double var_1_13 = 49.5; [L32] double var_1_14 = 0.0; [L33] double var_1_15 = 8.5; [L34] unsigned long int var_1_16 = 4; [L35] float var_1_17 = 3.65; [L36] unsigned char var_1_18 = 0; [L37] signed long int var_1_19 = 32; [L38] signed long int var_1_20 = 1000000000; [L39] signed long int var_1_21 = 1141305717; [L40] unsigned char var_1_22 = 50; [L41] unsigned char var_1_23 = 0; [L42] unsigned short int var_1_24 = 2; [L43] signed short int var_1_25 = -16; [L44] double var_1_26 = 15.6; [L45] double var_1_27 = 4.25; [L46] unsigned long int var_1_28 = 10; [L47] unsigned char last_1_var_1_22 = 50; VAL [isInitial=0, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=1, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L176] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=1, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L138] var_1_2 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L139] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L140] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L140] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L141] var_1_3 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L142] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L143] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L143] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L144] var_1_5 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L145] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L146] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L146] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L147] var_1_6 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_7=-4, var_1_9=-4] [L148] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_7=-4, var_1_9=-4] [L149] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L149] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L150] var_1_13 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L151] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L152] var_1_14 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L153] RET assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L154] var_1_15 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L155] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L156] var_1_18 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L157] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L158] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L158] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L159] var_1_20 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_20 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L160] RET assume_abort_if_not(var_1_20 >= 536870911) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L161] CALL assume_abort_if_not(var_1_20 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L161] RET assume_abort_if_not(var_1_20 <= 1073741823) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L162] var_1_21 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_21 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L163] RET assume_abort_if_not(var_1_21 >= 1073741822) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L164] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L164] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L165] var_1_23 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L166] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L167] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L167] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L168] var_1_26 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L169] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L170] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L170] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L171] var_1_27 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L172] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L173] CALL assume_abort_if_not(var_1_27 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L173] RET assume_abort_if_not(var_1_27 != 0.0F) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L187] RET updateVariables() [L188] CALL step() [L51] var_1_9 = (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22) [L52] unsigned char stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_2=-255, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=0] [L53] COND TRUE stepLocal_2 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3)) [L54] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=0] [L58] COND TRUE var_1_2 || var_1_3 [L59] var_1_1 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=0] [L63] COND FALSE !(var_1_22 <= (- 500)) [L68] var_1_7 = var_1_22 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L70] var_1_10 = (var_1_5 - (var_1_22 + 1000)) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L71] COND FALSE !(! var_1_3) [L74] var_1_12 = (var_1_14 - var_1_13) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L76] unsigned char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_0=254, var_1_10=31513, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L77] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_0=254, var_1_10=31513, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L80] COND TRUE ((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= stepLocal_0 [L81] var_1_16 = 128u VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L86] COND TRUE \read(var_1_18) [L87] var_1_17 = (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L99] var_1_28 = var_1_21 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L100] COND TRUE ! ((! var_1_3) && var_1_18) [L101] var_1_24 = ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L107] unsigned short int stepLocal_4 = var_1_24; [L108] unsigned short int stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L109] COND FALSE !(((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L122] unsigned char stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_1=254, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L123] COND TRUE var_1_24 >= stepLocal_1 VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L124] COND TRUE ! var_1_2 [L125] var_1_19 = (var_1_22 - (var_1_22 + (var_1_20 - 5))) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-536870906, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L188] RET step() [L189] CALL, EXPR property() [L179] EXPR (((((((((((var_1_2 || var_1_3) ? (var_1_1 == ((unsigned short int) ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_22)) < (var_1_22)) ? ((var_1_5 - var_1_22)) : (var_1_22)))))) && ((var_1_22 <= (- 500)) ? (var_1_2 ? (var_1_7 == ((signed short int) (var_1_22 - 64))) : 1) : (var_1_7 == ((signed short int) var_1_22)))) && (var_1_9 == ((signed long int) (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22)))) && (var_1_10 == ((unsigned short int) (var_1_5 - (var_1_22 + 1000))))) && ((! var_1_3) ? (var_1_12 == ((double) ((var_1_13 - (var_1_14 - 63.5)) + var_1_15))) : (var_1_12 == ((double) (var_1_14 - var_1_13))))) && (var_1_2 ? (var_1_16 == ((unsigned long int) (var_1_9 + 200u))) : ((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= var_1_22) ? (var_1_16 == ((unsigned long int) 128u)) : (var_1_16 == ((unsigned long int) var_1_22))))) && (var_1_18 ? (var_1_17 == ((float) (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13))) : (var_1_3 ? (var_1_2 ? (var_1_17 == ((float) var_1_15)) : (var_1_17 == ((float) 0.050000000000000044f))) : (var_1_17 == ((float) var_1_13))))) && ((var_1_24 >= var_1_22) ? ((! var_1_2) ? (var_1_19 == ((signed long int) (var_1_22 - (var_1_22 + (var_1_20 - 5))))) : (var_1_2 ? (var_1_18 ? (var_1_19 == ((signed long int) ((var_1_21 - ((((var_1_20) > (var_1_22)) ? (var_1_20) : (var_1_22)))) - (var_1_22 + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))) : 1) : 1)) : (var_1_19 == ((signed long int) var_1_20)))) && ((var_1_18 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3))) ? (var_1_22 == ((unsigned char) var_1_23)) : (var_1_22 == ((unsigned char) var_1_23)))) && ((! ((! var_1_3) && var_1_18)) ? (var_1_24 == ((unsigned short int) ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))))) : ((var_1_22 < ((var_1_5 - var_1_23) * 32)) ? (var_1_24 == ((unsigned short int) var_1_22)) : 1))) && ((((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) ? ((var_1_14 >= var_1_13) ? (((var_1_22 << var_1_22) <= var_1_24) ? (var_1_25 == ((signed short int) (((((var_1_22) < (var_1_16)) ? (var_1_22) : (var_1_16))) - var_1_23))) : (var_1_25 == ((signed short int) (var_1_16 + var_1_23)))) : ((var_1_5 == var_1_10) ? (var_1_25 == ((signed short int) var_1_16)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-536870906, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L179-L180] return ((((((((((((var_1_2 || var_1_3) ? (var_1_1 == ((unsigned short int) ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_22)) < (var_1_22)) ? ((var_1_5 - var_1_22)) : (var_1_22)))))) && ((var_1_22 <= (- 500)) ? (var_1_2 ? (var_1_7 == ((signed short int) (var_1_22 - 64))) : 1) : (var_1_7 == ((signed short int) var_1_22)))) && (var_1_9 == ((signed long int) (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22)))) && (var_1_10 == ((unsigned short int) (var_1_5 - (var_1_22 + 1000))))) && ((! var_1_3) ? (var_1_12 == ((double) ((var_1_13 - (var_1_14 - 63.5)) + var_1_15))) : (var_1_12 == ((double) (var_1_14 - var_1_13))))) && (var_1_2 ? (var_1_16 == ((unsigned long int) (var_1_9 + 200u))) : ((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= var_1_22) ? (var_1_16 == ((unsigned long int) 128u)) : (var_1_16 == ((unsigned long int) var_1_22))))) && (var_1_18 ? (var_1_17 == ((float) (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13))) : (var_1_3 ? (var_1_2 ? (var_1_17 == ((float) var_1_15)) : (var_1_17 == ((float) 0.050000000000000044f))) : (var_1_17 == ((float) var_1_13))))) && ((var_1_24 >= var_1_22) ? ((! var_1_2) ? (var_1_19 == ((signed long int) (var_1_22 - (var_1_22 + (var_1_20 - 5))))) : (var_1_2 ? (var_1_18 ? (var_1_19 == ((signed long int) ((var_1_21 - ((((var_1_20) > (var_1_22)) ? (var_1_20) : (var_1_22)))) - (var_1_22 + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))) : 1) : 1)) : (var_1_19 == ((signed long int) var_1_20)))) && ((var_1_18 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3))) ? (var_1_22 == ((unsigned char) var_1_23)) : (var_1_22 == ((unsigned char) var_1_23)))) && ((! ((! var_1_3) && var_1_18)) ? (var_1_24 == ((unsigned short int) ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))))) : ((var_1_22 < ((var_1_5 - var_1_23) * 32)) ? (var_1_24 == ((unsigned short int) var_1_22)) : 1))) && ((((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) ? ((var_1_14 >= var_1_13) ? (((var_1_22 << var_1_22) <= var_1_24) ? (var_1_25 == ((signed short int) (((((var_1_22) < (var_1_16)) ? (var_1_22) : (var_1_16))) - var_1_23))) : (var_1_25 == ((signed short int) (var_1_16 + var_1_23)))) : ((var_1_5 == var_1_10) ? (var_1_25 == ((signed short int) var_1_16)) : 1)) : 1)) && (var_1_28 == ((unsigned long int) var_1_21)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-536870906, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-536870906, var_1_1=254, var_1_20=536870911, var_1_21=1073741822, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=1073741822, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1176 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1157 mSDsluCounter, 2113 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1357 mSDsCounter, 483 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1741 IncrementalHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 483 mSolverCounterUnsat, 756 mSDtfsCounter, 1741 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 856 GetRequests, 765 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1553 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=269occurred in iteration=3, InterpolantAutomatonStates: 74, 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, 5 MinimizatonAttempts, 219 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1382 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1524 ConstructedInterpolants, 0 QuantifiedInterpolants, 3623 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1062 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 9818/10120 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-03 23:57:26,763 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_operatoramount_amount100_file-6.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 2d3e3fe1097eb5cc161ed209d4e6f9c5a89785e619e27e5f9e0923413431f0b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:57:28,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:57:28,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:57:28,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:57:28,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:57:28,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:57:28,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:57:28,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:57:28,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:57:28,828 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:57:28,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:57:28,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:57:28,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:57:28,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:57:28,829 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:57:28,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:57:28,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:57:28,830 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:57:28,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:57:28,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:57:28,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:57:28,830 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:57:28,830 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:57:28,831 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:57:28,831 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:57:28,831 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:57:28,831 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:57:28,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:57:28,831 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:57:28,831 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:57:28,831 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:57:28,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:57:28,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:57:28,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:57:28,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:57:28,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:57:28,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:57:28,832 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:57:28,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:57:28,832 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:57:28,833 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:57:28,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:57:28,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:57:28,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:57:28,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:57:28,833 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 -> 2d3e3fe1097eb5cc161ed209d4e6f9c5a89785e619e27e5f9e0923413431f0b1 [2025-03-03 23:57:29,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:57:29,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:57:29,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:57:29,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:57:29,087 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:57:29,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i [2025-03-03 23:57:30,288 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486064a47/5f5773dc6ea94668a6b2f16edbfb1722/FLAGfb8f431e6 [2025-03-03 23:57:30,485 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:57:30,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i [2025-03-03 23:57:30,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486064a47/5f5773dc6ea94668a6b2f16edbfb1722/FLAGfb8f431e6 [2025-03-03 23:57:30,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/486064a47/5f5773dc6ea94668a6b2f16edbfb1722 [2025-03-03 23:57:30,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:57:30,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:57:30,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:57:30,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:57:30,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:57:30,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a83ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30, skipping insertion in model container [2025-03-03 23:57:30,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:57:30,650 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_operatoramount_amount100_file-6.i[915,928] [2025-03-03 23:57:30,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:57:30,740 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:57:30,749 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_operatoramount_amount100_file-6.i[915,928] [2025-03-03 23:57:30,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:57:30,795 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:57:30,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30 WrapperNode [2025-03-03 23:57:30,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:57:30,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:57:30,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:57:30,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:57:30,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,835 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2025-03-03 23:57:30,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:57:30,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:57:30,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:57:30,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:57:30,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,857 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-03 23:57:30,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,869 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:57:30,878 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:57:30,878 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:57:30,878 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:57:30,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30" (1/1) ... [2025-03-03 23:57:30,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:57:30,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:57:30,904 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-03 23:57:30,911 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-03 23:57:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:57:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:57:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:57:30,927 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:57:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:57:30,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:57:30,982 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:57:30,984 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:57:48,716 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 23:57:48,717 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:57:48,724 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:57:48,724 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:57:48,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:57:48 BoogieIcfgContainer [2025-03-03 23:57:48,725 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:57:48,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:57:48,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:57:48,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:57:48,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:57:30" (1/3) ... [2025-03-03 23:57:48,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c671156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:57:48, skipping insertion in model container [2025-03-03 23:57:48,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:57:30" (2/3) ... [2025-03-03 23:57:48,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c671156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:57:48, skipping insertion in model container [2025-03-03 23:57:48,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:57:48" (3/3) ... [2025-03-03 23:57:48,733 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-6.i [2025-03-03 23:57:48,743 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:57:48,744 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-6.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:57:48,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:57:48,800 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;@21f2b109, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:57:48,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:57:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:57:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 23:57:48,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:48,817 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:57:48,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:48,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:48,821 INFO L85 PathProgramCache]: Analyzing trace with hash -129795985, now seen corresponding path program 1 times [2025-03-03 23:57:48,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:57:48,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259744982] [2025-03-03 23:57:48,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:48,834 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-03 23:57:48,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:57:48,837 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-03 23:57:48,839 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-03 23:57:48,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 23:57:49,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 23:57:49,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:49,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:49,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:57:49,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-03 23:57:49,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:57:49,955 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:57:49,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259744982] [2025-03-03 23:57:49,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259744982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:49,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:49,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:57:49,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885944795] [2025-03-03 23:57:49,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:49,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:57:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:57:49,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:57:49,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:57:49,976 INFO L87 Difference]: Start difference. First operand has 79 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:57:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:57:50,000 INFO L93 Difference]: Finished difference Result 151 states and 262 transitions. [2025-03-03 23:57:50,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:57:50,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2025-03-03 23:57:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:57:50,007 INFO L225 Difference]: With dead ends: 151 [2025-03-03 23:57:50,007 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 23:57:50,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:57:50,013 INFO L435 NwaCegarLoop]: 115 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, 115 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-03 23:57:50,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:57:50,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 23:57:50,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-03 23:57:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:57:50,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2025-03-03 23:57:50,053 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 151 [2025-03-03 23:57:50,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:57:50,054 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2025-03-03 23:57:50,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:57:50,054 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2025-03-03 23:57:50,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 23:57:50,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:57:50,058 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:57:50,087 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-03 23:57:50,258 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-03 23:57:50,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:57:50,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:57:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1968097460, now seen corresponding path program 1 times [2025-03-03 23:57:50,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:57:50,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053299105] [2025-03-03 23:57:50,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:57:50,260 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-03 23:57:50,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:57:50,262 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-03 23:57:50,263 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-03 23:57:50,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 23:57:51,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 23:57:51,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:57:51,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:57:51,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 23:57:51,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:57:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 23:57:51,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:57:51,721 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:57:51,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053299105] [2025-03-03 23:57:51,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053299105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:57:51,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:57:51,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:57:51,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857724523] [2025-03-03 23:57:51,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:57:51,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 23:57:51,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:57:51,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 23:57:51,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:57:51,723 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:57:53,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:57:55,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:58:00,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:58:04,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:58:08,580 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-03 23:58:12,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:58:16,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:58:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:58:17,107 INFO L93 Difference]: Finished difference Result 209 states and 314 transitions. [2025-03-03 23:58:17,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:58:17,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2025-03-03 23:58:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:58:17,110 INFO L225 Difference]: With dead ends: 209 [2025-03-03 23:58:17,110 INFO L226 Difference]: Without dead ends: 137 [2025-03-03 23:58:17,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 23:58:17,111 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 105 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:58:17,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 279 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 25.4s Time] [2025-03-03 23:58:17,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-03 23:58:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2025-03-03 23:58:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:58:17,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 180 transitions. [2025-03-03 23:58:17,143 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 180 transitions. Word has length 151 [2025-03-03 23:58:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:58:17,144 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 180 transitions. [2025-03-03 23:58:17,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:58:17,144 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 180 transitions. [2025-03-03 23:58:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 23:58:17,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:58:17,148 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 23:58:17,178 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-03 23:58:17,348 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-03 23:58:17,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:58:17,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:58:17,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1821311211, now seen corresponding path program 1 times [2025-03-03 23:58:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:58:17,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125124283] [2025-03-03 23:58:17,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:17,350 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-03 23:58:17,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:58:17,352 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-03 23:58:17,354 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-03 23:58:17,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 23:58:18,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 23:58:18,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:18,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:18,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 23:58:18,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-03 23:58:22,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:58:26,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:58:26,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125124283] [2025-03-03 23:58:26,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125124283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:58:26,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1760147016] [2025-03-03 23:58:26,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:58:26,494 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 23:58:26,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 23:58:26,519 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 23:58:26,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-03 23:58:26,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 23:58:29,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 23:58:29,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:58:29,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:58:29,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 23:58:29,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:58:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-03 23:58:32,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:58:33,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1760147016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:58:33,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:58:33,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2025-03-03 23:58:33,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093505831] [2025-03-03 23:58:33,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:58:33,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:58:33,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:58:33,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:58:33,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:58:33,858 INFO L87 Difference]: Start difference. First operand 119 states and 180 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:58:46,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:58:51,009 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-03 23:58:55,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]