./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.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 ffde3abd1302fbd87206750d0310c01693ddf151d98835d8cfad33c14bb4faac --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:28:43,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:28:43,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:28:43,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:28:43,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:28:43,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:28:43,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:28:43,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:28:43,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:28:43,309 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:28:43,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:28:43,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:28:43,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:28:43,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:28:43,313 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:28:43,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:28:43,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:28:43,314 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:28:43,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:28:43,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:28:43,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:28:43,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:28:43,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:28:43,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:28:43,316 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:28:43,316 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:28:43,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:28:43,316 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:28:43,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:28:43,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:28:43,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:28:43,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:28:43,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:28:43,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:28:43,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:28:43,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:28:43,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:28:43,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:28:43,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:28:43,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:28:43,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:28:43,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:28:43,320 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 -> ffde3abd1302fbd87206750d0310c01693ddf151d98835d8cfad33c14bb4faac [2024-11-08 23:28:43,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:28:43,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:28:43,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:28:43,562 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:28:43,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:28:43,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i [2024-11-08 23:28:44,911 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:28:45,109 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:28:45,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i [2024-11-08 23:28:45,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7663c6ec/21dd3c5a2213444fa3c94f8780538e5e/FLAG77738cd14 [2024-11-08 23:28:45,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7663c6ec/21dd3c5a2213444fa3c94f8780538e5e [2024-11-08 23:28:45,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:28:45,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:28:45,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:28:45,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:28:45,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:28:45,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707b36a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45, skipping insertion in model container [2024-11-08 23:28:45,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:28:45,388 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i[916,929] [2024-11-08 23:28:45,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:28:45,486 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:28:45,499 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i[916,929] [2024-11-08 23:28:45,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:28:45,580 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:28:45,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45 WrapperNode [2024-11-08 23:28:45,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:28:45,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:28:45,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:28:45,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:28:45,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,637 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 257 [2024-11-08 23:28:45,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:28:45,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:28:45,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:28:45,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:28:45,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,681 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:28:45,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:28:45,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:28:45,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:28:45,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:28:45,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45" (1/1) ... [2024-11-08 23:28:45,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:28:45,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:28:45,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:28:45,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:28:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:28:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:28:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:28:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:28:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:28:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:28:45,944 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:28:45,946 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:28:46,301 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-08 23:28:46,302 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:28:46,314 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:28:46,315 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:28:46,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:28:46 BoogieIcfgContainer [2024-11-08 23:28:46,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:28:46,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:28:46,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:28:46,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:28:46,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:28:45" (1/3) ... [2024-11-08 23:28:46,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df835e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:28:46, skipping insertion in model container [2024-11-08 23:28:46,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:45" (2/3) ... [2024-11-08 23:28:46,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df835e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:28:46, skipping insertion in model container [2024-11-08 23:28:46,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:28:46" (3/3) ... [2024-11-08 23:28:46,323 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-22.i [2024-11-08 23:28:46,337 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:28:46,337 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:28:46,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:28:46,411 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;@52ac9bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:28:46,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:28:46,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 23:28:46,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 23:28:46,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:28:46,435 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:28:46,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:28:46,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:28:46,440 INFO L85 PathProgramCache]: Analyzing trace with hash 571954899, now seen corresponding path program 1 times [2024-11-08 23:28:46,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:28:46,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876679746] [2024-11-08 23:28:46,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:28:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:28:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:28:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:28:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:28:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:28:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:28:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:28:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:28:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:28:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:28:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:28:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:28:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:28:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:28:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:28:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:28:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:28:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:28:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:28:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:28:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:28:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:28:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:28:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:28:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:28:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:28:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:28:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:28:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:28:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 23:28:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 23:28:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:28:47,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:28:47,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876679746] [2024-11-08 23:28:47,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876679746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:28:47,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:28:47,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:28:47,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539890780] [2024-11-08 23:28:47,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:28:47,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:28:47,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:28:47,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:28:47,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:28:47,468 INFO L87 Difference]: Start difference. First operand has 101 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 68 states have internal predecessors, (96), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:28:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:28:47,796 INFO L93 Difference]: Finished difference Result 325 states and 582 transitions. [2024-11-08 23:28:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:28:47,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-11-08 23:28:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:28:47,813 INFO L225 Difference]: With dead ends: 325 [2024-11-08 23:28:47,814 INFO L226 Difference]: Without dead ends: 227 [2024-11-08 23:28:47,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:28:47,826 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 200 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:28:47,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 666 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:28:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-08 23:28:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 212. [2024-11-08 23:28:47,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 147 states have (on average 1.4217687074829932) internal successors, (209), 147 states have internal predecessors, (209), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 23:28:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 333 transitions. [2024-11-08 23:28:47,929 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 333 transitions. Word has length 199 [2024-11-08 23:28:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:28:47,929 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 333 transitions. [2024-11-08 23:28:47,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:28:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 333 transitions. [2024-11-08 23:28:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 23:28:47,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:28:47,935 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:28:47,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:28:47,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:28:47,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:28:47,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1650107533, now seen corresponding path program 1 times [2024-11-08 23:28:47,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:28:47,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849311844] [2024-11-08 23:28:47,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:28:47,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:28:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:28:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:28:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:28:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:28:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:28:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:28:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:28:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:28:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:28:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:28:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:28:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:28:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:28:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:28:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:28:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:28:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:28:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:28:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:28:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:28:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:28:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:28:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:28:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:28:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:28:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:28:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:28:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:28:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 23:28:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 23:28:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:28:48,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:28:48,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849311844] [2024-11-08 23:28:48,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849311844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:28:48,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:28:48,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:28:48,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644181590] [2024-11-08 23:28:48,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:28:48,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:28:48,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:28:48,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:28:48,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:28:48,533 INFO L87 Difference]: Start difference. First operand 212 states and 333 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:28:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:28:48,746 INFO L93 Difference]: Finished difference Result 550 states and 861 transitions. [2024-11-08 23:28:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:28:48,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2024-11-08 23:28:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:28:48,750 INFO L225 Difference]: With dead ends: 550 [2024-11-08 23:28:48,750 INFO L226 Difference]: Without dead ends: 341 [2024-11-08 23:28:48,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:28:48,752 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 120 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:28:48,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 404 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:28:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-08 23:28:48,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 315. [2024-11-08 23:28:48,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 218 states have (on average 1.426605504587156) internal successors, (311), 218 states have internal predecessors, (311), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 23:28:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 497 transitions. [2024-11-08 23:28:48,783 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 497 transitions. Word has length 200 [2024-11-08 23:28:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:28:48,784 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 497 transitions. [2024-11-08 23:28:48,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:28:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 497 transitions. [2024-11-08 23:28:48,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 23:28:48,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:28:48,786 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:28:48,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:28:48,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:28:48,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:28:48,787 INFO L85 PathProgramCache]: Analyzing trace with hash 84159315, now seen corresponding path program 1 times [2024-11-08 23:28:48,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:28:48,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454170746] [2024-11-08 23:28:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:28:48,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:28:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:28:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:28:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:28:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:28:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:28:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:28:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:28:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:28:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:28:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:28:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:28:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:28:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:28:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:28:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:28:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:28:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:28:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:28:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:28:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:28:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:28:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:28:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:28:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:28:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:28:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:28:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:28:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:28:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 23:28:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 23:28:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:28:49,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:28:49,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454170746] [2024-11-08 23:28:49,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454170746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:28:49,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:28:49,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:28:49,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739345741] [2024-11-08 23:28:49,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:28:49,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:28:49,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:28:49,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:28:49,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:28:49,301 INFO L87 Difference]: Start difference. First operand 315 states and 497 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:28:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:28:49,492 INFO L93 Difference]: Finished difference Result 795 states and 1259 transitions. [2024-11-08 23:28:49,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:28:49,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2024-11-08 23:28:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:28:49,496 INFO L225 Difference]: With dead ends: 795 [2024-11-08 23:28:49,496 INFO L226 Difference]: Without dead ends: 570 [2024-11-08 23:28:49,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:28:49,498 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 82 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:28:49,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 333 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:28:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-08 23:28:49,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 563. [2024-11-08 23:28:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 402 states have (on average 1.435323383084577) internal successors, (577), 402 states have internal predecessors, (577), 155 states have call successors, (155), 5 states have call predecessors, (155), 5 states have return successors, (155), 155 states have call predecessors, (155), 155 states have call successors, (155) [2024-11-08 23:28:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 887 transitions. [2024-11-08 23:28:49,540 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 887 transitions. Word has length 204 [2024-11-08 23:28:49,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:28:49,540 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 887 transitions. [2024-11-08 23:28:49,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:28:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 887 transitions. [2024-11-08 23:28:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 23:28:49,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:28:49,543 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:28:49,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:28:49,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:28:49,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:28:49,543 INFO L85 PathProgramCache]: Analyzing trace with hash -926957935, now seen corresponding path program 1 times [2024-11-08 23:28:49,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:28:49,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62305637] [2024-11-08 23:28:49,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:28:49,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:28:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:28:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:28:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:28:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:28:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:28:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:28:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:28:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:28:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:28:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:28:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:28:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:28:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:28:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:28:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:28:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:28:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:28:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:28:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:28:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:28:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:28:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:28:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:28:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:28:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:28:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:28:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:28:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:28:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 23:28:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 23:28:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:28:49,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:28:49,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62305637] [2024-11-08 23:28:49,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62305637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:28:49,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:28:49,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 23:28:49,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495024229] [2024-11-08 23:28:49,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:28:49,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:28:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:28:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:28:49,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:28:49,962 INFO L87 Difference]: Start difference. First operand 563 states and 887 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:28:50,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:28:50,204 INFO L93 Difference]: Finished difference Result 1424 states and 2241 transitions. [2024-11-08 23:28:50,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:28:50,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2024-11-08 23:28:50,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:28:50,215 INFO L225 Difference]: With dead ends: 1424 [2024-11-08 23:28:50,216 INFO L226 Difference]: Without dead ends: 971 [2024-11-08 23:28:50,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:28:50,220 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 222 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:28:50,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 512 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:28:50,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-08 23:28:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 807. [2024-11-08 23:28:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 582 states have (on average 1.4398625429553265) internal successors, (838), 582 states have internal predecessors, (838), 217 states have call successors, (217), 7 states have call predecessors, (217), 7 states have return successors, (217), 217 states have call predecessors, (217), 217 states have call successors, (217) [2024-11-08 23:28:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1272 transitions. [2024-11-08 23:28:50,317 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1272 transitions. Word has length 204 [2024-11-08 23:28:50,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:28:50,318 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1272 transitions. [2024-11-08 23:28:50,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:28:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1272 transitions. [2024-11-08 23:28:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 23:28:50,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:28:50,321 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:28:50,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:28:50,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:28:50,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:28:50,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1984379059, now seen corresponding path program 1 times [2024-11-08 23:28:50,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:28:50,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276901452] [2024-11-08 23:28:50,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:28:50,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:28:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:28:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:28:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:28:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:28:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:28:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:28:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:28:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:28:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:28:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:28:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:28:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:28:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:28:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:28:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:28:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:28:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:28:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:28:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:28:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:28:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:28:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:28:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:28:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:28:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:28:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:28:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:28:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:28:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 23:28:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 23:28:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:28:50,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:28:50,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276901452] [2024-11-08 23:28:50,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276901452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:28:50,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:28:50,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:28:50,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720014471] [2024-11-08 23:28:50,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:28:50,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:28:50,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:28:50,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:28:50,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:28:50,603 INFO L87 Difference]: Start difference. First operand 807 states and 1272 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:28:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:28:50,716 INFO L93 Difference]: Finished difference Result 1962 states and 3090 transitions. [2024-11-08 23:28:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:28:50,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-08 23:28:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:28:50,724 INFO L225 Difference]: With dead ends: 1962 [2024-11-08 23:28:50,725 INFO L226 Difference]: Without dead ends: 1259 [2024-11-08 23:28:50,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:28:50,728 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 87 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:28:50,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 499 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:28:50,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2024-11-08 23:28:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 905. [2024-11-08 23:28:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 680 states have (on average 1.4338235294117647) internal successors, (975), 680 states have internal predecessors, (975), 217 states have call successors, (217), 7 states have call predecessors, (217), 7 states have return successors, (217), 217 states have call predecessors, (217), 217 states have call successors, (217) [2024-11-08 23:28:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1409 transitions. [2024-11-08 23:28:50,816 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1409 transitions. Word has length 205 [2024-11-08 23:28:50,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:28:50,816 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1409 transitions. [2024-11-08 23:28:50,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:28:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1409 transitions. [2024-11-08 23:28:50,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 23:28:50,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:28:50,818 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:28:50,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:28:50,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:28:50,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:28:50,819 INFO L85 PathProgramCache]: Analyzing trace with hash 295435317, now seen corresponding path program 1 times [2024-11-08 23:28:50,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:28:50,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670194200] [2024-11-08 23:28:50,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:28:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:28:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:28:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:28:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:28:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:28:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:28:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:28:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:28:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:28:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:28:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:28:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:28:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:28:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:28:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:28:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:28:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:28:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:28:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:28:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:28:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:28:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:28:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:28:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:28:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:28:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:28:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:28:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:28:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:28:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 23:28:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 23:28:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-08 23:28:51,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:28:51,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670194200] [2024-11-08 23:28:51,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670194200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:28:51,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976043407] [2024-11-08 23:28:51,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:28:51,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:28:51,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:28:51,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:28:51,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:28:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:51,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 23:28:51,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:28:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 852 proven. 63 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2024-11-08 23:28:53,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:28:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 126 proven. 51 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2024-11-08 23:28:54,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976043407] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:28:54,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:28:54,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 34 [2024-11-08 23:28:54,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766066638] [2024-11-08 23:28:54,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:28:54,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 23:28:54,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:28:54,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 23:28:54,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 23:28:54,732 INFO L87 Difference]: Start difference. First operand 905 states and 1409 transitions. Second operand has 34 states, 32 states have (on average 4.59375) internal successors, (147), 32 states have internal predecessors, (147), 11 states have call successors, (93), 5 states have call predecessors, (93), 9 states have return successors, (93), 10 states have call predecessors, (93), 11 states have call successors, (93) [2024-11-08 23:28:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:28:57,226 INFO L93 Difference]: Finished difference Result 2732 states and 4187 transitions. [2024-11-08 23:28:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-08 23:28:57,227 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 4.59375) internal successors, (147), 32 states have internal predecessors, (147), 11 states have call successors, (93), 5 states have call predecessors, (93), 9 states have return successors, (93), 10 states have call predecessors, (93), 11 states have call successors, (93) Word has length 205 [2024-11-08 23:28:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:28:57,237 INFO L225 Difference]: With dead ends: 2732 [2024-11-08 23:28:57,237 INFO L226 Difference]: Without dead ends: 1997 [2024-11-08 23:28:57,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=841, Invalid=2699, Unknown=0, NotChecked=0, Total=3540 [2024-11-08 23:28:57,240 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 797 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 23:28:57,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1423 Invalid, 2203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 23:28:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2024-11-08 23:28:57,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1284. [2024-11-08 23:28:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 923 states have (on average 1.4019501625135429) internal successors, (1294), 929 states have internal predecessors, (1294), 343 states have call successors, (343), 17 states have call predecessors, (343), 17 states have return successors, (343), 337 states have call predecessors, (343), 343 states have call successors, (343) [2024-11-08 23:28:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1980 transitions. [2024-11-08 23:28:57,366 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1980 transitions. Word has length 205 [2024-11-08 23:28:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:28:57,367 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 1980 transitions. [2024-11-08 23:28:57,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 4.59375) internal successors, (147), 32 states have internal predecessors, (147), 11 states have call successors, (93), 5 states have call predecessors, (93), 9 states have return successors, (93), 10 states have call predecessors, (93), 11 states have call successors, (93) [2024-11-08 23:28:57,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1980 transitions. [2024-11-08 23:28:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 23:28:57,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:28:57,369 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:28:57,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:28:57,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 23:28:57,571 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:28:57,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:28:57,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1851169506, now seen corresponding path program 1 times [2024-11-08 23:28:57,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:28:57,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812679618] [2024-11-08 23:28:57,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:28:57,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:28:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:28:57,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868881111] [2024-11-08 23:28:57,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:28:57,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:28:57,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:28:57,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:28:57,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:28:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:58,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-08 23:28:58,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:29:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1498 proven. 186 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-08 23:29:02,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:29:21,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:29:21,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812679618] [2024-11-08 23:29:21,624 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:29:21,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868881111] [2024-11-08 23:29:21,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868881111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:29:21,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:29:21,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2024-11-08 23:29:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724289692] [2024-11-08 23:29:21,624 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 23:29:21,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-08 23:29:21,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:29:21,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-08 23:29:21,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=3000, Unknown=2, NotChecked=0, Total=3660 [2024-11-08 23:29:21,627 INFO L87 Difference]: Start difference. First operand 1284 states and 1980 transitions. Second operand has 50 states, 50 states have (on average 2.08) internal successors, (104), 44 states have internal predecessors, (104), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31) [2024-11-08 23:29:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:29:25,883 INFO L93 Difference]: Finished difference Result 2409 states and 3580 transitions. [2024-11-08 23:29:25,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-08 23:29:25,883 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 44 states have internal predecessors, (104), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31) Word has length 205 [2024-11-08 23:29:25,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:29:25,901 INFO L225 Difference]: With dead ends: 2409 [2024-11-08 23:29:25,902 INFO L226 Difference]: Without dead ends: 2038 [2024-11-08 23:29:25,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3404 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=2252, Invalid=10402, Unknown=2, NotChecked=0, Total=12656 [2024-11-08 23:29:25,907 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 696 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:29:25,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1738 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1858 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 23:29:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2024-11-08 23:29:26,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1784. [2024-11-08 23:29:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1295 states have (on average 1.3606177606177605) internal successors, (1762), 1311 states have internal predecessors, (1762), 449 states have call successors, (449), 39 states have call predecessors, (449), 39 states have return successors, (449), 433 states have call predecessors, (449), 449 states have call successors, (449) [2024-11-08 23:29:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2660 transitions. [2024-11-08 23:29:26,075 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2660 transitions. Word has length 205 [2024-11-08 23:29:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:29:26,075 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2660 transitions. [2024-11-08 23:29:26,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.08) internal successors, (104), 44 states have internal predecessors, (104), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31) [2024-11-08 23:29:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2660 transitions. [2024-11-08 23:29:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 23:29:26,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:26,079 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:29:26,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 23:29:26,279 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,SelfDestructingSolverStorable6 [2024-11-08 23:29:26,280 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:26,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:26,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1422729436, now seen corresponding path program 1 times [2024-11-08 23:29:26,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:29:26,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029812410] [2024-11-08 23:29:26,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:26,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:29:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:29:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:29:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:29:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:29:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:29:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:29:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:29:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:29:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:29:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:29:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:29:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:29:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:29:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:29:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:29:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:29:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:29:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:29:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:29:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:29:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:29:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:29:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:29:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:29:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:29:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:29:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:29:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:29:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 23:29:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 23:29:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:29:26,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:29:26,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029812410] [2024-11-08 23:29:26,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029812410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:29:26,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:29:26,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:29:26,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435954124] [2024-11-08 23:29:26,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:29:26,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:29:26,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:29:26,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:29:26,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:29:26,401 INFO L87 Difference]: Start difference. First operand 1784 states and 2660 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:29:26,585 INFO L93 Difference]: Finished difference Result 3592 states and 5405 transitions. [2024-11-08 23:29:26,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:29:26,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-08 23:29:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:29:26,597 INFO L225 Difference]: With dead ends: 3592 [2024-11-08 23:29:26,597 INFO L226 Difference]: Without dead ends: 2165 [2024-11-08 23:29:26,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:29:26,604 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 40 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:29:26,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 291 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:29:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2024-11-08 23:29:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1957. [2024-11-08 23:29:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 1468 states have (on average 1.3732970027247957) internal successors, (2016), 1484 states have internal predecessors, (2016), 449 states have call successors, (449), 39 states have call predecessors, (449), 39 states have return successors, (449), 433 states have call predecessors, (449), 449 states have call successors, (449) [2024-11-08 23:29:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 2914 transitions. [2024-11-08 23:29:26,781 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 2914 transitions. Word has length 205 [2024-11-08 23:29:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:29:26,782 INFO L471 AbstractCegarLoop]: Abstraction has 1957 states and 2914 transitions. [2024-11-08 23:29:26,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 2914 transitions. [2024-11-08 23:29:26,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 23:29:26,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:26,786 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:29:26,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 23:29:26,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:26,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:26,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1789129892, now seen corresponding path program 1 times [2024-11-08 23:29:26,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:29:26,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185498919] [2024-11-08 23:29:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:26,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:29:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:29:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:29:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:29:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:26,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:29:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:29:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:29:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:29:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:29:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:29:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:29:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:29:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:29:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:29:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 23:29:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:29:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:29:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:29:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 23:29:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 23:29:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 23:29:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 23:29:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 23:29:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 23:29:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 23:29:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 23:29:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 23:29:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 23:29:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 23:29:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 23:29:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 23:29:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:29:27,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:29:27,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185498919] [2024-11-08 23:29:27,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185498919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:29:27,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:29:27,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:29:27,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796081734] [2024-11-08 23:29:27,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:29:27,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:29:27,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:29:27,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:29:27,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:29:27,106 INFO L87 Difference]: Start difference. First operand 1957 states and 2914 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:27,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:29:27,537 INFO L93 Difference]: Finished difference Result 3616 states and 5405 transitions. [2024-11-08 23:29:27,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:29:27,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-08 23:29:27,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:29:27,550 INFO L225 Difference]: With dead ends: 3616 [2024-11-08 23:29:27,551 INFO L226 Difference]: Without dead ends: 2674 [2024-11-08 23:29:27,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:29:27,557 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 177 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:29:27,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 643 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:29:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2024-11-08 23:29:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2444. [2024-11-08 23:29:27,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 1788 states have (on average 1.3450782997762865) internal successors, (2405), 1811 states have internal predecessors, (2405), 606 states have call successors, (606), 49 states have call predecessors, (606), 49 states have return successors, (606), 583 states have call predecessors, (606), 606 states have call successors, (606) [2024-11-08 23:29:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3617 transitions. [2024-11-08 23:29:27,780 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3617 transitions. Word has length 205 [2024-11-08 23:29:27,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:29:27,782 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 3617 transitions. [2024-11-08 23:29:27,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3617 transitions. [2024-11-08 23:29:27,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 23:29:27,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:27,784 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:29:27,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 23:29:27,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:27,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:27,784 INFO L85 PathProgramCache]: Analyzing trace with hash -537705163, now seen corresponding path program 1 times [2024-11-08 23:29:27,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:29:27,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132868275] [2024-11-08 23:29:27,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:27,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:29:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:29:28,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [310943045] [2024-11-08 23:29:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:28,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:29:28,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:29:28,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:29:28,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 23:29:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:29:28,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:29:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:29:28,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:29:28,370 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:29:28,371 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:29:28,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 23:29:28,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:29:28,576 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:29:28,705 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:29:28,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:29:28 BoogieIcfgContainer [2024-11-08 23:29:28,708 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:29:28,709 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:29:28,709 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:29:28,709 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:29:28,710 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:28:46" (3/4) ... [2024-11-08 23:29:28,712 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:29:28,713 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:29:28,714 INFO L158 Benchmark]: Toolchain (without parser) took 43564.00ms. Allocated memory was 167.8MB in the beginning and 796.9MB in the end (delta: 629.1MB). Free memory was 94.2MB in the beginning and 645.7MB in the end (delta: -551.5MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2024-11-08 23:29:28,714 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:29:28,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.05ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 128.1MB in the end (delta: -34.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-08 23:29:28,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.57ms. Allocated memory is still 167.8MB. Free memory was 128.1MB in the beginning and 121.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:29:28,714 INFO L158 Benchmark]: Boogie Preprocessor took 89.41ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 111.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 23:29:28,715 INFO L158 Benchmark]: RCFGBuilder took 586.73ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 75.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-08 23:29:28,715 INFO L158 Benchmark]: TraceAbstraction took 42391.03ms. Allocated memory was 167.8MB in the beginning and 796.9MB in the end (delta: 629.1MB). Free memory was 74.7MB in the beginning and 646.8MB in the end (delta: -572.1MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. [2024-11-08 23:29:28,715 INFO L158 Benchmark]: Witness Printer took 4.65ms. Allocated memory is still 796.9MB. Free memory is still 645.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:29:28,716 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.15ms. Allocated memory is still 167.8MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.05ms. Allocated memory is still 167.8MB. Free memory was 94.1MB in the beginning and 128.1MB in the end (delta: -34.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.57ms. Allocated memory is still 167.8MB. Free memory was 128.1MB in the beginning and 121.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.41ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 111.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 586.73ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 75.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 42391.03ms. Allocated memory was 167.8MB in the beginning and 796.9MB in the end (delta: 629.1MB). Free memory was 74.7MB in the beginning and 646.8MB in the end (delta: -572.1MB). Peak memory consumption was 58.0MB. Max. memory is 16.1GB. * Witness Printer took 4.65ms. Allocated memory is still 796.9MB. Free memory is still 645.7MB. 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 204, overapproximation of someBinaryDOUBLEComparisonOperation at line 204, overapproximation of bitwiseOr at line 204. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed short int var_1_6 = -1; [L24] unsigned char var_1_7 = 1; [L25] unsigned char var_1_8 = 1; [L26] signed char var_1_9 = -128; [L27] signed char var_1_12 = 10; [L28] signed char var_1_13 = -64; [L29] signed char var_1_14 = 1; [L30] signed char var_1_15 = -25; [L31] unsigned short int var_1_16 = 256; [L32] signed char var_1_18 = 4; [L33] float var_1_19 = 100.5; [L34] float var_1_20 = 4.5; [L35] signed char var_1_21 = 0; [L36] signed char var_1_22 = 64; [L37] signed char var_1_23 = 2; [L38] signed char var_1_24 = 4; [L39] unsigned long int var_1_25 = 8; [L40] unsigned char var_1_27 = 50; [L41] unsigned char var_1_28 = 5; [L42] signed short int var_1_29 = 32; [L43] signed long int var_1_30 = 1; [L44] signed long int var_1_31 = 0; [L45] unsigned char var_1_33 = 2; [L46] unsigned char var_1_34 = 128; [L47] unsigned char var_1_35 = 2; [L48] unsigned char var_1_36 = 200; [L49] unsigned char var_1_37 = 32; [L50] double var_1_38 = 10.3; [L51] signed short int var_1_39 = -256; [L52] signed short int last_1_var_1_6 = -1; [L53] signed char last_1_var_1_9 = -128; [L54] unsigned short int last_1_var_1_16 = 256; [L55] signed char last_1_var_1_18 = 4; [L56] float last_1_var_1_19 = 100.5; [L57] unsigned long int last_1_var_1_25 = 8; [L58] unsigned char last_1_var_1_27 = 50; [L59] signed short int last_1_var_1_29 = 32; [L60] unsigned char last_1_var_1_33 = 2; [L61] unsigned char last_1_var_1_35 = 2; VAL [isInitial=0, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=1, var_1_8=1, var_1_9=-128] [L208] isInitial = 1 [L209] FCALL initially() [L210] COND TRUE 1 [L211] CALL updateLastVariables() [L192] last_1_var_1_6 = var_1_6 [L193] last_1_var_1_9 = var_1_9 [L194] last_1_var_1_16 = var_1_16 [L195] last_1_var_1_18 = var_1_18 [L196] last_1_var_1_19 = var_1_19 [L197] last_1_var_1_25 = var_1_25 [L198] last_1_var_1_27 = var_1_27 [L199] last_1_var_1_29 = var_1_29 [L200] last_1_var_1_33 = var_1_33 [L201] last_1_var_1_35 = var_1_35 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=1, var_1_8=1, var_1_9=-128] [L211] RET updateLastVariables() [L212] CALL updateVariables() [L143] var_1_7 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L145] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L145] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L146] var_1_8 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L148] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L148] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L149] var_1_12 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L150] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L151] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L151] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L152] var_1_13 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L153] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L154] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L154] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L155] var_1_14 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L156] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L157] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L157] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L158] var_1_15 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L159] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L160] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L160] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L161] var_1_20 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L162] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L163] var_1_22 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_22 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L164] RET assume_abort_if_not(var_1_22 >= -1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L165] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L165] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L166] var_1_23 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L167] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L168] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L168] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L169] var_1_24 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L170] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L171] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L171] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L172] var_1_28 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L173] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L174] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L174] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L175] var_1_30 = __VERIFIER_nondet_long() [L176] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L176] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L177] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L177] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L178] var_1_31 = __VERIFIER_nondet_long() [L179] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L179] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L180] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L180] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L181] var_1_34 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_34 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L182] RET assume_abort_if_not(var_1_34 >= 127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L183] CALL assume_abort_if_not(var_1_34 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L183] RET assume_abort_if_not(var_1_34 <= 254) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L184] var_1_36 = __VERIFIER_nondet_uchar() [L185] CALL assume_abort_if_not(var_1_36 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L185] RET assume_abort_if_not(var_1_36 >= 190) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L186] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L186] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L187] var_1_37 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_37 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L188] RET assume_abort_if_not(var_1_37 >= 31) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L189] CALL assume_abort_if_not(var_1_37 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L189] RET assume_abort_if_not(var_1_37 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L212] RET updateVariables() [L213] CALL step() [L65] signed long int stepLocal_0 = 50 * last_1_var_1_29; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_0=1600, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L66] EXPR last_1_var_1_16 | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_0=1600, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L66] COND FALSE !((last_1_var_1_16 | last_1_var_1_9) >= stepLocal_0) [L69] COND FALSE !((last_1_var_1_19 + last_1_var_1_19) > 200.875f) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L76] signed long int stepLocal_4 = last_1_var_1_9; [L77] signed long int stepLocal_3 = var_1_24 % var_1_34; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_3=62, stepLocal_4=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L78] COND FALSE !(last_1_var_1_16 <= stepLocal_4) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_3=62, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L81] COND TRUE stepLocal_3 >= last_1_var_1_27 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L82] COND FALSE !(\read(var_1_7)) [L85] var_1_33 = var_1_28 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=50, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L89] var_1_19 = var_1_20 [L90] var_1_21 = ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24))))) [L91] var_1_27 = ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28) [L92] var_1_38 = var_1_20 [L93] var_1_39 = 128 [L94] unsigned char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=8, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L95] COND FALSE !(var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) [L100] var_1_25 = 2u VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=256, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L102] COND FALSE !(\read(var_1_7)) [L109] var_1_16 = var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L111] signed long int stepLocal_5 = var_1_30 + var_1_39; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, stepLocal_5=128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L112] COND TRUE (var_1_25 - last_1_var_1_35) <= stepLocal_5 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=2, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L113] COND FALSE !(\read(var_1_7)) [L116] var_1_35 = ((var_1_36 - (var_1_37 - var_1_30)) - ((((var_1_28) < (var_1_24)) ? (var_1_28) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L119] unsigned short int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_1=32, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L120] COND TRUE stepLocal_1 <= var_1_35 [L121] var_1_18 = (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L125] EXPR var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L125] COND FALSE !((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) [L130] var_1_29 = (var_1_28 - var_1_30) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L132] COND TRUE var_1_21 > var_1_29 [L133] var_1_6 = (var_1_21 - last_1_var_1_6) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=65, var_1_7=0, var_1_8=1, var_1_9=-128] [L213] RET step() [L214] CALL, EXPR property() [L204] EXPR last_1_var_1_16 | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=65, var_1_7=0, var_1_8=1, var_1_9=-128] [L204] EXPR (((((((((((last_1_var_1_16 | last_1_var_1_9) >= (50 * last_1_var_1_29)) ? (var_1_1 == ((unsigned short int) ((((last_1_var_1_9) < (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33))))) ? (last_1_var_1_9) : (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33)))))))) : 1) && ((var_1_21 > var_1_29) ? (var_1_6 == ((signed short int) (var_1_21 - last_1_var_1_6))) : ((var_1_7 && var_1_8) ? (var_1_6 == ((signed short int) last_1_var_1_6)) : (var_1_6 == ((signed short int) -2))))) && (((last_1_var_1_19 + last_1_var_1_19) > 200.875f) ? ((last_1_var_1_25 > last_1_var_1_18) ? (var_1_9 == ((signed char) ((((var_1_12) > (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) ? (var_1_12) : (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15))))))))) : (var_1_9 == ((signed char) ((((((((-32) < (100)) ? (-32) : (100)))) > (var_1_13)) ? (((((-32) < (100)) ? (-32) : (100)))) : (var_1_13)))))) : 1)) && (var_1_7 ? ((! var_1_8) ? (var_1_16 == ((unsigned short int) ((((var_1_27 + var_1_27) < 0 ) ? -(var_1_27 + var_1_27) : (var_1_27 + var_1_27))))) : (var_1_16 == ((unsigned short int) var_1_33))) : (var_1_16 == ((unsigned short int) var_1_9)))) && ((var_1_1 <= var_1_35) ? (var_1_18 == ((signed char) (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14))) : (var_1_18 == ((signed char) var_1_13)))) && (var_1_19 == ((float) var_1_20))) && (var_1_21 == ((signed char) ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24)))))))) && ((var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) ? (((! (var_1_27 < var_1_27)) && var_1_7) ? (var_1_25 == ((unsigned long int) var_1_1)) : 1) : (var_1_25 == ((unsigned long int) 2u)))) && (var_1_27 == ((unsigned char) ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28)))) && (((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) ? ((var_1_35 != ((((-64) > (var_1_23)) ? (-64) : (var_1_23)))) ? (var_1_29 == ((signed short int) (((((50 + var_1_23) - var_1_33) < 0 ) ? -((50 + var_1_23) - var_1_33) : ((50 + var_1_23) - var_1_33))))) : 1) : (var_1_29 == ((signed short int) (var_1_28 - var_1_30)))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=65, var_1_7=0, var_1_8=1, var_1_9=-128] [L204-L205] return (((((((((((((((last_1_var_1_16 | last_1_var_1_9) >= (50 * last_1_var_1_29)) ? (var_1_1 == ((unsigned short int) ((((last_1_var_1_9) < (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33))))) ? (last_1_var_1_9) : (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33)))))))) : 1) && ((var_1_21 > var_1_29) ? (var_1_6 == ((signed short int) (var_1_21 - last_1_var_1_6))) : ((var_1_7 && var_1_8) ? (var_1_6 == ((signed short int) last_1_var_1_6)) : (var_1_6 == ((signed short int) -2))))) && (((last_1_var_1_19 + last_1_var_1_19) > 200.875f) ? ((last_1_var_1_25 > last_1_var_1_18) ? (var_1_9 == ((signed char) ((((var_1_12) > (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) ? (var_1_12) : (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15))))))))) : (var_1_9 == ((signed char) ((((((((-32) < (100)) ? (-32) : (100)))) > (var_1_13)) ? (((((-32) < (100)) ? (-32) : (100)))) : (var_1_13)))))) : 1)) && (var_1_7 ? ((! var_1_8) ? (var_1_16 == ((unsigned short int) ((((var_1_27 + var_1_27) < 0 ) ? -(var_1_27 + var_1_27) : (var_1_27 + var_1_27))))) : (var_1_16 == ((unsigned short int) var_1_33))) : (var_1_16 == ((unsigned short int) var_1_9)))) && ((var_1_1 <= var_1_35) ? (var_1_18 == ((signed char) (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14))) : (var_1_18 == ((signed char) var_1_13)))) && (var_1_19 == ((float) var_1_20))) && (var_1_21 == ((signed char) ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24)))))))) && ((var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) ? (((! (var_1_27 < var_1_27)) && var_1_7) ? (var_1_25 == ((unsigned long int) var_1_1)) : 1) : (var_1_25 == ((unsigned long int) 2u)))) && (var_1_27 == ((unsigned char) ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28)))) && (((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) ? ((var_1_35 != ((((-64) > (var_1_23)) ? (-64) : (var_1_23)))) ? (var_1_29 == ((signed short int) (((((50 + var_1_23) - var_1_33) < 0 ) ? -((50 + var_1_23) - var_1_33) : ((50 + var_1_23) - var_1_33))))) : 1) : (var_1_29 == ((signed short int) (var_1_28 - var_1_30))))) && ((last_1_var_1_16 <= last_1_var_1_9) ? (var_1_33 == ((unsigned char) (var_1_34 - var_1_28))) : (((var_1_24 % var_1_34) >= last_1_var_1_27) ? (var_1_7 ? (var_1_33 == ((unsigned char) (((((((((var_1_28) > (var_1_23)) ? (var_1_28) : (var_1_23)))) > ((64 - var_1_30))) ? (((((var_1_28) > (var_1_23)) ? (var_1_28) : (var_1_23)))) : ((64 - var_1_30)))) + 1))) : (var_1_33 == ((unsigned char) var_1_28))) : 1))) && (((var_1_25 - last_1_var_1_35) <= (var_1_30 + var_1_39)) ? (var_1_7 ? (var_1_35 == ((unsigned char) var_1_28)) : (var_1_35 == ((unsigned char) ((var_1_36 - (var_1_37 - var_1_30)) - ((((var_1_28) < (var_1_24)) ? (var_1_28) : (var_1_24))))))) : 1)) && (var_1_38 == ((double) var_1_20))) && (var_1_39 == ((signed short int) 128)) ; [L214] RET, EXPR property() [L214] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=65, var_1_7=0, var_1_8=1, var_1_9=-128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-127, var_1_14=63, var_1_15=3, var_1_16=-128, var_1_18=66, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=64, var_1_22=126, var_1_23=0, var_1_24=62, var_1_25=2, var_1_27=175, var_1_28=63, var_1_29=63, var_1_30=0, var_1_31=0, var_1_33=63, var_1_34=127, var_1_35=65, var_1_36=-66, var_1_37=63, var_1_38=2, var_1_39=128, var_1_6=65, var_1_7=0, var_1_8=1, var_1_9=-128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.2s, OverallIterations: 10, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2444 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2421 mSDsluCounter, 6509 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5140 mSDsCounter, 975 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4276 IncrementalHoareTripleChecker+Invalid, 5251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 975 mSolverCounterUnsat, 1369 mSDtfsCounter, 4276 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1281 GetRequests, 1083 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4359 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2444occurred in iteration=9, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 1971 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 2654 NumberOfCodeBlocks, 2654 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2231 ConstructedInterpolants, 1 QuantifiedInterpolants, 14045 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1020 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 20133/20460 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:29:28,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.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 ffde3abd1302fbd87206750d0310c01693ddf151d98835d8cfad33c14bb4faac --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:29:30,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:29:30,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:29:30,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:29:30,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:29:30,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:29:30,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:29:30,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:29:30,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:29:30,911 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:29:30,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:29:30,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:29:30,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:29:30,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:29:30,912 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:29:30,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:29:30,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:29:30,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:29:30,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:29:30,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:29:30,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:29:30,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:29:30,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:29:30,918 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:29:30,918 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:29:30,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:29:30,919 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:29:30,919 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:29:30,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:29:30,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:29:30,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:29:30,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:29:30,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:29:30,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:29:30,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:29:30,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:29:30,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:29:30,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:29:30,924 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:29:30,924 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:29:30,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:29:30,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:29:30,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:29:30,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:29:30,925 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 -> ffde3abd1302fbd87206750d0310c01693ddf151d98835d8cfad33c14bb4faac [2024-11-08 23:29:31,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:29:31,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:29:31,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:29:31,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:29:31,232 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:29:31,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i [2024-11-08 23:29:32,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:29:33,030 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:29:33,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i [2024-11-08 23:29:33,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73665c8d/24e1f2a5dfd34b65822bc0953dc41d34/FLAGa124a5221 [2024-11-08 23:29:33,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73665c8d/24e1f2a5dfd34b65822bc0953dc41d34 [2024-11-08 23:29:33,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:29:33,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:29:33,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:29:33,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:29:33,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:29:33,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:33,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69ca1e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33, skipping insertion in model container [2024-11-08 23:29:33,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:33,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:29:33,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i[916,929] [2024-11-08 23:29:33,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:29:33,771 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:29:33,781 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-22.i[916,929] [2024-11-08 23:29:33,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:29:33,858 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:29:33,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33 WrapperNode [2024-11-08 23:29:33,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:29:33,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:29:33,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:29:33,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:29:33,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:33,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:33,932 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-08 23:29:33,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:29:33,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:29:33,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:29:33,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:29:33,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:33,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:33,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:33,980 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:29:33,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:33,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:33,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:34,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:34,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:34,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:34,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:29:34,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:29:34,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:29:34,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:29:34,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33" (1/1) ... [2024-11-08 23:29:34,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:29:34,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:29:34,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:29:34,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:29:34,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:29:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:29:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:29:34,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:29:34,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:29:34,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:29:34,175 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:29:34,177 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:29:35,475 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 23:29:35,476 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:29:35,487 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:29:35,487 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:29:35,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:29:35 BoogieIcfgContainer [2024-11-08 23:29:35,488 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:29:35,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:29:35,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:29:35,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:29:35,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:29:33" (1/3) ... [2024-11-08 23:29:35,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a6c20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:29:35, skipping insertion in model container [2024-11-08 23:29:35,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:29:33" (2/3) ... [2024-11-08 23:29:35,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a6c20d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:29:35, skipping insertion in model container [2024-11-08 23:29:35,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:29:35" (3/3) ... [2024-11-08 23:29:35,495 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-22.i [2024-11-08 23:29:35,508 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:29:35,509 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:29:35,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:29:35,566 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;@67f2f43a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:29:35,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:29:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 23:29:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 23:29:35,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:35,584 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:29:35,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:35,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:35,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1852080997, now seen corresponding path program 1 times [2024-11-08 23:29:35,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:29:35,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816335882] [2024-11-08 23:29:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:35,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:29:35,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:29:35,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:29:35,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:29:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:35,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:29:35,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:29:35,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-11-08 23:29:35,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:29:35,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:29:35,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816335882] [2024-11-08 23:29:35,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816335882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:29:35,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:29:35,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:29:35,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364003403] [2024-11-08 23:29:35,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:29:35,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:29:35,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:29:35,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:29:35,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:29:35,943 INFO L87 Difference]: Start difference. First operand has 87 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 54 states have internal predecessors, (75), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 23:29:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:29:35,967 INFO L93 Difference]: Finished difference Result 167 states and 299 transitions. [2024-11-08 23:29:35,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:29:35,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 193 [2024-11-08 23:29:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:29:35,975 INFO L225 Difference]: With dead ends: 167 [2024-11-08 23:29:35,975 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 23:29:35,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:29:35,980 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:29:35,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:29:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 23:29:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-08 23:29:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 23:29:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2024-11-08 23:29:36,024 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 193 [2024-11-08 23:29:36,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:29:36,024 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2024-11-08 23:29:36,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-08 23:29:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2024-11-08 23:29:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 23:29:36,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:36,029 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:29:36,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:29:36,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:29:36,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:36,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:36,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1107706983, now seen corresponding path program 1 times [2024-11-08 23:29:36,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:29:36,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310368856] [2024-11-08 23:29:36,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:36,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:29:36,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:29:36,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:29:36,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:29:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:36,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:29:36,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:29:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:29:37,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:29:37,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:29:37,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310368856] [2024-11-08 23:29:37,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310368856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:29:37,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:29:37,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:29:37,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063385133] [2024-11-08 23:29:37,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:29:37,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:29:37,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:29:37,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:29:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:29:37,677 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:29:39,443 INFO L93 Difference]: Finished difference Result 268 states and 423 transitions. [2024-11-08 23:29:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:29:39,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 193 [2024-11-08 23:29:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:29:39,461 INFO L225 Difference]: With dead ends: 268 [2024-11-08 23:29:39,461 INFO L226 Difference]: Without dead ends: 188 [2024-11-08 23:29:39,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:29:39,462 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 134 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:29:39,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 436 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 23:29:39,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-08 23:29:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 160. [2024-11-08 23:29:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 23:29:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 253 transitions. [2024-11-08 23:29:39,492 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 253 transitions. Word has length 193 [2024-11-08 23:29:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:29:39,493 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 253 transitions. [2024-11-08 23:29:39,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 253 transitions. [2024-11-08 23:29:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 23:29:39,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:39,496 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:29:39,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 23:29:39,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:29:39,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:39,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1598912411, now seen corresponding path program 1 times [2024-11-08 23:29:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:29:39,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020310138] [2024-11-08 23:29:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:39,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:29:39,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:29:39,702 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:29:39,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 23:29:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:39,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:29:39,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:29:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:29:40,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:29:40,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:29:40,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020310138] [2024-11-08 23:29:40,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020310138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:29:40,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:29:40,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:29:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381266318] [2024-11-08 23:29:40,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:29:40,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:29:40,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:29:40,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:29:40,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:29:40,853 INFO L87 Difference]: Start difference. First operand 160 states and 253 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:42,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:29:42,062 INFO L93 Difference]: Finished difference Result 321 states and 507 transitions. [2024-11-08 23:29:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:29:42,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 193 [2024-11-08 23:29:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:29:42,080 INFO L225 Difference]: With dead ends: 321 [2024-11-08 23:29:42,080 INFO L226 Difference]: Without dead ends: 164 [2024-11-08 23:29:42,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:29:42,082 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 75 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:29:42,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 361 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 23:29:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-08 23:29:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 138. [2024-11-08 23:29:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 73 states have internal predecessors, (91), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 23:29:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 215 transitions. [2024-11-08 23:29:42,105 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 215 transitions. Word has length 193 [2024-11-08 23:29:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:29:42,105 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 215 transitions. [2024-11-08 23:29:42,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 215 transitions. [2024-11-08 23:29:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 23:29:42,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:42,108 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:29:42,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 23:29:42,308 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-11-08 23:29:42,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:42,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:42,310 INFO L85 PathProgramCache]: Analyzing trace with hash -7907848, now seen corresponding path program 1 times [2024-11-08 23:29:42,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:29:42,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331475881] [2024-11-08 23:29:42,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:42,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:29:42,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:29:42,313 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-11-08 23:29:42,314 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-11-08 23:29:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:42,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:29:42,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:29:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:29:42,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:29:42,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:29:42,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331475881] [2024-11-08 23:29:42,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331475881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:29:42,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:29:42,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:29:42,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362616277] [2024-11-08 23:29:42,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:29:42,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:29:42,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:29:42,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:29:42,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:29:42,824 INFO L87 Difference]: Start difference. First operand 138 states and 215 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:29:44,146 INFO L93 Difference]: Finished difference Result 244 states and 383 transitions. [2024-11-08 23:29:44,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:29:44,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 194 [2024-11-08 23:29:44,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:29:44,160 INFO L225 Difference]: With dead ends: 244 [2024-11-08 23:29:44,160 INFO L226 Difference]: Without dead ends: 164 [2024-11-08 23:29:44,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:29:44,163 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 63 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:29:44,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 490 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 23:29:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-08 23:29:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 141. [2024-11-08 23:29:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 23:29:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 219 transitions. [2024-11-08 23:29:44,194 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 219 transitions. Word has length 194 [2024-11-08 23:29:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:29:44,195 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 219 transitions. [2024-11-08 23:29:44,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 219 transitions. [2024-11-08 23:29:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-08 23:29:44,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:44,197 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:29:44,205 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 (5)] Ended with exit code 0 [2024-11-08 23:29:44,398 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 [2024-11-08 23:29:44,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:44,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:44,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1348572340, now seen corresponding path program 1 times [2024-11-08 23:29:44,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:29:44,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264206] [2024-11-08 23:29:44,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:44,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:29:44,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:29:44,403 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:29:44,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 23:29:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:44,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:29:44,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:29:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:29:44,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:29:44,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:29:44,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264206] [2024-11-08 23:29:44,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:29:44,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:29:44,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:29:44,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616384909] [2024-11-08 23:29:44,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:29:44,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:29:44,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:29:44,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:29:44,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:29:44,899 INFO L87 Difference]: Start difference. First operand 141 states and 219 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:29:46,350 INFO L93 Difference]: Finished difference Result 332 states and 518 transitions. [2024-11-08 23:29:46,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:29:46,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2024-11-08 23:29:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:29:46,365 INFO L225 Difference]: With dead ends: 332 [2024-11-08 23:29:46,366 INFO L226 Difference]: Without dead ends: 252 [2024-11-08 23:29:46,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:29:46,368 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 170 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:29:46,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 431 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 23:29:46,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-08 23:29:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 222. [2024-11-08 23:29:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 125 states have (on average 1.304) internal successors, (163), 125 states have internal predecessors, (163), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 23:29:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 349 transitions. [2024-11-08 23:29:46,403 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 349 transitions. Word has length 195 [2024-11-08 23:29:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:29:46,404 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 349 transitions. [2024-11-08 23:29:46,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 349 transitions. [2024-11-08 23:29:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 23:29:46,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:46,406 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:29:46,417 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 (6)] Ended with exit code 0 [2024-11-08 23:29:46,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:29:46,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:46,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:46,612 INFO L85 PathProgramCache]: Analyzing trace with hash -807090980, now seen corresponding path program 1 times [2024-11-08 23:29:46,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:29:46,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419801623] [2024-11-08 23:29:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:46,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:29:46,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:29:46,616 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-11-08 23:29:46,617 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-11-08 23:29:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:46,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:29:46,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:29:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 148 proven. 87 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2024-11-08 23:29:47,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:29:47,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:29:47,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:29:47,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419801623] [2024-11-08 23:29:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419801623] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 23:29:47,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:29:47,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-08 23:29:47,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494112596] [2024-11-08 23:29:47,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:29:47,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:29:47,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:29:47,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:29:47,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:29:47,220 INFO L87 Difference]: Start difference. First operand 222 states and 349 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:48,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:29:48,996 INFO L93 Difference]: Finished difference Result 436 states and 688 transitions. [2024-11-08 23:29:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:29:49,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-11-08 23:29:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:29:49,012 INFO L225 Difference]: With dead ends: 436 [2024-11-08 23:29:49,012 INFO L226 Difference]: Without dead ends: 275 [2024-11-08 23:29:49,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:29:49,014 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 69 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 23:29:49,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 266 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 23:29:49,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-08 23:29:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 238. [2024-11-08 23:29:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 141 states have (on average 1.3120567375886525) internal successors, (185), 141 states have internal predecessors, (185), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-08 23:29:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 371 transitions. [2024-11-08 23:29:49,037 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 371 transitions. Word has length 196 [2024-11-08 23:29:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:29:49,038 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 371 transitions. [2024-11-08 23:29:49,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 371 transitions. [2024-11-08 23:29:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 23:29:49,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:49,039 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:29:49,048 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-11-08 23:29:49,243 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-11-08 23:29:49,244 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:49,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:49,244 INFO L85 PathProgramCache]: Analyzing trace with hash -548925542, now seen corresponding path program 1 times [2024-11-08 23:29:49,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:29:49,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495583901] [2024-11-08 23:29:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:49,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:29:49,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:29:49,246 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-11-08 23:29:49,248 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-11-08 23:29:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:49,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 23:29:49,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:29:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 839 proven. 48 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2024-11-08 23:29:50,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:29:51,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:29:51,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495583901] [2024-11-08 23:29:51,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495583901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:29:51,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1808674845] [2024-11-08 23:29:51,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:51,687 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 23:29:51,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 23:29:51,689 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 23:29:51,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-08 23:29:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:52,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:29:52,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:29:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:29:53,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:29:53,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1808674845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:29:53,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:29:53,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2024-11-08 23:29:53,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493014642] [2024-11-08 23:29:53,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:29:53,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:29:53,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:29:53,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:29:53,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-11-08 23:29:53,098 INFO L87 Difference]: Start difference. First operand 238 states and 371 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:29:53,832 INFO L93 Difference]: Finished difference Result 509 states and 796 transitions. [2024-11-08 23:29:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:29:53,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-11-08 23:29:53,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:29:53,836 INFO L225 Difference]: With dead ends: 509 [2024-11-08 23:29:53,836 INFO L226 Difference]: Without dead ends: 332 [2024-11-08 23:29:53,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-11-08 23:29:53,837 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 28 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:29:53,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 293 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 23:29:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-08 23:29:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 321. [2024-11-08 23:29:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 192 states have (on average 1.328125) internal successors, (255), 192 states have internal predecessors, (255), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-08 23:29:53,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 503 transitions. [2024-11-08 23:29:53,865 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 503 transitions. Word has length 196 [2024-11-08 23:29:53,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:29:53,865 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 503 transitions. [2024-11-08 23:29:53,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:29:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 503 transitions. [2024-11-08 23:29:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 23:29:53,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:29:53,871 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:29:53,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-08 23:29:54,080 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 (8)] Ended with exit code 0 [2024-11-08 23:29:54,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:29:54,276 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:29:54,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:29:54,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1226081820, now seen corresponding path program 1 times [2024-11-08 23:29:54,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:29:54,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392541514] [2024-11-08 23:29:54,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:54,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:29:54,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:29:54,283 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:29:54,285 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 (10)] Waiting until timeout for monitored process [2024-11-08 23:29:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:54,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 23:29:54,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:29:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 839 proven. 48 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2024-11-08 23:29:56,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:29:56,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:29:56,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392541514] [2024-11-08 23:29:56,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392541514] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:29:56,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [794492304] [2024-11-08 23:29:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:29:56,688 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 23:29:56,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 23:29:56,690 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 23:29:56,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-08 23:29:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:29:57,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 23:29:57,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:29:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 828 proven. 27 refuted. 0 times theorem prover too weak. 1005 trivial. 0 not checked. [2024-11-08 23:29:58,549 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:29:58,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [794492304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:29:58,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:29:58,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2024-11-08 23:29:58,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004454438] [2024-11-08 23:29:58,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:29:58,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 23:29:58,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:29:58,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 23:29:58,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2024-11-08 23:29:58,828 INFO L87 Difference]: Start difference. First operand 321 states and 503 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 13 states have internal predecessors, (73), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2024-11-08 23:30:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:30:00,977 INFO L93 Difference]: Finished difference Result 621 states and 968 transitions. [2024-11-08 23:30:00,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 23:30:00,978 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 13 states have internal predecessors, (73), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) Word has length 196 [2024-11-08 23:30:00,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:30:00,981 INFO L225 Difference]: With dead ends: 621 [2024-11-08 23:30:00,981 INFO L226 Difference]: Without dead ends: 361 [2024-11-08 23:30:00,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 512 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=291, Invalid=765, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 23:30:00,983 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 105 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 23:30:00,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 832 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 23:30:00,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-08 23:30:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 337. [2024-11-08 23:30:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 124 states have call successors, (124), 6 states have call predecessors, (124), 6 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-08 23:30:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 523 transitions. [2024-11-08 23:30:01,012 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 523 transitions. Word has length 196 [2024-11-08 23:30:01,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:30:01,013 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 523 transitions. [2024-11-08 23:30:01,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 13 states have internal predecessors, (73), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2024-11-08 23:30:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 523 transitions. [2024-11-08 23:30:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 23:30:01,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:30:01,014 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:30:01,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-08 23:30:01,223 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 (10)] Forceful destruction successful, exit code 0 [2024-11-08 23:30:01,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:30:01,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:30:01,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:30:01,416 INFO L85 PathProgramCache]: Analyzing trace with hash -401047027, now seen corresponding path program 1 times [2024-11-08 23:30:01,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:30:01,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89765482] [2024-11-08 23:30:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:01,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:30:01,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:30:01,420 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:30:01,421 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 (12)] Waiting until timeout for monitored process [2024-11-08 23:30:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:01,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:30:01,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:30:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-08 23:30:01,614 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:30:01,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:30:01,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89765482] [2024-11-08 23:30:01,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89765482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:30:01,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:30:01,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:30:01,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4492921] [2024-11-08 23:30:01,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:30:01,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:30:01,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:30:01,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:30:01,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:30:01,616 INFO L87 Difference]: Start difference. First operand 337 states and 523 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:30:02,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:30:02,797 INFO L93 Difference]: Finished difference Result 654 states and 1019 transitions. [2024-11-08 23:30:02,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:30:02,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-11-08 23:30:02,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:30:02,800 INFO L225 Difference]: With dead ends: 654 [2024-11-08 23:30:02,800 INFO L226 Difference]: Without dead ends: 391 [2024-11-08 23:30:02,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:30:02,802 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 24 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:30:02,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 250 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 23:30:02,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-08 23:30:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 371. [2024-11-08 23:30:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 240 states have (on average 1.3458333333333334) internal successors, (323), 240 states have internal predecessors, (323), 124 states have call successors, (124), 6 states have call predecessors, (124), 6 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-08 23:30:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 571 transitions. [2024-11-08 23:30:02,839 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 571 transitions. Word has length 196 [2024-11-08 23:30:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:30:02,840 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 571 transitions. [2024-11-08 23:30:02,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-08 23:30:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 571 transitions. [2024-11-08 23:30:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 23:30:02,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:30:02,841 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:30:02,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-08 23:30:03,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:30:03,045 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:30:03,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:30:03,045 INFO L85 PathProgramCache]: Analyzing trace with hash 279011343, now seen corresponding path program 1 times [2024-11-08 23:30:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:30:03,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348263984] [2024-11-08 23:30:03,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:30:03,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:30:03,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:30:03,048 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:30:03,049 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 (13)] Waiting until timeout for monitored process [2024-11-08 23:30:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:30:03,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:30:03,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:30:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 918 proven. 54 refuted. 0 times theorem prover too weak. 888 trivial. 0 not checked. [2024-11-08 23:30:07,104 INFO L311 TraceCheckSpWp]: Computing backward predicates...