./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.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 3452d43faab40597a0b43ba1622139d82627c4d75f29678e42763287f2e5defc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:19:23,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:19:23,804 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:19:23,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:19:23,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:19:23,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:19:23,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:19:23,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:19:23,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:19:23,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:19:23,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:19:23,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:19:23,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:19:23,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:19:23,840 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:19:23,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:19:23,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:19:23,841 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:19:23,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:19:23,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:19:23,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:19:23,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:19:23,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:19:23,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:19:23,844 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:19:23,844 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:19:23,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:19:23,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:19:23,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:19:23,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:19:23,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:19:23,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:19:23,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:23,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:19:23,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:19:23,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:19:23,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:19:23,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:19:23,849 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:19:23,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:19:23,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:19:23,850 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:19:23,850 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 3452d43faab40597a0b43ba1622139d82627c4d75f29678e42763287f2e5defc [2024-11-09 00:19:24,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:19:24,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:19:24,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:19:24,200 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:19:24,200 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:19:24,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.i [2024-11-09 00:19:25,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:19:26,111 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:19:26,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.i [2024-11-09 00:19:26,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d3724ad/2b356049143b4f26ba7fe82f2afd1b9c/FLAGca4d1e25d [2024-11-09 00:19:26,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54d3724ad/2b356049143b4f26ba7fe82f2afd1b9c [2024-11-09 00:19:26,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:19:26,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:19:26,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:26,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:19:26,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:19:26,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7630616e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26, skipping insertion in model container [2024-11-09 00:19:26,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:19:26,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.i[915,928] [2024-11-09 00:19:26,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:26,504 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:19:26,521 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.i[915,928] [2024-11-09 00:19:26,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:26,639 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:19:26,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26 WrapperNode [2024-11-09 00:19:26,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:26,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:26,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:19:26,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:19:26,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,718 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-11-09 00:19:26,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:26,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:19:26,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:19:26,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:19:26,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,766 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]. [2024-11-09 00:19:26,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,786 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:19:26,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:19:26,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:19:26,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:19:26,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:26,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:26,861 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) [2024-11-09 00:19:26,865 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 [2024-11-09 00:19:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:19:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:19:26,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:19:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:19:26,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:19:26,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:19:26,987 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:19:26,990 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:19:27,439 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-09 00:19:27,439 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:19:27,460 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:19:27,461 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:19:27,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:27 BoogieIcfgContainer [2024-11-09 00:19:27,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:19:27,466 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:19:27,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:19:27,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:19:27,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:19:26" (1/3) ... [2024-11-09 00:19:27,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12668192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:27, skipping insertion in model container [2024-11-09 00:19:27,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (2/3) ... [2024-11-09 00:19:27,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12668192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:27, skipping insertion in model container [2024-11-09 00:19:27,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:27" (3/3) ... [2024-11-09 00:19:27,476 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-88.i [2024-11-09 00:19:27,497 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:19:27,497 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:19:27,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:19:27,571 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;@10b5186b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:19:27,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:19:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:19:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 00:19:27,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:27,594 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:19:27,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:27,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:27,599 INFO L85 PathProgramCache]: Analyzing trace with hash 879764411, now seen corresponding path program 1 times [2024-11-09 00:19:27,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:27,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734111942] [2024-11-09 00:19:27,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:27,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:19:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:19:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:19:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 00:19:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 00:19:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 00:19:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 00:19:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 00:19:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:19:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:19:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:19:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:19:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:19:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:19:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:19:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:19:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:19:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:19:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:19:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:19:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:19:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:19:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:19:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:19:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:19:28,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:19:28,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734111942] [2024-11-09 00:19:28,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734111942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:19:28,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:19:28,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:19:28,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840011353] [2024-11-09 00:19:28,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:19:28,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:19:28,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:19:28,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:19:28,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:19:28,198 INFO L87 Difference]: Start difference. First operand has 87 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:19:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:28,266 INFO L93 Difference]: Finished difference Result 167 states and 282 transitions. [2024-11-09 00:19:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:19:28,269 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2024-11-09 00:19:28,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:28,280 INFO L225 Difference]: With dead ends: 167 [2024-11-09 00:19:28,281 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 00:19:28,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:19:28,294 INFO L432 NwaCegarLoop]: 125 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, 125 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 [2024-11-09 00:19:28,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:19:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 00:19:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 00:19:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:19:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2024-11-09 00:19:28,341 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 157 [2024-11-09 00:19:28,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:28,342 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2024-11-09 00:19:28,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:19:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2024-11-09 00:19:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 00:19:28,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:28,348 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:19:28,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:19:28,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:28,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:28,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1521909649, now seen corresponding path program 1 times [2024-11-09 00:19:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:28,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654169688] [2024-11-09 00:19:28,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:28,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:19:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:19:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:19:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 00:19:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 00:19:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 00:19:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 00:19:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 00:19:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:19:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:19:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:19:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:19:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:19:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:19:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:19:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:19:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:19:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:19:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:19:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:19:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:19:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:19:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:19:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:19:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-09 00:19:29,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:19:29,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654169688] [2024-11-09 00:19:29,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654169688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:19:29,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707913757] [2024-11-09 00:19:29,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:29,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:19:29,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:29,481 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) [2024-11-09 00:19:29,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:19:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:29,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 00:19:29,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:19:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-09 00:19:30,002 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:19:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-09 00:19:30,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707913757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:19:30,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:19:30,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-09 00:19:30,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109824206] [2024-11-09 00:19:30,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:19:30,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:19:30,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:19:30,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:19:30,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:19:30,373 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-09 00:19:30,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:30,726 INFO L93 Difference]: Finished difference Result 171 states and 254 transitions. [2024-11-09 00:19:30,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 00:19:30,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 157 [2024-11-09 00:19:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:30,733 INFO L225 Difference]: With dead ends: 171 [2024-11-09 00:19:30,735 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 00:19:30,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 356 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-09 00:19:30,738 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 113 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 00:19:30,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 397 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 00:19:30,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 00:19:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-09 00:19:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:19:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 127 transitions. [2024-11-09 00:19:30,769 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 127 transitions. Word has length 157 [2024-11-09 00:19:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:30,770 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 127 transitions. [2024-11-09 00:19:30,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-09 00:19:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2024-11-09 00:19:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 00:19:30,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:30,779 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:19:30,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 00:19:30,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:19:30,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:30,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:30,981 INFO L85 PathProgramCache]: Analyzing trace with hash 253097713, now seen corresponding path program 1 times [2024-11-09 00:19:30,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:30,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594769408] [2024-11-09 00:19:30,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:30,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:19:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:19:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:19:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 00:19:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 00:19:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 00:19:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 00:19:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-09 00:19:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:19:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:19:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:19:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:19:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:19:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:19:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:19:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:19:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:19:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:19:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:19:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:19:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:19:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:19:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:19:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:19:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 162 proven. 27 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2024-11-09 00:19:32,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:19:32,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594769408] [2024-11-09 00:19:32,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594769408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:19:32,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596273048] [2024-11-09 00:19:32,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:32,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:19:32,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:32,250 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) [2024-11-09 00:19:32,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:19:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:32,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 00:19:32,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:19:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 510 proven. 27 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2024-11-09 00:19:33,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:19:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 162 proven. 36 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-09 00:19:34,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596273048] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:19:34,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:19:34,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 33 [2024-11-09 00:19:34,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449557956] [2024-11-09 00:19:34,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:19:34,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 00:19:34,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:19:34,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 00:19:34,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=849, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 00:19:34,206 INFO L87 Difference]: Start difference. First operand 87 states and 127 transitions. Second operand has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 9 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2024-11-09 00:19:37,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:37,386 INFO L93 Difference]: Finished difference Result 478 states and 674 transitions. [2024-11-09 00:19:37,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 00:19:37,387 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 9 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) Word has length 157 [2024-11-09 00:19:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:37,396 INFO L225 Difference]: With dead ends: 478 [2024-11-09 00:19:37,399 INFO L226 Difference]: Without dead ends: 394 [2024-11-09 00:19:37,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=847, Invalid=2575, Unknown=0, NotChecked=0, Total=3422 [2024-11-09 00:19:37,402 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 856 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:19:37,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1142 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 00:19:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-09 00:19:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 160. [2024-11-09 00:19:37,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 112 states have (on average 1.2767857142857142) internal successors, (143), 113 states have internal predecessors, (143), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 00:19:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 223 transitions. [2024-11-09 00:19:37,457 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 223 transitions. Word has length 157 [2024-11-09 00:19:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:37,458 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 223 transitions. [2024-11-09 00:19:37,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.727272727272727) internal successors, (90), 33 states have internal predecessors, (90), 9 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (37), 9 states have call predecessors, (37), 9 states have call successors, (37) [2024-11-09 00:19:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 223 transitions. [2024-11-09 00:19:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 00:19:37,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:37,464 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:19:37,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:19:37,665 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 [2024-11-09 00:19:37,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:37,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:37,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1026765965, now seen corresponding path program 1 times [2024-11-09 00:19:37,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:37,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696370379] [2024-11-09 00:19:37,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:37,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:19:37,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [772514870] [2024-11-09 00:19:37,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:37,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:19:37,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:37,724 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) [2024-11-09 00:19:37,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 00:19:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:19:37,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:19:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:19:38,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:19:38,007 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:19:38,009 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:19:38,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 00:19:38,211 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 [2024-11-09 00:19:38,215 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 00:19:38,347 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:19:38,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:19:38 BoogieIcfgContainer [2024-11-09 00:19:38,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:19:38,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:19:38,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:19:38,353 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:19:38,353 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:27" (3/4) ... [2024-11-09 00:19:38,356 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:19:38,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:19:38,358 INFO L158 Benchmark]: Toolchain (without parser) took 12208.35ms. Allocated memory was 182.5MB in the beginning and 310.4MB in the end (delta: 127.9MB). Free memory was 114.9MB in the beginning and 183.4MB in the end (delta: -68.6MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2024-11-09 00:19:38,358 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 100.7MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:19:38,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.65ms. Allocated memory is still 182.5MB. Free memory was 114.7MB in the beginning and 155.0MB in the end (delta: -40.3MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-09 00:19:38,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.55ms. Allocated memory is still 182.5MB. Free memory was 155.0MB in the beginning and 150.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:19:38,361 INFO L158 Benchmark]: Boogie Preprocessor took 100.76ms. Allocated memory is still 182.5MB. Free memory was 150.5MB in the beginning and 144.8MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:19:38,361 INFO L158 Benchmark]: RCFGBuilder took 642.31ms. Allocated memory is still 182.5MB. Free memory was 144.8MB in the beginning and 119.0MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 00:19:38,361 INFO L158 Benchmark]: TraceAbstraction took 10886.38ms. Allocated memory was 182.5MB in the beginning and 310.4MB in the end (delta: 127.9MB). Free memory was 118.3MB in the beginning and 183.4MB in the end (delta: -65.1MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2024-11-09 00:19:38,363 INFO L158 Benchmark]: Witness Printer took 4.83ms. Allocated memory is still 310.4MB. Free memory is still 183.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:19:38,364 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.24ms. Allocated memory is still 100.7MB. Free memory is still 63.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.65ms. Allocated memory is still 182.5MB. Free memory was 114.7MB in the beginning and 155.0MB in the end (delta: -40.3MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.55ms. Allocated memory is still 182.5MB. Free memory was 155.0MB in the beginning and 150.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.76ms. Allocated memory is still 182.5MB. Free memory was 150.5MB in the beginning and 144.8MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 642.31ms. Allocated memory is still 182.5MB. Free memory was 144.8MB in the beginning and 119.0MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10886.38ms. Allocated memory was 182.5MB in the beginning and 310.4MB in the end (delta: 127.9MB). Free memory was 118.3MB in the beginning and 183.4MB in the end (delta: -65.1MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. * Witness Printer took 4.83ms. Allocated memory is still 310.4MB. Free memory is still 183.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryDOUBLEComparisonOperation at line 143. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] float var_1_2 = 9.5; [L24] float var_1_4 = 127.6; [L25] double var_1_5 = 100000000000000.5; [L26] double var_1_6 = 100000000000000.7; [L27] double var_1_7 = 256.75; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_9 = 1; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] signed char var_1_12 = 0; [L33] signed char var_1_13 = 2; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_16 = 10; [L36] unsigned char var_1_18 = 4; [L37] unsigned char var_1_19 = 8; [L38] unsigned char var_1_20 = 8; [L39] unsigned short int var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned short int var_1_24 = 34649; [L42] unsigned char last_1_var_1_8 = 0; [L43] unsigned short int last_1_var_1_21 = 128; [L44] unsigned char last_1_var_1_22 = 0; VAL [isInitial=0, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_2=19/2, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L147] isInitial = 1 [L148] FCALL initially() [L149] COND TRUE 1 [L150] CALL updateLastVariables() [L138] last_1_var_1_8 = var_1_8 [L139] last_1_var_1_21 = var_1_21 [L140] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_2=19/2, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L150] RET updateLastVariables() [L151] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L100] var_1_4 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L101] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L103] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L104] var_1_6 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L105] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L106] var_1_7 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L107] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L108] var_1_9 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L109] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L110] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L110] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L113] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L113] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L114] var_1_11 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L115] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L116] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L116] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L117] var_1_13 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L118] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L119] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L119] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L120] var_1_16 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L121] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L122] CALL assume_abort_if_not(var_1_16 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L122] RET assume_abort_if_not(var_1_16 <= 255) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L123] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L123] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L124] var_1_18 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L125] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L126] CALL assume_abort_if_not(var_1_18 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L126] RET assume_abort_if_not(var_1_18 <= 64) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L127] var_1_19 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L128] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L129] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L129] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L130] var_1_20 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L131] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L132] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L132] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=-255] [L133] var_1_24 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_24 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L134] RET assume_abort_if_not(var_1_24 >= 32767) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L135] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L135] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L151] RET updateVariables() [L152] CALL step() [L48] COND FALSE !(64.5f <= var_1_2) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L59] COND FALSE !(var_1_1 > ((var_1_1 * var_1_5) + 5.3)) [L66] var_1_8 = var_1_11 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L68] signed long int stepLocal_0 = (last_1_var_1_22 / var_1_16) * last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=1, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L69] COND FALSE !(last_1_var_1_21 < stepLocal_0) [L72] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L74] EXPR var_1_18 << var_1_14 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L74] signed long int stepLocal_3 = var_1_18 << var_1_14; [L75] EXPR var_1_14 | var_1_18 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L75] signed long int stepLocal_2 = (var_1_14 | var_1_18) / (var_1_24 - 1); [L76] COND FALSE !(var_1_19 == stepLocal_3) [L83] var_1_22 = 64 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L85] COND FALSE !(((- var_1_1) / 24.75) < var_1_6) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L92] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L93] COND FALSE !(var_1_8 && stepLocal_1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L152] RET step() [L153] CALL, EXPR property() [L143] EXPR ((((((64.5f <= var_1_2) ? (last_1_var_1_8 ? ((var_1_2 == var_1_4) ? (var_1_1 == ((double) (var_1_5 + ((((((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) < (50.25)) ? (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) : (50.25)))))) : (var_1_1 == ((double) var_1_7))) : (var_1_1 == ((double) var_1_5))) : 1) && ((var_1_1 > ((var_1_1 * var_1_5) + 5.3)) ? (((var_1_7 + var_1_1) < var_1_6) ? (var_1_8 == ((unsigned char) var_1_9)) : (var_1_8 == ((unsigned char) var_1_10))) : (var_1_8 == ((unsigned char) var_1_11)))) && ((((- var_1_1) / 24.75) < var_1_6) ? ((var_1_7 >= var_1_1) ? (var_1_12 == ((signed char) var_1_13)) : (var_1_12 == ((signed char) var_1_13))) : 1)) && ((last_1_var_1_21 < ((last_1_var_1_22 / var_1_16) * last_1_var_1_21)) ? (var_1_14 == ((unsigned char) ((var_1_18 + var_1_19) + var_1_20))) : (var_1_14 == ((unsigned char) var_1_18)))) && ((var_1_8 && var_1_10) ? (var_1_21 == ((unsigned short int) ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (2)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (2))))) : 1)) && ((var_1_19 == (var_1_18 << var_1_14)) ? ((last_1_var_1_22 >= ((var_1_14 | var_1_18) / (var_1_24 - 1))) ? (var_1_22 == ((unsigned char) 2)) : (var_1_22 == ((unsigned char) var_1_20))) : (var_1_22 == ((unsigned char) 64))) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L143-L144] return ((((((64.5f <= var_1_2) ? (last_1_var_1_8 ? ((var_1_2 == var_1_4) ? (var_1_1 == ((double) (var_1_5 + ((((((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) < (50.25)) ? (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) : (50.25)))))) : (var_1_1 == ((double) var_1_7))) : (var_1_1 == ((double) var_1_5))) : 1) && ((var_1_1 > ((var_1_1 * var_1_5) + 5.3)) ? (((var_1_7 + var_1_1) < var_1_6) ? (var_1_8 == ((unsigned char) var_1_9)) : (var_1_8 == ((unsigned char) var_1_10))) : (var_1_8 == ((unsigned char) var_1_11)))) && ((((- var_1_1) / 24.75) < var_1_6) ? ((var_1_7 >= var_1_1) ? (var_1_12 == ((signed char) var_1_13)) : (var_1_12 == ((signed char) var_1_13))) : 1)) && ((last_1_var_1_21 < ((last_1_var_1_22 / var_1_16) * last_1_var_1_21)) ? (var_1_14 == ((unsigned char) ((var_1_18 + var_1_19) + var_1_20))) : (var_1_14 == ((unsigned char) var_1_18)))) && ((var_1_8 && var_1_10) ? (var_1_21 == ((unsigned short int) ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (2)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (2))))) : 1)) && ((var_1_19 == (var_1_18 << var_1_14)) ? ((last_1_var_1_22 >= ((var_1_14 | var_1_18) / (var_1_24 - 1))) ? (var_1_22 == ((unsigned char) 2)) : (var_1_22 == ((unsigned char) var_1_20))) : (var_1_22 == ((unsigned char) 64))) ; [L153] RET, EXPR property() [L153] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=-32769, var_1_8=0, var_1_9=-255] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-1, var_1_14=0, var_1_16=1, var_1_18=0, var_1_19=1, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=-32769, var_1_8=0, var_1_9=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 4, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 992 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 969 mSDsluCounter, 1664 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1268 mSDsCounter, 721 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1910 IncrementalHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 721 mSolverCounterUnsat, 396 mSDtfsCounter, 1910 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 847 GetRequests, 777 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=3, InterpolantAutomatonStates: 49, 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, 3 MinimizatonAttempts, 238 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1099 NumberOfCodeBlocks, 1099 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1092 ConstructedInterpolants, 0 QuantifiedInterpolants, 3258 SizeOfPredicates, 8 NumberOfNonLiveVariables, 705 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 7503/7728 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:19:38,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.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 3452d43faab40597a0b43ba1622139d82627c4d75f29678e42763287f2e5defc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:19:40,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:19:40,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:19:40,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:19:40,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:19:41,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:19:41,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:19:41,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:19:41,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:19:41,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:19:41,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:19:41,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:19:41,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:19:41,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:19:41,031 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:19:41,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:19:41,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:19:41,032 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:19:41,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:19:41,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:19:41,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:19:41,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:19:41,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:19:41,036 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:19:41,036 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:19:41,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:19:41,037 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:19:41,037 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:19:41,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:19:41,038 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:19:41,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:19:41,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:19:41,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:19:41,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:19:41,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:41,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:19:41,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:19:41,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:19:41,043 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:19:41,044 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:19:41,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:19:41,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:19:41,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:19:41,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:19:41,046 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 3452d43faab40597a0b43ba1622139d82627c4d75f29678e42763287f2e5defc [2024-11-09 00:19:41,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:19:41,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:19:41,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:19:41,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:19:41,399 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:19:41,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.i [2024-11-09 00:19:43,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:19:43,419 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:19:43,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.i [2024-11-09 00:19:43,447 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28bb1534d/dae4a01f07984b5fab57bbe248e886dc/FLAGb28ce9daa [2024-11-09 00:19:43,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28bb1534d/dae4a01f07984b5fab57bbe248e886dc [2024-11-09 00:19:43,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:19:43,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:19:43,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:43,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:19:43,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:19:43,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:43" (1/1) ... [2024-11-09 00:19:43,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fad52b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:43, skipping insertion in model container [2024-11-09 00:19:43,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:43" (1/1) ... [2024-11-09 00:19:43,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:19:44,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.i[915,928] [2024-11-09 00:19:44,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:44,129 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:19:44,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-88.i[915,928] [2024-11-09 00:19:44,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:44,210 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:19:44,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44 WrapperNode [2024-11-09 00:19:44,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:44,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:44,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:19:44,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:19:44,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 00:19:44,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 00:19:44,269 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2024-11-09 00:19:44,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:44,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:19:44,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:19:44,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:19:44,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 00:19:44,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 00:19:44,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 00:19:44,329 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]. [2024-11-09 00:19:44,330 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 00:19:44,330 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 00:19:44,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 00:19:44,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 00:19:44,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 00:19:44,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 00:19:44,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:19:44,371 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:19:44,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:19:44,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:19:44,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (1/1) ... [2024-11-09 00:19:44,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:44,423 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) [2024-11-09 00:19:44,429 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 [2024-11-09 00:19:44,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:19:44,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:19:44,482 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:19:44,482 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:19:44,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:19:44,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:19:44,581 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:19:44,584 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:19:58,825 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-09 00:19:58,826 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:19:58,842 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:19:58,842 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:19:58,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:58 BoogieIcfgContainer [2024-11-09 00:19:58,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:19:58,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:19:58,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:19:58,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:19:58,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:19:43" (1/3) ... [2024-11-09 00:19:58,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62023268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:58, skipping insertion in model container [2024-11-09 00:19:58,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:44" (2/3) ... [2024-11-09 00:19:58,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62023268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:58, skipping insertion in model container [2024-11-09 00:19:58,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:58" (3/3) ... [2024-11-09 00:19:58,854 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-88.i [2024-11-09 00:19:58,872 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:19:58,873 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:19:58,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:19:58,948 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;@1acad11a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:19:58,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:19:58,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:19:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:19:58,967 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:58,968 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:19:58,968 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:58,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:58,973 INFO L85 PathProgramCache]: Analyzing trace with hash -798053550, now seen corresponding path program 1 times [2024-11-09 00:19:58,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:19:58,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967460386] [2024-11-09 00:19:58,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:58,987 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 [2024-11-09 00:19:58,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:19:58,989 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) [2024-11-09 00:19:58,990 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 [2024-11-09 00:19:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:59,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:19:59,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:19:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-09 00:19:59,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:19:59,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:19:59,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967460386] [2024-11-09 00:19:59,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967460386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:19:59,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:19:59,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:19:59,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494635542] [2024-11-09 00:19:59,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:19:59,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:19:59,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:19:59,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:19:59,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:19:59,956 INFO L87 Difference]: Start difference. First operand has 71 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:20:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:20:00,008 INFO L93 Difference]: Finished difference Result 135 states and 234 transitions. [2024-11-09 00:20:00,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:20:00,011 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 152 [2024-11-09 00:20:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:20:00,022 INFO L225 Difference]: With dead ends: 135 [2024-11-09 00:20:00,023 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 00:20:00,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:20:00,036 INFO L432 NwaCegarLoop]: 101 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, 101 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 [2024-11-09 00:20:00,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:20:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 00:20:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-09 00:20:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:20:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-11-09 00:20:00,087 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 152 [2024-11-09 00:20:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:20:00,088 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-11-09 00:20:00,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-09 00:20:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-11-09 00:20:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:20:00,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:20:00,092 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:20:00,116 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 [2024-11-09 00:20:00,293 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 [2024-11-09 00:20:00,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:20:00,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:20:00,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1278422558, now seen corresponding path program 1 times [2024-11-09 00:20:00,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:20:00,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267504746] [2024-11-09 00:20:00,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:20:00,296 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 [2024-11-09 00:20:00,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:20:00,299 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) [2024-11-09 00:20:00,300 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 [2024-11-09 00:20:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:01,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 00:20:01,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:20:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-09 00:20:03,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:20:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-09 00:20:06,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:20:06,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267504746] [2024-11-09 00:20:06,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267504746] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:20:06,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:20:06,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-09 00:20:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837309067] [2024-11-09 00:20:06,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:20:06,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 00:20:06,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:20:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 00:20:06,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:20:06,554 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-09 00:20:13,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:20:17,642 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 [] [2024-11-09 00:20:21,649 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 [] [2024-11-09 00:20:25,658 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 [] [2024-11-09 00:20:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:20:25,662 INFO L93 Difference]: Finished difference Result 139 states and 206 transitions. [2024-11-09 00:20:25,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 00:20:25,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 152 [2024-11-09 00:20:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:20:25,798 INFO L225 Difference]: With dead ends: 139 [2024-11-09 00:20:25,798 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 00:20:25,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-09 00:20:25,800 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 40 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2024-11-09 00:20:25,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 233 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 4 Unknown, 0 Unchecked, 18.5s Time] [2024-11-09 00:20:25,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 00:20:25,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-11-09 00:20:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:20:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2024-11-09 00:20:25,815 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 152 [2024-11-09 00:20:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:20:25,816 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2024-11-09 00:20:25,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-09 00:20:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2024-11-09 00:20:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:20:25,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:20:25,819 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:20:25,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 00:20:26,019 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 [2024-11-09 00:20:26,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:20:26,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:20:26,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1280269600, now seen corresponding path program 1 times [2024-11-09 00:20:26,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:20:26,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848500042] [2024-11-09 00:20:26,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:20:26,022 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 [2024-11-09 00:20:26,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:20:26,024 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) [2024-11-09 00:20:26,025 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 [2024-11-09 00:20:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:20:26,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 00:20:26,875 INFO L278 TraceCheckSpWp]: Computing forward predicates...