./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-16.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 82fbcd39199a525399eb28d721839336007b212e1ad38780097336285e9776e8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:13:03,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:13:03,107 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:13:03,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:13:03,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:13:03,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:13:03,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:13:03,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:13:03,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:13:03,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:13:03,138 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:13:03,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:13:03,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:13:03,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:13:03,140 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:13:03,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:13:03,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:13:03,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:13:03,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:13:03,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:13:03,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:13:03,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:13:03,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:13:03,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:13:03,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:13:03,145 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:13:03,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:13:03,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:13:03,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:13:03,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:13:03,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:13:03,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:13:03,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:13:03,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:13:03,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:13:03,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:13:03,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:13:03,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:13:03,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:13:03,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:13:03,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:13:03,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:13:03,149 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 -> 82fbcd39199a525399eb28d721839336007b212e1ad38780097336285e9776e8 [2024-10-24 09:13:03,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:13:03,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:13:03,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:13:03,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:13:03,413 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:13:03,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-16.i [2024-10-24 09:13:04,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:13:04,876 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:13:04,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-16.i [2024-10-24 09:13:04,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e626d2d05/136484713bbe47e6af4ca9de97e65c0a/FLAGda8fc93bc [2024-10-24 09:13:04,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e626d2d05/136484713bbe47e6af4ca9de97e65c0a [2024-10-24 09:13:04,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:13:04,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:13:04,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:13:04,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:13:04,926 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:13:04,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:13:04" (1/1) ... [2024-10-24 09:13:04,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2ba33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:04, skipping insertion in model container [2024-10-24 09:13:04,927 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:13:04" (1/1) ... [2024-10-24 09:13:04,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:13:05,084 WARN L248 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-16.i[916,929] [2024-10-24 09:13:05,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:13:05,150 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:13:05,159 WARN L248 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-16.i[916,929] [2024-10-24 09:13:05,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:13:05,203 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:13:05,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05 WrapperNode [2024-10-24 09:13:05,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:13:05,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:13:05,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:13:05,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:13:05,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05" (1/1) ... [2024-10-24 09:13:05,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05" (1/1) ... [2024-10-24 09:13:05,256 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2024-10-24 09:13:05,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:13:05,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:13:05,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:13:05,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:13:05,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05" (1/1) ... [2024-10-24 09:13:05,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05" (1/1) ... [2024-10-24 09:13:05,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05" (1/1) ... [2024-10-24 09:13:05,324 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-10-24 09:13:05,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05" (1/1) ... [2024-10-24 09:13:05,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05" (1/1) ... [2024-10-24 09:13:05,346 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05" (1/1) ... [2024-10-24 09:13:05,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05" (1/1) ... [2024-10-24 09:13:05,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05" (1/1) ... [2024-10-24 09:13:05,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05" (1/1) ... [2024-10-24 09:13:05,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:13:05,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:13:05,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:13:05,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:13:05,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05" (1/1) ... [2024-10-24 09:13:05,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:13:05,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:13:05,433 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-10-24 09:13:05,436 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-10-24 09:13:05,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:13:05,470 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:13:05,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:13:05,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:13:05,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:13:05,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:13:05,551 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:13:05,553 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:13:06,002 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-24 09:13:06,003 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:13:06,033 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:13:06,034 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:13:06,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:13:06 BoogieIcfgContainer [2024-10-24 09:13:06,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:13:06,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:13:06,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:13:06,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:13:06,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:13:04" (1/3) ... [2024-10-24 09:13:06,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc2dc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:13:06, skipping insertion in model container [2024-10-24 09:13:06,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:05" (2/3) ... [2024-10-24 09:13:06,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fc2dc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:13:06, skipping insertion in model container [2024-10-24 09:13:06,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:13:06" (3/3) ... [2024-10-24 09:13:06,044 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-16.i [2024-10-24 09:13:06,056 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:13:06,057 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:13:06,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:13:06,119 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;@7456361f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:13:06,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:13:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 69 states have internal predecessors, (103), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 09:13:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 09:13:06,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:13:06,138 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:13:06,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:13:06,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:13:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1312161230, now seen corresponding path program 1 times [2024-10-24 09:13:06,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:13:06,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308628926] [2024-10-24 09:13:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:06,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:13:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:13:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:13:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:13:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:13:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:13:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:13:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:13:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:13:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:13:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:13:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 09:13:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:13:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:13:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:13:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:13:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:13:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:13:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:13:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:13:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:13:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:13:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 09:13:06,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:13:06,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308628926] [2024-10-24 09:13:06,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308628926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:13:06,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:13:06,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:13:06,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387743344] [2024-10-24 09:13:06,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:13:06,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:13:06,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:13:06,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:13:06,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:13:06,550 INFO L87 Difference]: Start difference. First operand has 92 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 69 states have internal predecessors, (103), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 09:13:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:13:06,597 INFO L93 Difference]: Finished difference Result 181 states and 309 transitions. [2024-10-24 09:13:06,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:13:06,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 141 [2024-10-24 09:13:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:13:06,606 INFO L225 Difference]: With dead ends: 181 [2024-10-24 09:13:06,606 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 09:13:06,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-10-24 09:13:06,611 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:13:06,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:13:06,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 09:13:06,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-24 09:13:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.462686567164179) internal successors, (98), 67 states have internal predecessors, (98), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 09:13:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 140 transitions. [2024-10-24 09:13:06,647 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 140 transitions. Word has length 141 [2024-10-24 09:13:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:13:06,648 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 140 transitions. [2024-10-24 09:13:06,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 09:13:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 140 transitions. [2024-10-24 09:13:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 09:13:06,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:13:06,652 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:13:06,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:13:06,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:13:06,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:13:06,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2019550652, now seen corresponding path program 1 times [2024-10-24 09:13:06,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:13:06,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947627778] [2024-10-24 09:13:06,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:06,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:13:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:13:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:13:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:13:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:13:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:13:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:13:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:13:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:13:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:13:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:13:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 09:13:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:13:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:13:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:13:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:13:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:13:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:13:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:13:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:13:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:13:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:13:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 09:13:07,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:13:07,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947627778] [2024-10-24 09:13:07,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947627778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:13:07,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:13:07,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:13:07,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851509105] [2024-10-24 09:13:07,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:13:07,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:13:07,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:13:07,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:13:07,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:13:07,117 INFO L87 Difference]: Start difference. First operand 90 states and 140 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 09:13:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:13:07,204 INFO L93 Difference]: Finished difference Result 187 states and 288 transitions. [2024-10-24 09:13:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:13:07,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2024-10-24 09:13:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:13:07,206 INFO L225 Difference]: With dead ends: 187 [2024-10-24 09:13:07,206 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 09:13:07,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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-10-24 09:13:07,208 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 76 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:13:07,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 177 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:13:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 09:13:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-24 09:13:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 72 states have internal predecessors, (101), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 09:13:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 147 transitions. [2024-10-24 09:13:07,222 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 147 transitions. Word has length 141 [2024-10-24 09:13:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:13:07,226 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 147 transitions. [2024-10-24 09:13:07,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 09:13:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 147 transitions. [2024-10-24 09:13:07,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 09:13:07,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:13:07,230 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:13:07,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:13:07,231 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:13:07,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:13:07,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1264299394, now seen corresponding path program 1 times [2024-10-24 09:13:07,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:13:07,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720549084] [2024-10-24 09:13:07,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:07,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:13:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:13:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:13:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:13:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:13:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:13:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:13:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:13:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:13:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:13:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:13:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 09:13:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:13:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:13:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:13:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:13:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:13:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:13:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:13:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:13:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:13:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:13:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 09:13:07,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:13:07,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720549084] [2024-10-24 09:13:07,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720549084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:13:07,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:13:07,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 09:13:07,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743959618] [2024-10-24 09:13:07,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:13:07,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:13:07,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:13:07,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:13:07,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:13:07,962 INFO L87 Difference]: Start difference. First operand 97 states and 147 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 09:13:08,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:13:08,251 INFO L93 Difference]: Finished difference Result 376 states and 568 transitions. [2024-10-24 09:13:08,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 09:13:08,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 141 [2024-10-24 09:13:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:13:08,254 INFO L225 Difference]: With dead ends: 376 [2024-10-24 09:13:08,254 INFO L226 Difference]: Without dead ends: 283 [2024-10-24 09:13:08,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:13:08,256 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 494 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:13:08,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 756 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:13:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-24 09:13:08,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 190. [2024-10-24 09:13:08,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 133 states have (on average 1.368421052631579) internal successors, (182), 134 states have internal predecessors, (182), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 09:13:08,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 284 transitions. [2024-10-24 09:13:08,283 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 284 transitions. Word has length 141 [2024-10-24 09:13:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:13:08,284 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 284 transitions. [2024-10-24 09:13:08,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 09:13:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 284 transitions. [2024-10-24 09:13:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 09:13:08,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:13:08,286 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:13:08,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:13:08,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:13:08,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:13:08,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1036523196, now seen corresponding path program 1 times [2024-10-24 09:13:08,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:13:08,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102006317] [2024-10-24 09:13:08,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:08,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:13:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:08,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:13:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:08,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:13:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:08,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:13:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:08,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:13:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:08,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:13:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:13:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:13:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:13:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:13:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:13:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 09:13:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:13:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:13:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:13:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:13:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:13:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:13:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:13:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:13:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:13:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:13:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 09:13:09,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:13:09,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102006317] [2024-10-24 09:13:09,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102006317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:13:09,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:13:09,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 09:13:09,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965522275] [2024-10-24 09:13:09,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:13:09,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:13:09,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:13:09,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:13:09,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:13:09,120 INFO L87 Difference]: Start difference. First operand 190 states and 284 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-24 09:13:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:13:09,793 INFO L93 Difference]: Finished difference Result 426 states and 626 transitions. [2024-10-24 09:13:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 09:13:09,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 141 [2024-10-24 09:13:09,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:13:09,799 INFO L225 Difference]: With dead ends: 426 [2024-10-24 09:13:09,799 INFO L226 Difference]: Without dead ends: 250 [2024-10-24 09:13:09,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:13:09,803 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 377 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 09:13:09,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 205 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 09:13:09,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-24 09:13:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 198. [2024-10-24 09:13:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 142 states have internal predecessors, (188), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 09:13:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 290 transitions. [2024-10-24 09:13:09,870 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 290 transitions. Word has length 141 [2024-10-24 09:13:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:13:09,872 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 290 transitions. [2024-10-24 09:13:09,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-24 09:13:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 290 transitions. [2024-10-24 09:13:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 09:13:09,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:13:09,874 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:13:09,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:13:09,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:13:09,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:13:09,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1483436738, now seen corresponding path program 1 times [2024-10-24 09:13:09,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:13:09,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378843444] [2024-10-24 09:13:09,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:09,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:13:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:13:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:13:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:13:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:13:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:13:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:13:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 09:13:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:13:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 09:13:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:13:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 09:13:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:13:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:13:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:13:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:13:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:13:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:13:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:13:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:13:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:13:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:13:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 09:13:10,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:13:10,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378843444] [2024-10-24 09:13:10,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378843444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:13:10,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819306502] [2024-10-24 09:13:10,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:10,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:13:10,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:13:10,282 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-10-24 09:13:10,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-10-24 09:13:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:10,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 09:13:10,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:13:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-24 09:13:10,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:13:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 09:13:11,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819306502] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:13:11,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:13:11,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2024-10-24 09:13:11,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182523653] [2024-10-24 09:13:11,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:13:11,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 09:13:11,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:13:11,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 09:13:11,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:13:11,082 INFO L87 Difference]: Start difference. First operand 198 states and 290 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 4 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2024-10-24 09:13:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:13:12,074 INFO L93 Difference]: Finished difference Result 696 states and 1004 transitions. [2024-10-24 09:13:12,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-24 09:13:12,075 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 4 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) Word has length 141 [2024-10-24 09:13:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:13:12,078 INFO L225 Difference]: With dead ends: 696 [2024-10-24 09:13:12,079 INFO L226 Difference]: Without dead ends: 512 [2024-10-24 09:13:12,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=375, Invalid=1431, Unknown=0, NotChecked=0, Total=1806 [2024-10-24 09:13:12,082 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1210 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 09:13:12,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1373 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 09:13:12,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-10-24 09:13:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 361. [2024-10-24 09:13:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 255 states have (on average 1.2941176470588236) internal successors, (330), 258 states have internal predecessors, (330), 93 states have call successors, (93), 12 states have call predecessors, (93), 12 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-24 09:13:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 516 transitions. [2024-10-24 09:13:12,148 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 516 transitions. Word has length 141 [2024-10-24 09:13:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:13:12,148 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 516 transitions. [2024-10-24 09:13:12,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 4 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2024-10-24 09:13:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 516 transitions. [2024-10-24 09:13:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 09:13:12,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:13:12,149 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:13:12,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:13:12,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:13:12,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:13:12,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:13:12,354 INFO L85 PathProgramCache]: Analyzing trace with hash 844460585, now seen corresponding path program 1 times [2024-10-24 09:13:12,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:13:12,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465446392] [2024-10-24 09:13:12,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:12,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:13:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:13:12,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582841496] [2024-10-24 09:13:12,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:12,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:13:12,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:13:12,417 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-10-24 09:13:12,418 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-10-24 09:13:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:13:12,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:13:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:13:12,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:13:12,782 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:13:12,783 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:13:12,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 09:13:12,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 09:13:12,989 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 09:13:13,098 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:13:13,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:13:13 BoogieIcfgContainer [2024-10-24 09:13:13,101 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:13:13,101 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:13:13,101 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:13:13,101 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:13:13,102 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:13:06" (3/4) ... [2024-10-24 09:13:13,103 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:13:13,105 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:13:13,106 INFO L158 Benchmark]: Toolchain (without parser) took 8191.83ms. Allocated memory was 199.2MB in the beginning and 350.2MB in the end (delta: 151.0MB). Free memory was 126.5MB in the beginning and 219.4MB in the end (delta: -92.9MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2024-10-24 09:13:13,106 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 154.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:13:13,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.03ms. Allocated memory is still 199.2MB. Free memory was 126.3MB in the beginning and 108.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 09:13:13,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.72ms. Allocated memory is still 199.2MB. Free memory was 108.4MB in the beginning and 103.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:13:13,107 INFO L158 Benchmark]: Boogie Preprocessor took 142.30ms. Allocated memory is still 199.2MB. Free memory was 103.2MB in the beginning and 160.7MB in the end (delta: -57.5MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-10-24 09:13:13,108 INFO L158 Benchmark]: RCFGBuilder took 635.35ms. Allocated memory is still 199.2MB. Free memory was 160.7MB in the beginning and 126.1MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 09:13:13,108 INFO L158 Benchmark]: TraceAbstraction took 7063.40ms. Allocated memory was 199.2MB in the beginning and 350.2MB in the end (delta: 151.0MB). Free memory was 125.1MB in the beginning and 219.4MB in the end (delta: -94.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-10-24 09:13:13,109 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 350.2MB. Free memory is still 219.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:13:13,110 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.13ms. Allocated memory is still 199.2MB. Free memory is still 154.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.03ms. Allocated memory is still 199.2MB. Free memory was 126.3MB in the beginning and 108.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.72ms. Allocated memory is still 199.2MB. Free memory was 108.4MB in the beginning and 103.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 142.30ms. Allocated memory is still 199.2MB. Free memory was 103.2MB in the beginning and 160.7MB in the end (delta: -57.5MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * RCFGBuilder took 635.35ms. Allocated memory is still 199.2MB. Free memory was 160.7MB in the beginning and 126.1MB in the end (delta: 34.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7063.40ms. Allocated memory was 199.2MB in the beginning and 350.2MB in the end (delta: 151.0MB). Free memory was 125.1MB in the beginning and 219.4MB in the end (delta: -94.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 350.2MB. Free memory is still 219.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someUnaryFLOAToperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] signed char var_1_7 = -25; [L24] signed char var_1_9 = 50; [L25] signed char var_1_10 = -128; [L26] signed char var_1_11 = 0; [L27] signed char var_1_12 = -32; [L28] signed long int var_1_13 = 16; [L29] unsigned char var_1_14 = 1; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_18 = 0; [L32] unsigned char var_1_19 = 0; [L33] unsigned char var_1_20 = 0; [L34] float var_1_21 = 127.25; [L35] float var_1_23 = 1.5; [L36] float var_1_24 = 100.5; [L37] signed char var_1_25 = 0; [L38] signed char var_1_26 = -2; [L39] signed char var_1_27 = 0; [L40] signed long int var_1_28 = -128; [L41] float var_1_30 = 9.375; [L42] double var_1_31 = 99999999.875; [L43] double var_1_32 = 4.8; [L44] unsigned short int var_1_33 = 0; [L45] unsigned short int var_1_35 = 54252; [L46] unsigned short int var_1_37 = 5; [L47] unsigned char var_1_38 = 4; [L48] signed char var_1_39 = -64; [L49] signed char last_1_var_1_10 = -128; [L50] unsigned char last_1_var_1_18 = 0; [L51] signed char last_1_var_1_25 = 0; [L52] unsigned short int last_1_var_1_33 = 0; [L53] signed char last_1_var_1_39 = -64; [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L172] last_1_var_1_10 = var_1_10 [L173] last_1_var_1_18 = var_1_18 [L174] last_1_var_1_25 = var_1_25 [L175] last_1_var_1_33 = var_1_33 [L176] last_1_var_1_39 = var_1_39 [L186] RET updateLastVariables() [L187] CALL updateVariables() [L137] var_1_9 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L138] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L139] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L139] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L140] var_1_11 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L141] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L142] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L142] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L143] var_1_13 = __VERIFIER_nondet_long() [L144] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L144] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L145] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L145] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L146] CALL assume_abort_if_not(var_1_13 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L146] RET assume_abort_if_not(var_1_13 != 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L147] var_1_19 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L148] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L149] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L149] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L150] var_1_20 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L152] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L152] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L153] var_1_23 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L154] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L155] var_1_24 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L156] RET assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L157] var_1_26 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_26 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L158] RET assume_abort_if_not(var_1_26 >= -63) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L159] CALL assume_abort_if_not(var_1_26 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L159] RET assume_abort_if_not(var_1_26 <= 63) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L160] var_1_27 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L161] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L162] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L162] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L163] var_1_31 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L164] RET assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L165] var_1_32 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L166] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L167] var_1_35 = __VERIFIER_nondet_ushort() [L168] CALL assume_abort_if_not(var_1_35 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L168] RET assume_abort_if_not(var_1_35 >= 49150) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L169] CALL assume_abort_if_not(var_1_35 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L169] RET assume_abort_if_not(var_1_35 <= 65534) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L187] RET updateVariables() [L188] CALL step() [L57] unsigned char stepLocal_3 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_3=0, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L58] COND FALSE !(stepLocal_3 || var_1_20) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L61] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L65] var_1_18 = (! (var_1_19 || var_1_20)) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L66] COND TRUE (- var_1_24) < var_1_23 [L67] var_1_25 = (((((-10) < (var_1_26)) ? (-10) : (var_1_26))) + var_1_27) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L69] var_1_37 = var_1_11 [L70] var_1_38 = var_1_11 [L71] var_1_39 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-25, var_1_9=-24] [L72] COND TRUE \read(var_1_18) [L73] var_1_7 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L75] signed char stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_1=-24, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L76] COND FALSE !((last_1_var_1_10 + var_1_7) > stepLocal_1) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L79] COND TRUE (var_1_7 / var_1_13) == var_1_25 [L80] var_1_12 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L88] COND TRUE (var_1_11 - var_1_37) != -256 [L89] var_1_21 = ((((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) < (var_1_24)) ? (((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) : (var_1_24))) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L93] signed long int stepLocal_4 = var_1_28; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=1, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L94] COND TRUE ((var_1_31 - var_1_32) + var_1_24) != var_1_23 [L95] var_1_30 = ((((var_1_23) < (var_1_24)) ? (var_1_23) : (var_1_24))) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=1, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=3, var_1_33=0, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L101] COND TRUE var_1_28 < var_1_37 [L102] var_1_33 = (((26262 - var_1_11) + 18571) - var_1_38) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=1, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=3, var_1_33=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L122] signed long int stepLocal_0 = var_1_28; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_0=-128, stepLocal_4=-128, var_1_10=-128, var_1_11=1, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=3, var_1_33=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L123] COND TRUE stepLocal_0 >= (var_1_37 * (10u * var_1_33)) [L124] var_1_1 = (var_1_10 + var_1_10) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=1, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=3, var_1_33=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L128] unsigned long int stepLocal_2 = 1u; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_2=1, stepLocal_4=-128, var_1_10=-128, var_1_11=1, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=3, var_1_33=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L129] COND FALSE !((((((var_1_13) < (25u)) ? (var_1_13) : (25u))) + var_1_33) == stepLocal_2) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=1, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=3, var_1_33=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L132] COND TRUE var_1_1 <= var_1_33 [L133] var_1_15 = ((((var_1_11) > (var_1_37)) ? (var_1_11) : (var_1_37))) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=1, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=1, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=3, var_1_33=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L188] RET step() [L189] CALL, EXPR property() [L179] EXPR ((((((((((((var_1_28 >= (var_1_37 * (10u * var_1_33))) ? (var_1_1 == ((signed short int) (var_1_10 + var_1_10))) : (var_1_1 == ((signed short int) var_1_10))) && (var_1_18 ? (var_1_7 == ((signed char) var_1_9)) : 1)) && (((last_1_var_1_10 + var_1_7) > var_1_9) ? (var_1_10 == ((signed char) (1 - var_1_11))) : 1)) && (((var_1_7 / var_1_13) == var_1_25) ? (var_1_12 == ((signed char) var_1_9)) : ((var_1_13 >= var_1_11) ? (var_1_12 == ((signed char) var_1_11)) : (var_1_12 == ((signed char) var_1_9))))) && (((((((var_1_13) < (25u)) ? (var_1_13) : (25u))) + var_1_33) == 1u) ? (var_1_14 == ((unsigned char) (! 0))) : 1)) && ((var_1_1 <= var_1_33) ? (var_1_15 == ((unsigned long int) ((((var_1_11) > (var_1_37)) ? (var_1_11) : (var_1_37))))) : 1)) && (var_1_18 == ((unsigned char) (! (var_1_19 || var_1_20))))) && (((var_1_11 - var_1_37) != -256) ? (var_1_21 == ((float) ((((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) < (var_1_24)) ? (((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) : (var_1_24))))) : (var_1_21 == ((float) var_1_23)))) && (((- var_1_24) < var_1_23) ? (var_1_25 == ((signed char) (((((-10) < (var_1_26)) ? (-10) : (var_1_26))) + var_1_27))) : 1)) && ((last_1_var_1_18 || var_1_20) ? (var_1_28 == ((signed long int) (((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) > (last_1_var_1_25)) ? ((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) : (last_1_var_1_25))))) : (var_1_20 ? (var_1_28 == ((signed long int) ((((last_1_var_1_33) > ((last_1_var_1_39 + last_1_var_1_25))) ? (last_1_var_1_33) : ((last_1_var_1_39 + last_1_var_1_25)))))) : 1))) && ((((var_1_31 - var_1_32) + var_1_24) != var_1_23) ? (var_1_30 == ((float) ((((var_1_23) < (var_1_24)) ? (var_1_23) : (var_1_24))))) : ((var_1_28 <= var_1_10) ? (var_1_30 == ((float) var_1_23)) : 1))) && ((var_1_28 < var_1_37) ? (var_1_33 == ((unsigned short int) (((26262 - var_1_11) + 18571) - var_1_38))) : ((! var_1_18) ? ((var_1_10 != (var_1_38 & (var_1_11 - 32))) ? (var_1_33 == ((unsigned short int) ((((((var_1_35 - var_1_11) - var_1_38)) < (var_1_38)) ? (((var_1_35 - var_1_11) - var_1_38)) : (var_1_38))))) : (var_1_33 == ((unsigned short int) (var_1_35 - var_1_38)))) : ((128u > var_1_38) ? (((var_1_38 * var_1_38) == (var_1_38 & var_1_28)) ? (var_1_33 == ((unsigned short int) var_1_11)) : (var_1_33 == ((unsigned short int) ((((((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) < (var_1_38)) ? (((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) : (var_1_38)))))) : (var_1_33 == ((unsigned short int) var_1_38))))) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=1, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=3, var_1_33=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L179-L180] return (((((((((((((((var_1_28 >= (var_1_37 * (10u * var_1_33))) ? (var_1_1 == ((signed short int) (var_1_10 + var_1_10))) : (var_1_1 == ((signed short int) var_1_10))) && (var_1_18 ? (var_1_7 == ((signed char) var_1_9)) : 1)) && (((last_1_var_1_10 + var_1_7) > var_1_9) ? (var_1_10 == ((signed char) (1 - var_1_11))) : 1)) && (((var_1_7 / var_1_13) == var_1_25) ? (var_1_12 == ((signed char) var_1_9)) : ((var_1_13 >= var_1_11) ? (var_1_12 == ((signed char) var_1_11)) : (var_1_12 == ((signed char) var_1_9))))) && (((((((var_1_13) < (25u)) ? (var_1_13) : (25u))) + var_1_33) == 1u) ? (var_1_14 == ((unsigned char) (! 0))) : 1)) && ((var_1_1 <= var_1_33) ? (var_1_15 == ((unsigned long int) ((((var_1_11) > (var_1_37)) ? (var_1_11) : (var_1_37))))) : 1)) && (var_1_18 == ((unsigned char) (! (var_1_19 || var_1_20))))) && (((var_1_11 - var_1_37) != -256) ? (var_1_21 == ((float) ((((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) < (var_1_24)) ? (((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) : (var_1_24))))) : (var_1_21 == ((float) var_1_23)))) && (((- var_1_24) < var_1_23) ? (var_1_25 == ((signed char) (((((-10) < (var_1_26)) ? (-10) : (var_1_26))) + var_1_27))) : 1)) && ((last_1_var_1_18 || var_1_20) ? (var_1_28 == ((signed long int) (((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) > (last_1_var_1_25)) ? ((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) : (last_1_var_1_25))))) : (var_1_20 ? (var_1_28 == ((signed long int) ((((last_1_var_1_33) > ((last_1_var_1_39 + last_1_var_1_25))) ? (last_1_var_1_33) : ((last_1_var_1_39 + last_1_var_1_25)))))) : 1))) && ((((var_1_31 - var_1_32) + var_1_24) != var_1_23) ? (var_1_30 == ((float) ((((var_1_23) < (var_1_24)) ? (var_1_23) : (var_1_24))))) : ((var_1_28 <= var_1_10) ? (var_1_30 == ((float) var_1_23)) : 1))) && ((var_1_28 < var_1_37) ? (var_1_33 == ((unsigned short int) (((26262 - var_1_11) + 18571) - var_1_38))) : ((! var_1_18) ? ((var_1_10 != (var_1_38 & (var_1_11 - 32))) ? (var_1_33 == ((unsigned short int) ((((((var_1_35 - var_1_11) - var_1_38)) < (var_1_38)) ? (((var_1_35 - var_1_11) - var_1_38)) : (var_1_38))))) : (var_1_33 == ((unsigned short int) (var_1_35 - var_1_38)))) : ((128u > var_1_38) ? (((var_1_38 * var_1_38) == (var_1_38 & var_1_28)) ? (var_1_33 == ((unsigned short int) var_1_11)) : (var_1_33 == ((unsigned short int) ((((((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) < (var_1_38)) ? (((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) : (var_1_38)))))) : (var_1_33 == ((unsigned short int) var_1_38)))))) && (var_1_37 == ((unsigned short int) var_1_11))) && (var_1_38 == ((unsigned char) var_1_11))) && (var_1_39 == ((signed char) var_1_11)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=1, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=3, var_1_33=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=1, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=1, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-10, var_1_27=10, var_1_28=-128, var_1_30=3, var_1_33=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=-24, var_1_9=-24] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2159 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2157 mSDsluCounter, 2648 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1981 mSDsCounter, 515 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1430 IncrementalHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 515 mSolverCounterUnsat, 667 mSDtfsCounter, 1430 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 522 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=5, InterpolantAutomatonStates: 51, 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, 297 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1130 NumberOfCodeBlocks, 1130 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 980 ConstructedInterpolants, 0 QuantifiedInterpolants, 3578 SizeOfPredicates, 4 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 5790/5880 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-10-24 09:13:13,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-16.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 82fbcd39199a525399eb28d721839336007b212e1ad38780097336285e9776e8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:13:15,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:13:15,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:13:15,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:13:15,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:13:15,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:13:15,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:13:15,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:13:15,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:13:15,309 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:13:15,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:13:15,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:13:15,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:13:15,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:13:15,310 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:13:15,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:13:15,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:13:15,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:13:15,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:13:15,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:13:15,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:13:15,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:13:15,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:13:15,313 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:13:15,313 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:13:15,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:13:15,313 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:13:15,314 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:13:15,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:13:15,314 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:13:15,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:13:15,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:13:15,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:13:15,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:13:15,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:13:15,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:13:15,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:13:15,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:13:15,316 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:13:15,316 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:13:15,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:13:15,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:13:15,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:13:15,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:13:15,317 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:13:15,317 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 -> 82fbcd39199a525399eb28d721839336007b212e1ad38780097336285e9776e8 [2024-10-24 09:13:15,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:13:15,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:13:15,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:13:15,630 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:13:15,630 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:13:15,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-16.i [2024-10-24 09:13:16,980 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:13:17,207 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:13:17,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-16.i [2024-10-24 09:13:17,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49484e873/241a70c37baa4b74b4834726de9f1214/FLAG2b4deb5b1 [2024-10-24 09:13:17,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49484e873/241a70c37baa4b74b4834726de9f1214 [2024-10-24 09:13:17,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:13:17,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:13:17,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:13:17,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:13:17,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:13:17,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc50912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17, skipping insertion in model container [2024-10-24 09:13:17,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:13:17,462 WARN L248 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-16.i[916,929] [2024-10-24 09:13:17,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:13:17,559 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:13:17,567 WARN L248 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-16.i[916,929] [2024-10-24 09:13:17,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:13:17,616 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:13:17,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17 WrapperNode [2024-10-24 09:13:17,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:13:17,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:13:17,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:13:17,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:13:17,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,655 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-10-24 09:13:17,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:13:17,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:13:17,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:13:17,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:13:17,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,684 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-10-24 09:13:17,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:13:17,705 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:13:17,705 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:13:17,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:13:17,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17" (1/1) ... [2024-10-24 09:13:17,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:13:17,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:13:17,748 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-10-24 09:13:17,757 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-10-24 09:13:17,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:13:17,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:13:17,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:13:17,796 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:13:17,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:13:17,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:13:17,872 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:13:17,873 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:13:27,943 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 09:13:27,943 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:13:28,003 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:13:28,004 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:13:28,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:13:28 BoogieIcfgContainer [2024-10-24 09:13:28,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:13:28,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:13:28,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:13:28,012 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:13:28,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:13:17" (1/3) ... [2024-10-24 09:13:28,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556706d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:13:28, skipping insertion in model container [2024-10-24 09:13:28,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:13:17" (2/3) ... [2024-10-24 09:13:28,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556706d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:13:28, skipping insertion in model container [2024-10-24 09:13:28,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:13:28" (3/3) ... [2024-10-24 09:13:28,013 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-16.i [2024-10-24 09:13:28,025 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:13:28,026 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:13:28,079 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:13:28,085 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;@3fc7d74a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:13:28,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:13:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 09:13:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 09:13:28,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:13:28,101 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:13:28,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:13:28,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:13:28,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1991059636, now seen corresponding path program 1 times [2024-10-24 09:13:28,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:13:28,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438645095] [2024-10-24 09:13:28,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:28,118 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-10-24 09:13:28,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:13:28,121 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-10-24 09:13:28,125 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-10-24 09:13:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:28,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:13:28,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:13:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2024-10-24 09:13:28,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:13:28,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:13:28,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438645095] [2024-10-24 09:13:28,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438645095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:13:28,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:13:28,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:13:28,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471766289] [2024-10-24 09:13:28,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:13:28,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:13:28,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:13:28,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:13:28,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:13:28,515 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.5) internal successors, (69), 47 states have internal predecessors, (69), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 09:13:31,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:13:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:13:31,188 INFO L93 Difference]: Finished difference Result 137 states and 241 transitions. [2024-10-24 09:13:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:13:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2024-10-24 09:13:31,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:13:31,222 INFO L225 Difference]: With dead ends: 137 [2024-10-24 09:13:31,227 INFO L226 Difference]: Without dead ends: 68 [2024-10-24 09:13:31,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 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-10-24 09:13:31,234 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 09:13:31,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 09:13:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-24 09:13:31,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-24 09:13:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 09:13:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 106 transitions. [2024-10-24 09:13:31,301 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 106 transitions. Word has length 139 [2024-10-24 09:13:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:13:31,302 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 106 transitions. [2024-10-24 09:13:31,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 09:13:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 106 transitions. [2024-10-24 09:13:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 09:13:31,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:13:31,311 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:13:31,323 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-10-24 09:13:31,512 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-10-24 09:13:31,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:13:31,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:13:31,516 INFO L85 PathProgramCache]: Analyzing trace with hash -700443306, now seen corresponding path program 1 times [2024-10-24 09:13:31,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:13:31,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113521566] [2024-10-24 09:13:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:31,518 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-10-24 09:13:31,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:13:31,521 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-10-24 09:13:31,523 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-10-24 09:13:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:31,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 09:13:31,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:13:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-24 09:13:33,280 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:13:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-10-24 09:13:34,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:13:34,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113521566] [2024-10-24 09:13:34,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113521566] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:13:34,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:13:34,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2024-10-24 09:13:34,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26553864] [2024-10-24 09:13:34,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:13:34,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 09:13:34,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:13:34,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 09:13:34,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-24 09:13:34,309 INFO L87 Difference]: Start difference. First operand 68 states and 106 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-24 09:13:36,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:13:39,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:13:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:13:40,000 INFO L93 Difference]: Finished difference Result 280 states and 433 transitions. [2024-10-24 09:13:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 09:13:40,001 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 139 [2024-10-24 09:13:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:13:40,004 INFO L225 Difference]: With dead ends: 280 [2024-10-24 09:13:40,004 INFO L226 Difference]: Without dead ends: 213 [2024-10-24 09:13:40,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2024-10-24 09:13:40,012 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 200 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:13:40,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 575 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-24 09:13:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-24 09:13:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 176. [2024-10-24 09:13:40,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 122 states have internal predecessors, (173), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 09:13:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 275 transitions. [2024-10-24 09:13:40,082 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 275 transitions. Word has length 139 [2024-10-24 09:13:40,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:13:40,083 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 275 transitions. [2024-10-24 09:13:40,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-10-24 09:13:40,083 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 275 transitions. [2024-10-24 09:13:40,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 09:13:40,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:13:40,085 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:13:40,109 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-10-24 09:13:40,286 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-10-24 09:13:40,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:13:40,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:13:40,287 INFO L85 PathProgramCache]: Analyzing trace with hash 264781873, now seen corresponding path program 1 times [2024-10-24 09:13:40,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:13:40,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585612981] [2024-10-24 09:13:40,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:40,288 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-10-24 09:13:40,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:13:40,290 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-10-24 09:13:40,293 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-10-24 09:13:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:40,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 09:13:40,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:13:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-24 09:13:40,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:13:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 09:13:41,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:13:41,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585612981] [2024-10-24 09:13:41,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585612981] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 09:13:41,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 09:13:41,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-24 09:13:41,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778772277] [2024-10-24 09:13:41,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:13:41,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:13:41,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:13:41,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:13:41,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:13:41,212 INFO L87 Difference]: Start difference. First operand 176 states and 275 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 09:13:43,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:13:43,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:13:43,362 INFO L93 Difference]: Finished difference Result 363 states and 558 transitions. [2024-10-24 09:13:43,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:13:43,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2024-10-24 09:13:43,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:13:43,366 INFO L225 Difference]: With dead ends: 363 [2024-10-24 09:13:43,366 INFO L226 Difference]: Without dead ends: 188 [2024-10-24 09:13:43,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:13:43,368 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 42 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:13:43,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 145 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 09:13:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-24 09:13:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-10-24 09:13:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 130 states have (on average 1.3692307692307693) internal successors, (178), 131 states have internal predecessors, (178), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 09:13:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 280 transitions. [2024-10-24 09:13:43,412 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 280 transitions. Word has length 140 [2024-10-24 09:13:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:13:43,414 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 280 transitions. [2024-10-24 09:13:43,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 09:13:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 280 transitions. [2024-10-24 09:13:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 09:13:43,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:13:43,418 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:13:43,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 09:13:43,623 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 [2024-10-24 09:13:43,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:13:43,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:13:43,623 INFO L85 PathProgramCache]: Analyzing trace with hash 6616435, now seen corresponding path program 1 times [2024-10-24 09:13:43,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:13:43,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10045739] [2024-10-24 09:13:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:43,624 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-10-24 09:13:43,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:13:43,630 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:13:43,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 09:13:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:43,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 09:13:43,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:13:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-24 09:13:44,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:13:47,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:13:47,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10045739] [2024-10-24 09:13:47,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10045739] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:13:47,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [946089901] [2024-10-24 09:13:47,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:47,679 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 09:13:47,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 09:13:47,686 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 09:13:47,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-24 09:13:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:48,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 09:13:48,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:13:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-24 09:13:49,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:13:50,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [946089901] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:13:50,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:13:50,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-10-24 09:13:50,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119933691] [2024-10-24 09:13:50,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:13:50,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 09:13:50,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:13:50,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 09:13:50,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:13:50,397 INFO L87 Difference]: Start difference. First operand 188 states and 280 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 09:13:53,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 09:13:57,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:13:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:13:57,577 INFO L93 Difference]: Finished difference Result 572 states and 839 transitions. [2024-10-24 09:13:57,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 09:13:57,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 140 [2024-10-24 09:13:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:13:57,584 INFO L225 Difference]: With dead ends: 572 [2024-10-24 09:13:57,584 INFO L226 Difference]: Without dead ends: 385 [2024-10-24 09:13:57,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-10-24 09:13:57,592 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 77 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:13:57,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 370 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-10-24 09:13:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-24 09:13:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 368. [2024-10-24 09:13:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 250 states have (on average 1.312) internal successors, (328), 252 states have internal predecessors, (328), 102 states have call successors, (102), 15 states have call predecessors, (102), 15 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-24 09:13:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 532 transitions. [2024-10-24 09:13:57,680 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 532 transitions. Word has length 140 [2024-10-24 09:13:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:13:57,681 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 532 transitions. [2024-10-24 09:13:57,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-24 09:13:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 532 transitions. [2024-10-24 09:13:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 09:13:57,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:13:57,687 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:13:57,705 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 (5)] Forceful destruction successful, exit code 0 [2024-10-24 09:13:57,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-10-24 09:13:58,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 09:13:58,092 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:13:58,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:13:58,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1768390927, now seen corresponding path program 1 times [2024-10-24 09:13:58,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:13:58,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945638363] [2024-10-24 09:13:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:13:58,095 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-10-24 09:13:58,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:13:58,096 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10-24 09:13:58,098 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 (7)] Waiting until timeout for monitored process [2024-10-24 09:13:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:13:58,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 09:13:58,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:13:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-24 09:13:58,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:13:58,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:13:58,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945638363] [2024-10-24 09:13:58,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945638363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:13:58,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:13:58,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:13:58,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316518525] [2024-10-24 09:13:58,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:13:58,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:13:58,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:13:58,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:13:58,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:13:58,750 INFO L87 Difference]: Start difference. First operand 368 states and 532 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 09:14:02,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 09:14:05,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-24 09:14:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:14:05,743 INFO L93 Difference]: Finished difference Result 996 states and 1445 transitions. [2024-10-24 09:14:05,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 09:14:05,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2024-10-24 09:14:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:14:05,751 INFO L225 Difference]: With dead ends: 996 [2024-10-24 09:14:05,751 INFO L226 Difference]: Without dead ends: 629 [2024-10-24 09:14:05,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:14:05,753 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 155 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-10-24 09:14:05,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 410 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-10-24 09:14:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-10-24 09:14:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 432. [2024-10-24 09:14:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 289 states have (on average 1.259515570934256) internal successors, (364), 292 states have internal predecessors, (364), 123 states have call successors, (123), 19 states have call predecessors, (123), 19 states have return successors, (123), 120 states have call predecessors, (123), 123 states have call successors, (123) [2024-10-24 09:14:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 610 transitions. [2024-10-24 09:14:05,822 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 610 transitions. Word has length 140 [2024-10-24 09:14:05,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:14:05,823 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 610 transitions. [2024-10-24 09:14:05,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-24 09:14:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 610 transitions. [2024-10-24 09:14:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-24 09:14:05,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:14:05,824 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 09:14:05,837 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 (7)] Ended with exit code 0 [2024-10-24 09:14:06,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-10-24 09:14:06,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:14:06,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:14:06,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1766543885, now seen corresponding path program 1 times [2024-10-24 09:14:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:14:06,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031245894] [2024-10-24 09:14:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:14:06,031 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-10-24 09:14:06,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:14:06,034 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10-24 09:14:06,035 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 (8)] Waiting until timeout for monitored process [2024-10-24 09:14:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:14:06,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-24 09:14:06,276 INFO L278 TraceCheckSpWp]: Computing forward predicates...