./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_100-while_file-98.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 c9772336b4f5bbc4418fabef46aa66f1fadeb5e29c51f3493f820d65f03963e5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:21:01,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:21:01,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:21:01,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:21:01,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:21:01,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:21:01,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:21:01,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:21:01,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:21:01,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:21:01,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:21:01,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:21:01,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:21:01,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:21:01,560 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:21:01,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:21:01,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:21:01,562 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:21:01,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:21:01,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:21:01,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:21:01,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:21:01,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:21:01,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:21:01,574 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:21:01,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:21:01,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:21:01,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:21:01,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:21:01,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:21:01,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:21:01,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:21:01,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:21:01,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:21:01,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:21:01,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:21:01,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:21:01,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:21:01,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:21:01,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:21:01,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:21:01,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:21:01,579 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 -> c9772336b4f5bbc4418fabef46aa66f1fadeb5e29c51f3493f820d65f03963e5 [2024-11-10 07:21:01,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:21:01,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:21:01,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:21:01,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:21:01,863 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:21:01,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-98.i [2024-11-10 07:21:03,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:21:03,587 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:21:03,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-98.i [2024-11-10 07:21:03,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4297af81c/e5d106aa8a4b4b0092b193683a5fab56/FLAGc0610c3e5 [2024-11-10 07:21:03,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4297af81c/e5d106aa8a4b4b0092b193683a5fab56 [2024-11-10 07:21:03,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:21:03,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:21:03,630 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:21:03,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:21:03,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:21:03,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:21:03" (1/1) ... [2024-11-10 07:21:03,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2872cab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:03, skipping insertion in model container [2024-11-10 07:21:03,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:21:03" (1/1) ... [2024-11-10 07:21:03,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:21:03,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-98.i[916,929] [2024-11-10 07:21:03,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:21:03,972 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:21:03,985 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-98.i[916,929] [2024-11-10 07:21:04,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:21:04,049 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:21:04,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04 WrapperNode [2024-11-10 07:21:04,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:21:04,051 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:21:04,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:21:04,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:21:04,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04" (1/1) ... [2024-11-10 07:21:04,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04" (1/1) ... [2024-11-10 07:21:04,106 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-10 07:21:04,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:21:04,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:21:04,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:21:04,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:21:04,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04" (1/1) ... [2024-11-10 07:21:04,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04" (1/1) ... [2024-11-10 07:21:04,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04" (1/1) ... [2024-11-10 07:21:04,140 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-10 07:21:04,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04" (1/1) ... [2024-11-10 07:21:04,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04" (1/1) ... [2024-11-10 07:21:04,153 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04" (1/1) ... [2024-11-10 07:21:04,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04" (1/1) ... [2024-11-10 07:21:04,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04" (1/1) ... [2024-11-10 07:21:04,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04" (1/1) ... [2024-11-10 07:21:04,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:21:04,168 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:21:04,168 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:21:04,168 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:21:04,169 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04" (1/1) ... [2024-11-10 07:21:04,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:21:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:21:04,215 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-10 07:21:04,219 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-10 07:21:04,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:21:04,268 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:21:04,269 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:21:04,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:21:04,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:21:04,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:21:04,362 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:21:04,365 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:21:04,761 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 07:21:04,762 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:21:04,785 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:21:04,786 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:21:04,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:21:04 BoogieIcfgContainer [2024-11-10 07:21:04,786 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:21:04,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:21:04,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:21:04,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:21:04,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:21:03" (1/3) ... [2024-11-10 07:21:04,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d17c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:21:04, skipping insertion in model container [2024-11-10 07:21:04,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:04" (2/3) ... [2024-11-10 07:21:04,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d17c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:21:04, skipping insertion in model container [2024-11-10 07:21:04,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:21:04" (3/3) ... [2024-11-10 07:21:04,801 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-98.i [2024-11-10 07:21:04,818 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:21:04,819 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:21:04,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:21:04,892 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;@1a4af57d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:21:04,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:21:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:21:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 07:21:04,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:21:04,912 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:21:04,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:21:04,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:21:04,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1301740663, now seen corresponding path program 1 times [2024-11-10 07:21:04,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:21:04,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578529928] [2024-11-10 07:21:04,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:04,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:21:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:21:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:21:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:21:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:21:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:21:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:21:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:21:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:21:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:21:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:21:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:21:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:21:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:21:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:21:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:21:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:21:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:21:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:21:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:21:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:21:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:21:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:21:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:21:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 07:21:05,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:21:05,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578529928] [2024-11-10 07:21:05,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578529928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:21:05,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:21:05,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:21:05,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134043917] [2024-11-10 07:21:05,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:21:05,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:21:05,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:21:05,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:21:05,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:21:05,518 INFO L87 Difference]: Start difference. First operand has 80 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:21:05,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:21:05,553 INFO L93 Difference]: Finished difference Result 152 states and 260 transitions. [2024-11-10 07:21:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:21:05,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 154 [2024-11-10 07:21:05,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:21:05,565 INFO L225 Difference]: With dead ends: 152 [2024-11-10 07:21:05,565 INFO L226 Difference]: Without dead ends: 75 [2024-11-10 07:21:05,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-10 07:21:05,575 INFO L432 NwaCegarLoop]: 114 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, 114 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-10 07:21:05,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:21:05,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-10 07:21:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-10 07:21:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:21:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 114 transitions. [2024-11-10 07:21:05,628 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 114 transitions. Word has length 154 [2024-11-10 07:21:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:21:05,629 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 114 transitions. [2024-11-10 07:21:05,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:21:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 114 transitions. [2024-11-10 07:21:05,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 07:21:05,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:21:05,636 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:21:05,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:21:05,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:21:05,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:21:05,638 INFO L85 PathProgramCache]: Analyzing trace with hash -831052144, now seen corresponding path program 1 times [2024-11-10 07:21:05,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:21:05,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695035318] [2024-11-10 07:21:05,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:21:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:21:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:21:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:21:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:21:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:21:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:21:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:21:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:21:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:21:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:21:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:21:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:21:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:21:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:21:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:05,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:21:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:06,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:21:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:06,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:21:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:06,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:21:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:06,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:21:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:06,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:21:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:06,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:21:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:06,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:21:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:06,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:21:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 07:21:06,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:21:06,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695035318] [2024-11-10 07:21:06,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695035318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:21:06,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:21:06,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:21:06,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421960598] [2024-11-10 07:21:06,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:21:06,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:21:06,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:21:06,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:21:06,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:21:06,058 INFO L87 Difference]: Start difference. First operand 75 states and 114 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 07:21:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:21:06,155 INFO L93 Difference]: Finished difference Result 217 states and 332 transitions. [2024-11-10 07:21:06,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:21:06,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2024-11-10 07:21:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:21:06,159 INFO L225 Difference]: With dead ends: 217 [2024-11-10 07:21:06,159 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 07:21:06,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:21:06,161 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 101 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:21:06,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 298 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:21:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 07:21:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2024-11-10 07:21:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 07:21:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 216 transitions. [2024-11-10 07:21:06,193 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 216 transitions. Word has length 154 [2024-11-10 07:21:06,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:21:06,194 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 216 transitions. [2024-11-10 07:21:06,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 07:21:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 216 transitions. [2024-11-10 07:21:06,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 07:21:06,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:21:06,197 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:21:06,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:21:06,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:21:06,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:21:06,198 INFO L85 PathProgramCache]: Analyzing trace with hash 911758191, now seen corresponding path program 1 times [2024-11-10 07:21:06,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:21:06,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118189520] [2024-11-10 07:21:06,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:06,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:21:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:21:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:21:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:21:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:21:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:21:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:21:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:21:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:21:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:21:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:21:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:21:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:21:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:21:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:21:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:21:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:21:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:21:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:21:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:21:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:21:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:21:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:21:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:21:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 07:21:07,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:21:07,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118189520] [2024-11-10 07:21:07,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118189520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:21:07,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:21:07,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:21:07,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214625173] [2024-11-10 07:21:07,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:21:07,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:21:07,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:21:07,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:21:07,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:21:07,532 INFO L87 Difference]: Start difference. First operand 142 states and 216 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:21:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:21:07,839 INFO L93 Difference]: Finished difference Result 384 states and 580 transitions. [2024-11-10 07:21:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:21:07,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 154 [2024-11-10 07:21:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:21:07,843 INFO L225 Difference]: With dead ends: 384 [2024-11-10 07:21:07,843 INFO L226 Difference]: Without dead ends: 245 [2024-11-10 07:21:07,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:21:07,845 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 173 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:21:07,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 402 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:21:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-10 07:21:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 215. [2024-11-10 07:21:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 141 states have internal predecessors, (189), 69 states have call successors, (69), 4 states have call predecessors, (69), 4 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-10 07:21:07,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 327 transitions. [2024-11-10 07:21:07,878 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 327 transitions. Word has length 154 [2024-11-10 07:21:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:21:07,879 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 327 transitions. [2024-11-10 07:21:07,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:21:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 327 transitions. [2024-11-10 07:21:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 07:21:07,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:21:07,882 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:21:07,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:21:07,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:21:07,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:21:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash -85314162, now seen corresponding path program 1 times [2024-11-10 07:21:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:21:07,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494754261] [2024-11-10 07:21:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:07,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:21:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:21:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:21:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:21:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:21:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:21:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:21:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:21:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:21:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:21:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:21:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:21:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:21:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:21:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:21:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:21:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:21:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:21:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:21:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:21:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:21:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:21:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:21:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:21:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 07:21:08,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:21:08,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494754261] [2024-11-10 07:21:08,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494754261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:21:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878481597] [2024-11-10 07:21:08,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:08,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:21:08,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:21:08,287 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-10 07:21:08,289 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-10 07:21:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:08,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:21:08,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:21:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-10 07:21:08,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:21:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 07:21:08,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878481597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:21:08,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:21:08,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 07:21:08,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475370145] [2024-11-10 07:21:08,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:21:08,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:21:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:21:08,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:21:08,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:21:08,853 INFO L87 Difference]: Start difference. First operand 215 states and 327 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 07:21:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:21:09,100 INFO L93 Difference]: Finished difference Result 453 states and 674 transitions. [2024-11-10 07:21:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:21:09,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 154 [2024-11-10 07:21:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:21:09,105 INFO L225 Difference]: With dead ends: 453 [2024-11-10 07:21:09,105 INFO L226 Difference]: Without dead ends: 241 [2024-11-10 07:21:09,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 350 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:21:09,111 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 175 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:21:09,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 202 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:21:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-10 07:21:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 227. [2024-11-10 07:21:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 150 states have (on average 1.2866666666666666) internal successors, (193), 150 states have internal predecessors, (193), 69 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-10 07:21:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 331 transitions. [2024-11-10 07:21:09,182 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 331 transitions. Word has length 154 [2024-11-10 07:21:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:21:09,185 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 331 transitions. [2024-11-10 07:21:09,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 07:21:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 331 transitions. [2024-11-10 07:21:09,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 07:21:09,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:21:09,190 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:21:09,216 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-10 07:21:09,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:21:09,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:21:09,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:21:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1489258706, now seen corresponding path program 1 times [2024-11-10 07:21:09,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:21:09,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742906967] [2024-11-10 07:21:09,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:09,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:21:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:21:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:21:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 07:21:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:21:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:21:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:21:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:21:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:21:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:21:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:21:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:21:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:21:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:21:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:21:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:21:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:21:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:21:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:21:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:21:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:21:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:21:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:21:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:21:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 07:21:10,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:21:10,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742906967] [2024-11-10 07:21:10,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742906967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:21:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203493724] [2024-11-10 07:21:10,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:10,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:21:10,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:21:10,004 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-10 07:21:10,007 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-10 07:21:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:10,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 07:21:10,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:21:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-10 07:21:10,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:21:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 07:21:11,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203493724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:21:11,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:21:11,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 18 [2024-11-10 07:21:11,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469019633] [2024-11-10 07:21:11,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:21:11,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 07:21:11,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:21:11,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 07:21:11,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-11-10 07:21:11,150 INFO L87 Difference]: Start difference. First operand 227 states and 331 transitions. Second operand has 18 states, 17 states have (on average 6.0) internal successors, (102), 18 states have internal predecessors, (102), 7 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 7 states have call successors, (69) [2024-11-10 07:21:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:21:11,988 INFO L93 Difference]: Finished difference Result 687 states and 993 transitions. [2024-11-10 07:21:11,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 07:21:11,989 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 18 states have internal predecessors, (102), 7 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 7 states have call successors, (69) Word has length 155 [2024-11-10 07:21:11,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:21:11,993 INFO L225 Difference]: With dead ends: 687 [2024-11-10 07:21:11,993 INFO L226 Difference]: Without dead ends: 463 [2024-11-10 07:21:11,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2024-11-10 07:21:11,995 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 316 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 07:21:11,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 689 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 07:21:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-10 07:21:12,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 285. [2024-11-10 07:21:12,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 181 states have (on average 1.2375690607734806) internal successors, (224), 181 states have internal predecessors, (224), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-10 07:21:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 408 transitions. [2024-11-10 07:21:12,059 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 408 transitions. Word has length 155 [2024-11-10 07:21:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:21:12,060 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 408 transitions. [2024-11-10 07:21:12,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.0) internal successors, (102), 18 states have internal predecessors, (102), 7 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 7 states have call successors, (69) [2024-11-10 07:21:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 408 transitions. [2024-11-10 07:21:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 07:21:12,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:21:12,063 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:21:12,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 07:21:12,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:21:12,268 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:21:12,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:21:12,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1961236719, now seen corresponding path program 1 times [2024-11-10 07:21:12,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:21:12,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992598771] [2024-11-10 07:21:12,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:12,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:21:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:21:12,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154391107] [2024-11-10 07:21:12,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:12,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:21:12,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:21:12,432 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-10 07:21:12,433 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-10 07:21:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:21:12,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:21:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:21:12,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:21:12,731 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:21:12,733 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:21:12,755 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-10 07:21:12,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:21:12,941 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 07:21:13,075 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:21:13,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:21:13 BoogieIcfgContainer [2024-11-10 07:21:13,079 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:21:13,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:21:13,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:21:13,080 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:21:13,081 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:21:04" (3/4) ... [2024-11-10 07:21:13,083 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:21:13,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:21:13,088 INFO L158 Benchmark]: Toolchain (without parser) took 9459.20ms. Allocated memory was 172.0MB in the beginning and 268.4MB in the end (delta: 96.5MB). Free memory was 116.1MB in the beginning and 187.2MB in the end (delta: -71.2MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-11-10 07:21:13,088 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 172.0MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:21:13,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.74ms. Allocated memory is still 172.0MB. Free memory was 116.1MB in the beginning and 98.0MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 07:21:13,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.07ms. Allocated memory is still 172.0MB. Free memory was 98.0MB in the beginning and 95.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:21:13,089 INFO L158 Benchmark]: Boogie Preprocessor took 59.51ms. Allocated memory is still 172.0MB. Free memory was 95.1MB in the beginning and 91.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:21:13,089 INFO L158 Benchmark]: IcfgBuilder took 618.60ms. Allocated memory is still 172.0MB. Free memory was 91.3MB in the beginning and 68.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 07:21:13,089 INFO L158 Benchmark]: TraceAbstraction took 8290.74ms. Allocated memory was 172.0MB in the beginning and 268.4MB in the end (delta: 96.5MB). Free memory was 67.9MB in the beginning and 187.2MB in the end (delta: -119.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:21:13,090 INFO L158 Benchmark]: Witness Printer took 5.65ms. Allocated memory is still 268.4MB. Free memory is still 187.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:21:13,091 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.19ms. Allocated memory is still 172.0MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.74ms. Allocated memory is still 172.0MB. Free memory was 116.1MB in the beginning and 98.0MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.07ms. Allocated memory is still 172.0MB. Free memory was 98.0MB in the beginning and 95.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.51ms. Allocated memory is still 172.0MB. Free memory was 95.1MB in the beginning and 91.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 618.60ms. Allocated memory is still 172.0MB. Free memory was 91.3MB in the beginning and 68.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8290.74ms. Allocated memory was 172.0MB in the beginning and 268.4MB in the end (delta: 96.5MB). Free memory was 67.9MB in the beginning and 187.2MB in the end (delta: -119.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.65ms. Allocated memory is still 268.4MB. Free memory is still 187.2MB. 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 172, overapproximation of someBinaryArithmeticFLOAToperation at line 74. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -2; [L23] unsigned long int var_1_4 = 128; [L24] signed char var_1_5 = 100; [L25] signed char var_1_6 = 5; [L26] signed char var_1_7 = 25; [L27] signed long int var_1_8 = 0; [L28] signed long int var_1_9 = 100; [L29] signed char var_1_10 = 10; [L30] unsigned char var_1_11 = 1; [L31] unsigned char var_1_12 = 0; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 63.5; [L34] float var_1_16 = 0.0; [L35] float var_1_17 = 8.16; [L36] float var_1_18 = 4.625; [L37] float var_1_19 = 1000000.2; [L38] float var_1_20 = 5.2; [L39] signed char var_1_21 = 8; [L40] signed long int var_1_22 = 64; [L41] signed char var_1_24 = 10; [L42] float var_1_25 = 0.0; [L43] float var_1_26 = 128.55; [L44] signed char var_1_27 = 16; [L45] unsigned long int var_1_28 = 256; [L46] signed short int var_1_29 = -128; [L47] signed char last_1_var_1_10 = 10; [L48] signed long int last_1_var_1_22 = 64; [L49] unsigned long int last_1_var_1_28 = 256; VAL [isInitial=0, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L176] isInitial = 1 [L177] FCALL initially() [L178] COND TRUE 1 [L179] CALL updateLastVariables() [L167] last_1_var_1_10 = var_1_10 [L168] last_1_var_1_22 = var_1_22 [L169] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L179] RET updateLastVariables() [L180] CALL updateVariables() [L128] var_1_4 = __VERIFIER_nondet_ulong() [L129] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L129] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L130] CALL assume_abort_if_not(var_1_4 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L130] RET assume_abort_if_not(var_1_4 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L131] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L131] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L132] var_1_5 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_5 >= 62) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L133] RET assume_abort_if_not(var_1_5 >= 62) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L134] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L134] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L135] var_1_6 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L136] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L137] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L137] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L138] var_1_7 = __VERIFIER_nondet_char() [L139] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=100] [L139] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=100] [L140] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=100] [L140] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=100] [L141] var_1_9 = __VERIFIER_nondet_long() [L142] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L142] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L143] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L143] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L144] var_1_12 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L145] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L146] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L146] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L147] var_1_14 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L148] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L149] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L149] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L150] var_1_16 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L151] RET assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L152] var_1_17 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L153] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L154] var_1_18 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L155] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L156] var_1_19 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L157] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L158] var_1_25 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_25 >= 4611686.018427387900e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L159] RET assume_abort_if_not((var_1_25 >= 4611686.018427387900e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L160] var_1_26 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L161] RET assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L162] var_1_27 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L163] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L164] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L164] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L180] RET updateVariables() [L181] CALL step() [L53] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L56] COND FALSE !(last_1_var_1_10 >= (var_1_6 + last_1_var_1_22)) [L59] var_1_21 = var_1_7 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L62] COND FALSE !(last_1_var_1_28 <= ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L65] COND TRUE \read(var_1_12) [L66] var_1_11 = (((var_1_20 + 31.75f) <= 4.2f) && var_1_14) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L68] signed char stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_0=2, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=0, var_1_9=58] [L69] COND TRUE stepLocal_0 != var_1_4 [L70] var_1_8 = ((var_1_7 + ((((var_1_6) > (var_1_5)) ? (var_1_6) : (var_1_5)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=6, var_1_9=58] [L74] var_1_15 = ((((((var_1_16 - var_1_17)) > (var_1_18)) ? ((var_1_16 - var_1_17)) : (var_1_18))) - var_1_19) [L75] unsigned char stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=64, var_1_24=10, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=6, var_1_9=58] [L76] COND TRUE var_1_17 > (((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))) - (var_1_25 - var_1_26)) [L77] var_1_24 = (32 - (var_1_6 + var_1_27)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=64, var_1_24=31, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=6, var_1_9=58] [L89] signed long int stepLocal_1 = var_1_24 + (var_1_5 - var_1_7); VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_1=91, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=64, var_1_24=31, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=6, var_1_9=58] [L90] COND FALSE !(var_1_6 >= stepLocal_1) [L93] var_1_10 = var_1_7 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=2, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=64, var_1_24=31, var_1_27=0, var_1_28=256, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=6, var_1_9=58] [L95] COND FALSE !(\read(var_1_11)) [L104] var_1_28 = ((((var_1_7) > (var_1_6)) ? (var_1_7) : (var_1_6))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=2, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=64, var_1_24=31, var_1_27=0, var_1_28=2, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=6, var_1_9=58] [L106] unsigned char stepLocal_2 = var_1_11; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_2=0, stepLocal_3=0, var_1_10=2, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=64, var_1_24=31, var_1_27=0, var_1_28=2, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=6, var_1_9=58] [L107] COND FALSE !(stepLocal_2 && var_1_11) [L110] var_1_22 = ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=2, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=2, var_1_24=31, var_1_27=0, var_1_28=2, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=6, var_1_9=58] [L112] COND FALSE !(10u <= ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=2, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=2, var_1_24=31, var_1_27=0, var_1_28=2, var_1_29=-128, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=6, var_1_9=58] [L117] COND FALSE !((var_1_8 > var_1_22) && (var_1_19 < (var_1_15 / var_1_16))) [L124] var_1_29 = var_1_27 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=2, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=2, var_1_24=31, var_1_27=0, var_1_28=2, var_1_29=0, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=6, var_1_9=58] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return (((((((((((10u <= ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) ? ((((((16u) < (var_1_22)) ? (16u) : (var_1_22))) >= (var_1_8 % var_1_4)) ? (var_1_1 == ((signed char) ((var_1_5 - var_1_6) - var_1_7))) : 1) : 1) && ((var_1_7 != var_1_4) ? (var_1_8 == ((signed long int) ((var_1_7 + ((((var_1_6) > (var_1_5)) ? (var_1_6) : (var_1_5)))) - var_1_9))) : (var_1_8 == ((signed long int) var_1_21)))) && ((var_1_6 >= (var_1_24 + (var_1_5 - var_1_7))) ? (var_1_10 == ((signed char) (var_1_7 - var_1_6))) : (var_1_10 == ((signed char) var_1_7)))) && (var_1_12 ? (var_1_11 == ((unsigned char) (((var_1_20 + 31.75f) <= 4.2f) && var_1_14))) : 1)) && (var_1_15 == ((float) ((((((var_1_16 - var_1_17)) > (var_1_18)) ? ((var_1_16 - var_1_17)) : (var_1_18))) - var_1_19)))) && ((last_1_var_1_28 <= ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) ? (var_1_20 == ((float) ((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16))))) : 1)) && (var_1_14 ? (var_1_21 == ((signed char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) : ((last_1_var_1_10 >= (var_1_6 + last_1_var_1_22)) ? (var_1_21 == ((signed char) var_1_6)) : (var_1_21 == ((signed char) var_1_7))))) && ((var_1_11 && var_1_11) ? (var_1_22 == ((signed long int) (((((var_1_6 + var_1_10) + var_1_21) < 0 ) ? -((var_1_6 + var_1_10) + var_1_21) : ((var_1_6 + var_1_10) + var_1_21))))) : (var_1_22 == ((signed long int) ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))))) && ((var_1_17 > (((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))) - (var_1_25 - var_1_26))) ? (var_1_24 == ((signed char) (32 - (var_1_6 + var_1_27)))) : ((var_1_11 && (var_1_11 && var_1_14)) ? (var_1_24 == ((signed char) (var_1_6 + var_1_27))) : ((var_1_15 >= var_1_18) ? (var_1_24 == ((signed char) var_1_6)) : (var_1_24 == ((signed char) var_1_27)))))) && (var_1_11 ? ((! (var_1_20 >= var_1_16)) ? (var_1_28 == ((unsigned long int) (var_1_27 + var_1_5))) : (((- var_1_26) < (- (var_1_15 + var_1_17))) ? (var_1_28 == ((unsigned long int) ((((var_1_7) > (var_1_27)) ? (var_1_7) : (var_1_27))))) : 1)) : (var_1_28 == ((unsigned long int) ((((var_1_7) > (var_1_6)) ? (var_1_7) : (var_1_6))))))) && (((var_1_8 > var_1_22) && (var_1_19 < (var_1_15 / var_1_16))) ? ((var_1_27 != (var_1_7 - var_1_6)) ? (var_1_29 == ((signed short int) (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) - ((10000 - var_1_5) + var_1_27)))) : (var_1_29 == ((signed short int) var_1_10))) : (var_1_29 == ((signed short int) var_1_27))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=2, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=2, var_1_24=31, var_1_27=0, var_1_28=2, var_1_29=0, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=6, var_1_9=58] [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=2, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=2, var_1_24=31, var_1_27=0, var_1_28=2, var_1_29=0, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=6, var_1_9=58] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=2, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=2, var_1_22=2, var_1_24=31, var_1_27=0, var_1_28=2, var_1_29=0, var_1_4=1, var_1_5=62, var_1_6=1, var_1_7=2, var_1_8=6, var_1_9=58] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 800 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 765 mSDsluCounter, 1705 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1125 mSDsCounter, 302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 979 IncrementalHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 302 mSolverCounterUnsat, 580 mSDtfsCounter, 979 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 907 GetRequests, 865 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=285occurred in iteration=5, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 225 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1390 NumberOfCodeBlocks, 1390 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1380 ConstructedInterpolants, 0 QuantifiedInterpolants, 3990 SizeOfPredicates, 7 NumberOfNonLiveVariables, 732 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 8883/9108 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-10 07:21:13,130 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_100-while_file-98.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 c9772336b4f5bbc4418fabef46aa66f1fadeb5e29c51f3493f820d65f03963e5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:21:15,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:21:15,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:21:15,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:21:15,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:21:15,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:21:15,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:21:15,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:21:15,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:21:15,743 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:21:15,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:21:15,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:21:15,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:21:15,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:21:15,749 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:21:15,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:21:15,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:21:15,750 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:21:15,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:21:15,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:21:15,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:21:15,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:21:15,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:21:15,753 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:21:15,754 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:21:15,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:21:15,754 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:21:15,754 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:21:15,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:21:15,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:21:15,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:21:15,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:21:15,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:21:15,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:21:15,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:21:15,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:21:15,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:21:15,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:21:15,760 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:21:15,760 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:21:15,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:21:15,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:21:15,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:21:15,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:21:15,762 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 -> c9772336b4f5bbc4418fabef46aa66f1fadeb5e29c51f3493f820d65f03963e5 [2024-11-10 07:21:16,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:21:16,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:21:16,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:21:16,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:21:16,156 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:21:16,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-98.i [2024-11-10 07:21:17,825 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:21:18,050 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:21:18,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-98.i [2024-11-10 07:21:18,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee36540e/c680713f42424063a9890fedb21ebd30/FLAG1e52f35d3 [2024-11-10 07:21:18,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ee36540e/c680713f42424063a9890fedb21ebd30 [2024-11-10 07:21:18,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:21:18,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:21:18,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:21:18,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:21:18,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:21:18,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1723fead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18, skipping insertion in model container [2024-11-10 07:21:18,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:21:18,364 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-98.i[916,929] [2024-11-10 07:21:18,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:21:18,490 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:21:18,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-98.i[916,929] [2024-11-10 07:21:18,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:21:18,597 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:21:18,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18 WrapperNode [2024-11-10 07:21:18,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:21:18,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:21:18,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:21:18,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:21:18,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,667 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2024-11-10 07:21:18,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:21:18,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:21:18,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:21:18,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:21:18,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,717 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-10 07:21:18,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:21:18,756 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:21:18,760 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:21:18,760 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:21:18,761 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18" (1/1) ... [2024-11-10 07:21:18,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:21:18,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:21:18,801 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-10 07:21:18,805 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-10 07:21:18,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:21:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:21:18,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:21:18,846 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:21:18,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:21:18,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:21:18,939 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:21:18,941 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:21:26,019 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 07:21:26,021 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:21:26,037 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:21:26,038 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:21:26,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:21:26 BoogieIcfgContainer [2024-11-10 07:21:26,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:21:26,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:21:26,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:21:26,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:21:26,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:21:18" (1/3) ... [2024-11-10 07:21:26,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fb0838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:21:26, skipping insertion in model container [2024-11-10 07:21:26,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:21:18" (2/3) ... [2024-11-10 07:21:26,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fb0838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:21:26, skipping insertion in model container [2024-11-10 07:21:26,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:21:26" (3/3) ... [2024-11-10 07:21:26,049 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-98.i [2024-11-10 07:21:26,065 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:21:26,065 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:21:26,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:21:26,126 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;@5c1cd064, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:21:26,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:21:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:21:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 07:21:26,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:21:26,148 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:21:26,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:21:26,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:21:26,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1301740663, now seen corresponding path program 1 times [2024-11-10 07:21:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:21:26,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253615722] [2024-11-10 07:21:26,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:26,165 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-10 07:21:26,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:21:26,169 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-10 07:21:26,170 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-10 07:21:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:26,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:21:26,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:21:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2024-11-10 07:21:26,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:21:26,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:21:26,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253615722] [2024-11-10 07:21:26,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253615722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:21:26,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:21:26,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:21:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930203353] [2024-11-10 07:21:26,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:21:26,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:21:26,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:21:26,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:21:26,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:21:26,861 INFO L87 Difference]: Start difference. First operand has 80 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:21:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:21:26,896 INFO L93 Difference]: Finished difference Result 152 states and 260 transitions. [2024-11-10 07:21:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:21:26,898 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 154 [2024-11-10 07:21:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:21:26,904 INFO L225 Difference]: With dead ends: 152 [2024-11-10 07:21:26,904 INFO L226 Difference]: Without dead ends: 75 [2024-11-10 07:21:26,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 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-10 07:21:26,910 INFO L432 NwaCegarLoop]: 114 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, 114 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-10 07:21:26,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:21:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-10 07:21:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-10 07:21:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:21:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 114 transitions. [2024-11-10 07:21:26,954 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 114 transitions. Word has length 154 [2024-11-10 07:21:26,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:21:26,955 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 114 transitions. [2024-11-10 07:21:26,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-10 07:21:26,956 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 114 transitions. [2024-11-10 07:21:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-10 07:21:26,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:21:26,961 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:21:26,981 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-10 07:21:27,163 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-10 07:21:27,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:21:27,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:21:27,165 INFO L85 PathProgramCache]: Analyzing trace with hash -831052144, now seen corresponding path program 1 times [2024-11-10 07:21:27,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:21:27,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169537074] [2024-11-10 07:21:27,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:27,166 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-10 07:21:27,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:21:27,168 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-10 07:21:27,169 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-10 07:21:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:27,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 07:21:27,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:21:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-10 07:21:28,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:21:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-10 07:21:29,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:21:29,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169537074] [2024-11-10 07:21:29,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169537074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:21:29,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:21:29,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 07:21:29,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738029925] [2024-11-10 07:21:29,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:21:29,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:21:29,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:21:29,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:21:29,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:21:29,664 INFO L87 Difference]: Start difference. First operand 75 states and 114 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 07:21:34,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:21:38,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:21:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:21:38,097 INFO L93 Difference]: Finished difference Result 155 states and 232 transitions. [2024-11-10 07:21:38,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:21:38,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 154 [2024-11-10 07:21:38,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:21:38,139 INFO L225 Difference]: With dead ends: 155 [2024-11-10 07:21:38,140 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 07:21:38,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:21:38,142 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 68 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:21:38,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 203 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 139 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2024-11-10 07:21:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 07:21:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2024-11-10 07:21:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-10 07:21:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-11-10 07:21:38,158 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 154 [2024-11-10 07:21:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:21:38,159 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-11-10 07:21:38,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 07:21:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-11-10 07:21:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 07:21:38,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:21:38,162 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:21:38,182 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-10 07:21:38,362 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-10 07:21:38,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:21:38,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:21:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2059970608, now seen corresponding path program 1 times [2024-11-10 07:21:38,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:21:38,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838951407] [2024-11-10 07:21:38,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:38,365 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-10 07:21:38,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:21:38,367 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-10 07:21:38,368 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-10 07:21:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:38,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 07:21:38,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:21:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 391 proven. 96 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-11-10 07:21:45,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:21:47,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:21:47,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838951407] [2024-11-10 07:21:47,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838951407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:21:47,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1012760620] [2024-11-10 07:21:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:47,046 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 07:21:47,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 07:21:47,049 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 07:21:47,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-10 07:21:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:47,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 07:21:47,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:21:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-10 07:21:47,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:21:47,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1012760620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:21:47,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 07:21:47,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2024-11-10 07:21:47,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308920697] [2024-11-10 07:21:47,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:21:47,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:21:47,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:21:47,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:21:47,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-10 07:21:47,682 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 07:21:52,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:21:56,184 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-10 07:21:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:21:56,454 INFO L93 Difference]: Finished difference Result 229 states and 335 transitions. [2024-11-10 07:21:56,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:21:56,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-11-10 07:21:56,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:21:56,457 INFO L225 Difference]: With dead ends: 229 [2024-11-10 07:21:56,457 INFO L226 Difference]: Without dead ends: 153 [2024-11-10 07:21:56,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-11-10 07:21:56,460 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 100 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-10 07:21:56,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 295 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-10 07:21:56,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-10 07:21:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2024-11-10 07:21:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 99 states have (on average 1.2828282828282829) internal successors, (127), 99 states have internal predecessors, (127), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 07:21:56,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 219 transitions. [2024-11-10 07:21:56,491 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 219 transitions. Word has length 155 [2024-11-10 07:21:56,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:21:56,492 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 219 transitions. [2024-11-10 07:21:56,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-10 07:21:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 219 transitions. [2024-11-10 07:21:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-10 07:21:56,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:21:56,495 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:21:56,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 07:21:56,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-10 07:21:56,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 07:21:56,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:21:56,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:21:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash -492186353, now seen corresponding path program 1 times [2024-11-10 07:21:56,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:21:56,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945850302] [2024-11-10 07:21:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:21:56,900 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-10 07:21:56,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:21:56,902 INFO L229 MonitoredProcess]: Starting monitored process 6 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-10 07:21:56,904 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 (6)] Waiting until timeout for monitored process [2024-11-10 07:21:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:21:57,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 07:21:57,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:22:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 391 proven. 96 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2024-11-10 07:22:02,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:22:04,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:22:04,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945850302] [2024-11-10 07:22:04,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945850302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:22:04,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [387005781] [2024-11-10 07:22:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:22:04,401 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 07:22:04,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 07:22:04,403 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 07:22:04,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-10 07:22:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:22:05,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 07:22:05,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:22:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-10 07:22:09,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:22:10,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [387005781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:22:10,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:22:10,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 9 [2024-11-10 07:22:10,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211981387] [2024-11-10 07:22:10,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:22:10,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:22:10,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:22:10,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:22:10,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2024-11-10 07:22:10,221 INFO L87 Difference]: Start difference. First operand 150 states and 219 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2024-11-10 07:22:17,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:22:21,748 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-10 07:22:25,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []