./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.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 6b261b46738dc0a9db26822637ec843da493e234cf769a01c10942fcb0315b00 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:01:27,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:01:27,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:01:27,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:01:27,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:01:27,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:01:27,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:01:27,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:01:27,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:01:27,547 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:01:27,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:01:27,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:01:27,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:01:27,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:01:27,550 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:01:27,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:01:27,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:01:27,551 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:01:27,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:01:27,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:01:27,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:01:27,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:01:27,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:01:27,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:01:27,555 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:01:27,556 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:01:27,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:01:27,556 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:01:27,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:01:27,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:01:27,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:01:27,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:01:27,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:01:27,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:01:27,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:01:27,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:01:27,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:01:27,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:01:27,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:01:27,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:01:27,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:01:27,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:01:27,560 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 -> 6b261b46738dc0a9db26822637ec843da493e234cf769a01c10942fcb0315b00 [2024-10-13 04:01:27,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:01:27,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:01:27,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:01:27,783 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:01:27,783 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:01:27,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i [2024-10-13 04:01:29,098 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:01:29,264 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:01:29,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i [2024-10-13 04:01:29,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ece316e/417732fda19f40af89a61487bec59a69/FLAGdab61b44a [2024-10-13 04:01:29,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ece316e/417732fda19f40af89a61487bec59a69 [2024-10-13 04:01:29,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:01:29,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:01:29,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:01:29,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:01:29,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:01:29,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a695014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29, skipping insertion in model container [2024-10-13 04:01:29,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:01:29,481 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i[916,929] [2024-10-13 04:01:29,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:01:29,583 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:01:29,595 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i[916,929] [2024-10-13 04:01:29,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:01:29,646 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:01:29,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29 WrapperNode [2024-10-13 04:01:29,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:01:29,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:01:29,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:01:29,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:01:29,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,711 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 304 [2024-10-13 04:01:29,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:01:29,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:01:29,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:01:29,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:01:29,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,757 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:01:29,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:01:29,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:01:29,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:01:29,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:01:29,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29" (1/1) ... [2024-10-13 04:01:29,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:01:29,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:01:29,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:01:29,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:01:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:01:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:01:29,872 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:01:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:01:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:01:29,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:01:29,956 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:01:29,958 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:01:30,509 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-13 04:01:30,510 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:01:30,538 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:01:30,539 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:01:30,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:01:30 BoogieIcfgContainer [2024-10-13 04:01:30,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:01:30,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:01:30,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:01:30,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:01:30,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:01:29" (1/3) ... [2024-10-13 04:01:30,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3933f93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:01:30, skipping insertion in model container [2024-10-13 04:01:30,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:29" (2/3) ... [2024-10-13 04:01:30,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3933f93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:01:30, skipping insertion in model container [2024-10-13 04:01:30,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:01:30" (3/3) ... [2024-10-13 04:01:30,547 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-72.i [2024-10-13 04:01:30,563 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:01:30,563 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:01:30,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:01:30,626 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;@5e67e6b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:01:30,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:01:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 87 states have (on average 1.5057471264367817) internal successors, (131), 88 states have internal predecessors, (131), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 04:01:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-13 04:01:30,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:01:30,645 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:01:30,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:01:30,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:01:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash 278803541, now seen corresponding path program 1 times [2024-10-13 04:01:30,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:01:30,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080613557] [2024-10-13 04:01:30,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:30,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:01:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:30,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:01:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:30,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:01:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:30,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:01:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:30,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:01:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:30,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:01:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:30,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:01:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:30,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:01:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:30,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:01:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:30,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:01:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:30,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:01:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:30,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:01:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:01:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:01:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:01:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:01:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:01:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:01:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:01:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 04:01:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:01:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:01:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:01:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 04:01:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:01:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 04:01:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:01:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 04:01:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 04:01:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 04:01:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 04:01:31,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:01:31,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080613557] [2024-10-13 04:01:31,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080613557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:01:31,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:01:31,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:01:31,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991994483] [2024-10-13 04:01:31,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:01:31,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:01:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:01:31,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:01:31,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:01:31,137 INFO L87 Difference]: Start difference. First operand has 119 states, 87 states have (on average 1.5057471264367817) internal successors, (131), 88 states have internal predecessors, (131), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 04:01:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:01:31,192 INFO L93 Difference]: Finished difference Result 231 states and 399 transitions. [2024-10-13 04:01:31,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:01:31,195 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2024-10-13 04:01:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:01:31,202 INFO L225 Difference]: With dead ends: 231 [2024-10-13 04:01:31,202 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 04:01:31,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:01:31,208 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:01:31,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:01:31,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 04:01:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-13 04:01:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 82 states have internal predecessors, (118), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 04:01:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 176 transitions. [2024-10-13 04:01:31,256 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 176 transitions. Word has length 190 [2024-10-13 04:01:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:01:31,256 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 176 transitions. [2024-10-13 04:01:31,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 04:01:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 176 transitions. [2024-10-13 04:01:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-13 04:01:31,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:01:31,260 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:01:31,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:01:31,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:01:31,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:01:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash 538436115, now seen corresponding path program 1 times [2024-10-13 04:01:31,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:01:31,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092709361] [2024-10-13 04:01:31,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:31,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:01:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:01:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:01:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:01:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:01:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:01:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:01:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:01:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:01:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:01:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:01:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:01:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:01:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:01:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:01:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:01:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:01:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:01:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:01:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 04:01:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:01:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:01:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:01:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 04:01:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:01:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 04:01:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:01:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 04:01:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 04:01:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 04:01:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 04:01:31,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:01:31,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092709361] [2024-10-13 04:01:31,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092709361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:01:31,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:01:31,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:01:31,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552275540] [2024-10-13 04:01:31,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:01:31,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:01:31,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:01:31,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:01:31,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:01:31,798 INFO L87 Difference]: Start difference. First operand 113 states and 176 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:32,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:01:32,059 INFO L93 Difference]: Finished difference Result 338 states and 527 transitions. [2024-10-13 04:01:32,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:01:32,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-10-13 04:01:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:01:32,062 INFO L225 Difference]: With dead ends: 338 [2024-10-13 04:01:32,062 INFO L226 Difference]: Without dead ends: 226 [2024-10-13 04:01:32,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 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-10-13 04:01:32,064 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 125 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:01:32,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 580 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:01:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-13 04:01:32,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 180. [2024-10-13 04:01:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 04:01:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 282 transitions. [2024-10-13 04:01:32,090 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 282 transitions. Word has length 190 [2024-10-13 04:01:32,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:01:32,091 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 282 transitions. [2024-10-13 04:01:32,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 282 transitions. [2024-10-13 04:01:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-13 04:01:32,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:01:32,093 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:01:32,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:01:32,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:01:32,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:01:32,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1150507627, now seen corresponding path program 1 times [2024-10-13 04:01:32,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:01:32,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850502177] [2024-10-13 04:01:32,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:32,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:01:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:01:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:01:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:01:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:01:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:01:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:01:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:01:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:01:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:01:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:01:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:01:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:01:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:01:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:01:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:01:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:01:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:01:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:01:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 04:01:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:01:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:01:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:01:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 04:01:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:01:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 04:01:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:01:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 04:01:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 04:01:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 04:01:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 04:01:32,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:01:32,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850502177] [2024-10-13 04:01:32,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850502177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:01:32,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:01:32,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:01:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977870437] [2024-10-13 04:01:32,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:01:32,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:01:32,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:01:32,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:01:32,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:01:32,393 INFO L87 Difference]: Start difference. First operand 180 states and 282 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:01:32,441 INFO L93 Difference]: Finished difference Result 421 states and 656 transitions. [2024-10-13 04:01:32,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:01:32,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-10-13 04:01:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:01:32,446 INFO L225 Difference]: With dead ends: 421 [2024-10-13 04:01:32,447 INFO L226 Difference]: Without dead ends: 303 [2024-10-13 04:01:32,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:01:32,450 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 167 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:01:32,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 417 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:01:32,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-13 04:01:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2024-10-13 04:01:32,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 209 states have (on average 1.4066985645933014) internal successors, (294), 209 states have internal predecessors, (294), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-13 04:01:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 468 transitions. [2024-10-13 04:01:32,486 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 468 transitions. Word has length 190 [2024-10-13 04:01:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:01:32,486 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 468 transitions. [2024-10-13 04:01:32,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 468 transitions. [2024-10-13 04:01:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-13 04:01:32,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:01:32,492 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:01:32,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:01:32,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:01:32,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:01:32,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1339021335, now seen corresponding path program 1 times [2024-10-13 04:01:32,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:01:32,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708949681] [2024-10-13 04:01:32,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:32,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:01:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:01:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:01:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:01:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:01:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:01:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:01:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:01:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:01:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:01:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:01:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:01:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:01:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:01:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:01:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:01:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:01:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:01:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:01:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 04:01:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:01:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:01:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:01:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 04:01:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:01:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 04:01:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:01:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 04:01:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 04:01:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 04:01:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 04:01:32,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:01:32,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708949681] [2024-10-13 04:01:32,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708949681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:01:32,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:01:32,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 04:01:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601731416] [2024-10-13 04:01:32,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:01:32,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:01:32,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:01:32,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:01:32,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:01:32,951 INFO L87 Difference]: Start difference. First operand 300 states and 468 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:01:33,256 INFO L93 Difference]: Finished difference Result 708 states and 1093 transitions. [2024-10-13 04:01:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 04:01:33,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-10-13 04:01:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:01:33,262 INFO L225 Difference]: With dead ends: 708 [2024-10-13 04:01:33,264 INFO L226 Difference]: Without dead ends: 487 [2024-10-13 04:01:33,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:01:33,266 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 303 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:01:33,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 812 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:01:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-10-13 04:01:33,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 456. [2024-10-13 04:01:33,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 327 states have (on average 1.3944954128440368) internal successors, (456), 329 states have internal predecessors, (456), 122 states have call successors, (122), 6 states have call predecessors, (122), 6 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2024-10-13 04:01:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 700 transitions. [2024-10-13 04:01:33,330 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 700 transitions. Word has length 190 [2024-10-13 04:01:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:01:33,331 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 700 transitions. [2024-10-13 04:01:33,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:33,332 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 700 transitions. [2024-10-13 04:01:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-13 04:01:33,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:01:33,335 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:01:33,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:01:33,335 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:01:33,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:01:33,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2040085913, now seen corresponding path program 1 times [2024-10-13 04:01:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:01:33,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746641289] [2024-10-13 04:01:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:01:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:01:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:01:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:01:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:01:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:01:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:01:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:01:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:01:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:01:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:01:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:01:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:01:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:01:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:01:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:01:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:01:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:01:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:01:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 04:01:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:01:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:01:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:01:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 04:01:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:01:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 04:01:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:01:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 04:01:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 04:01:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 04:01:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 04:01:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:01:34,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746641289] [2024-10-13 04:01:34,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746641289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:01:34,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:01:34,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:01:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042599519] [2024-10-13 04:01:34,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:01:34,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:01:34,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:01:34,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:01:34,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:01:34,307 INFO L87 Difference]: Start difference. First operand 456 states and 700 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:01:34,638 INFO L93 Difference]: Finished difference Result 1200 states and 1808 transitions. [2024-10-13 04:01:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 04:01:34,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-10-13 04:01:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:01:34,645 INFO L225 Difference]: With dead ends: 1200 [2024-10-13 04:01:34,645 INFO L226 Difference]: Without dead ends: 825 [2024-10-13 04:01:34,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:01:34,647 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 203 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 04:01:34,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 844 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 04:01:34,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-13 04:01:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 723. [2024-10-13 04:01:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 582 states have (on average 1.4261168384879725) internal successors, (830), 588 states have internal predecessors, (830), 130 states have call successors, (130), 10 states have call predecessors, (130), 10 states have return successors, (130), 124 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-13 04:01:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1090 transitions. [2024-10-13 04:01:34,690 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1090 transitions. Word has length 190 [2024-10-13 04:01:34,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:01:34,690 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1090 transitions. [2024-10-13 04:01:34,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:34,691 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1090 transitions. [2024-10-13 04:01:34,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-13 04:01:34,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:01:34,693 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:01:34,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 04:01:34,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:01:34,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:01:34,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2114332773, now seen corresponding path program 1 times [2024-10-13 04:01:34,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:01:34,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243795039] [2024-10-13 04:01:34,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:34,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:01:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:01:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:01:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:01:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:01:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:01:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:01:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:01:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:01:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:01:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:01:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:01:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:01:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:01:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:01:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:01:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:01:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:01:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:01:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 04:01:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:01:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:01:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:01:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 04:01:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:01:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 04:01:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:01:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 04:01:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 04:01:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 04:01:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 04:01:35,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:01:35,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243795039] [2024-10-13 04:01:35,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243795039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:01:35,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:01:35,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:01:35,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407408244] [2024-10-13 04:01:35,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:01:35,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:01:35,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:01:35,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:01:35,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:01:35,748 INFO L87 Difference]: Start difference. First operand 723 states and 1090 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:36,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:01:36,061 INFO L93 Difference]: Finished difference Result 1423 states and 2116 transitions. [2024-10-13 04:01:36,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:01:36,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-10-13 04:01:36,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:01:36,066 INFO L225 Difference]: With dead ends: 1423 [2024-10-13 04:01:36,066 INFO L226 Difference]: Without dead ends: 805 [2024-10-13 04:01:36,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:01:36,069 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 217 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:01:36,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 791 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:01:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-13 04:01:36,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 685. [2024-10-13 04:01:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 526 states have (on average 1.3954372623574145) internal successors, (734), 534 states have internal predecessors, (734), 142 states have call successors, (142), 16 states have call predecessors, (142), 16 states have return successors, (142), 134 states have call predecessors, (142), 142 states have call successors, (142) [2024-10-13 04:01:36,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1018 transitions. [2024-10-13 04:01:36,104 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1018 transitions. Word has length 190 [2024-10-13 04:01:36,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:01:36,105 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1018 transitions. [2024-10-13 04:01:36,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:36,105 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1018 transitions. [2024-10-13 04:01:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 04:01:36,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:01:36,107 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:01:36,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 04:01:36,107 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:01:36,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:01:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1076408433, now seen corresponding path program 1 times [2024-10-13 04:01:36,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:01:36,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170999572] [2024-10-13 04:01:36,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:36,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:01:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:01:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:01:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:01:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:01:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:01:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:01:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:01:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:01:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:01:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:01:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:01:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:01:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:01:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:01:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:01:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:01:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:01:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:01:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 04:01:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:01:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:01:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:01:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 04:01:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:01:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 04:01:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:01:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 04:01:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 04:01:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 04:01:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 04:01:36,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:01:36,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170999572] [2024-10-13 04:01:36,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170999572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:01:36,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:01:36,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:01:36,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820964387] [2024-10-13 04:01:36,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:01:36,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:01:36,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:01:36,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:01:36,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:01:36,624 INFO L87 Difference]: Start difference. First operand 685 states and 1018 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:36,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:01:36,920 INFO L93 Difference]: Finished difference Result 1720 states and 2546 transitions. [2024-10-13 04:01:36,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:01:36,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-10-13 04:01:36,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:01:36,928 INFO L225 Difference]: With dead ends: 1720 [2024-10-13 04:01:36,929 INFO L226 Difference]: Without dead ends: 1122 [2024-10-13 04:01:36,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:01:36,933 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 107 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:01:36,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 587 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:01:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-10-13 04:01:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1117. [2024-10-13 04:01:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 888 states have (on average 1.3918918918918919) internal successors, (1236), 905 states have internal predecessors, (1236), 201 states have call successors, (201), 27 states have call predecessors, (201), 27 states have return successors, (201), 184 states have call predecessors, (201), 201 states have call successors, (201) [2024-10-13 04:01:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1638 transitions. [2024-10-13 04:01:37,008 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1638 transitions. Word has length 192 [2024-10-13 04:01:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:01:37,010 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1638 transitions. [2024-10-13 04:01:37,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1638 transitions. [2024-10-13 04:01:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 04:01:37,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:01:37,012 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:01:37,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 04:01:37,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:01:37,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:01:37,013 INFO L85 PathProgramCache]: Analyzing trace with hash -26213922, now seen corresponding path program 1 times [2024-10-13 04:01:37,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:01:37,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143470183] [2024-10-13 04:01:37,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:37,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:01:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:01:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:01:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:01:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:01:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:01:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:01:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:01:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:01:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:01:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:01:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:01:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:01:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:01:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:01:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:01:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:01:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:01:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:01:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 04:01:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:01:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:01:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:01:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 04:01:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:01:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 04:01:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:01:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 04:01:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 04:01:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 04:01:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-13 04:01:37,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:01:37,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143470183] [2024-10-13 04:01:37,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143470183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:01:37,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635470574] [2024-10-13 04:01:37,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:37,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:01:37,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:01:37,260 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:01:37,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:01:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:37,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 04:01:37,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:01:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 334 proven. 75 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2024-10-13 04:01:37,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:01:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-13 04:01:37,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635470574] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:01:37,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:01:37,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-13 04:01:37,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410550532] [2024-10-13 04:01:37,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:01:37,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:01:37,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:01:37,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:01:37,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:01:37,882 INFO L87 Difference]: Start difference. First operand 1117 states and 1638 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-13 04:01:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:01:38,102 INFO L93 Difference]: Finished difference Result 1913 states and 2749 transitions. [2024-10-13 04:01:38,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 04:01:38,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 192 [2024-10-13 04:01:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:01:38,107 INFO L225 Difference]: With dead ends: 1913 [2024-10-13 04:01:38,107 INFO L226 Difference]: Without dead ends: 883 [2024-10-13 04:01:38,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:01:38,110 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 195 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:01:38,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 347 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:01:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-10-13 04:01:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 821. [2024-10-13 04:01:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 604 states have (on average 1.3211920529801324) internal successors, (798), 613 states have internal predecessors, (798), 185 states have call successors, (185), 31 states have call predecessors, (185), 31 states have return successors, (185), 176 states have call predecessors, (185), 185 states have call successors, (185) [2024-10-13 04:01:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1168 transitions. [2024-10-13 04:01:38,165 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1168 transitions. Word has length 192 [2024-10-13 04:01:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:01:38,165 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1168 transitions. [2024-10-13 04:01:38,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-13 04:01:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1168 transitions. [2024-10-13 04:01:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 04:01:38,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:01:38,167 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:01:38,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 04:01:38,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:01:38,372 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:01:38,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:01:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1897014112, now seen corresponding path program 1 times [2024-10-13 04:01:38,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:01:38,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488917157] [2024-10-13 04:01:38,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:38,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:01:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:01:38,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166985177] [2024-10-13 04:01:38,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:38,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:01:38,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:01:38,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:01:38,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 04:01:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:38,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 04:01:38,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:01:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 891 proven. 144 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-10-13 04:01:39,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:01:42,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:01:42,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488917157] [2024-10-13 04:01:42,407 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 04:01:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166985177] [2024-10-13 04:01:42,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166985177] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:01:42,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 04:01:42,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-10-13 04:01:42,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369455577] [2024-10-13 04:01:42,407 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 04:01:42,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 04:01:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:01:42,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 04:01:42,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-10-13 04:01:42,408 INFO L87 Difference]: Start difference. First operand 821 states and 1168 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 14 states have internal predecessors, (65), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2024-10-13 04:01:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:01:45,233 INFO L93 Difference]: Finished difference Result 1988 states and 2731 transitions. [2024-10-13 04:01:45,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-13 04:01:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 14 states have internal predecessors, (65), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) Word has length 192 [2024-10-13 04:01:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:01:45,240 INFO L225 Difference]: With dead ends: 1988 [2024-10-13 04:01:45,240 INFO L226 Difference]: Without dead ends: 1274 [2024-10-13 04:01:45,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=736, Invalid=2344, Unknown=0, NotChecked=0, Total=3080 [2024-10-13 04:01:45,243 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 606 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:01:45,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 1231 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 04:01:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-10-13 04:01:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1003. [2024-10-13 04:01:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 728 states have (on average 1.2733516483516483) internal successors, (927), 737 states have internal predecessors, (927), 217 states have call successors, (217), 57 states have call predecessors, (217), 57 states have return successors, (217), 208 states have call predecessors, (217), 217 states have call successors, (217) [2024-10-13 04:01:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1361 transitions. [2024-10-13 04:01:45,322 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1361 transitions. Word has length 192 [2024-10-13 04:01:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:01:45,323 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1361 transitions. [2024-10-13 04:01:45,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 14 states have internal predecessors, (65), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2024-10-13 04:01:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1361 transitions. [2024-10-13 04:01:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 04:01:45,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:01:45,325 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:01:45,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 04:01:45,528 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,SelfDestructingSolverStorable8 [2024-10-13 04:01:45,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:01:45,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:01:45,529 INFO L85 PathProgramCache]: Analyzing trace with hash 337346511, now seen corresponding path program 1 times [2024-10-13 04:01:45,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:01:45,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437879190] [2024-10-13 04:01:45,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:01:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:45,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:01:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:01:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:01:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:01:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:45,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:01:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:01:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:01:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:01:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:01:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:01:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:01:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 04:01:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 04:01:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:01:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:01:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:01:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:01:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:01:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 04:01:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 04:01:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 04:01:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 04:01:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 04:01:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 04:01:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 04:01:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 04:01:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 04:01:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 04:01:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 04:01:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:01:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 04:01:46,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:01:46,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437879190] [2024-10-13 04:01:46,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437879190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:01:46,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:01:46,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 04:01:46,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197022751] [2024-10-13 04:01:46,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:01:46,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 04:01:46,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:01:46,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 04:01:46,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:01:46,033 INFO L87 Difference]: Start difference. First operand 1003 states and 1361 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:01:46,319 INFO L93 Difference]: Finished difference Result 1822 states and 2472 transitions. [2024-10-13 04:01:46,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:01:46,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-10-13 04:01:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:01:46,324 INFO L225 Difference]: With dead ends: 1822 [2024-10-13 04:01:46,324 INFO L226 Difference]: Without dead ends: 938 [2024-10-13 04:01:46,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:01:46,327 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 107 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:01:46,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 528 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:01:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-10-13 04:01:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 588. [2024-10-13 04:01:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 445 states have (on average 1.2898876404494382) internal successors, (574), 448 states have internal predecessors, (574), 112 states have call successors, (112), 30 states have call predecessors, (112), 30 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-13 04:01:46,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 798 transitions. [2024-10-13 04:01:46,413 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 798 transitions. Word has length 192 [2024-10-13 04:01:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:01:46,413 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 798 transitions. [2024-10-13 04:01:46,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:01:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 798 transitions. [2024-10-13 04:01:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 04:01:46,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:01:46,415 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:01:46,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 04:01:46,415 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:01:46,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:01:46,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1387541022, now seen corresponding path program 1 times [2024-10-13 04:01:46,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:01:46,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134854905] [2024-10-13 04:01:46,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:46,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:01:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:01:46,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479286280] [2024-10-13 04:01:46,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:01:46,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:01:46,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:01:46,477 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-10-13 04:01:46,477 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-10-13 04:01:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:01:46,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:01:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:01:46,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:01:46,719 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:01:46,720 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:01:46,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 04:01:46,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:01:46,924 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:01:47,029 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:01:47,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:01:47 BoogieIcfgContainer [2024-10-13 04:01:47,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:01:47,032 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:01:47,032 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:01:47,032 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:01:47,033 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:01:30" (3/4) ... [2024-10-13 04:01:47,034 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:01:47,035 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:01:47,035 INFO L158 Benchmark]: Toolchain (without parser) took 17744.05ms. Allocated memory was 161.5MB in the beginning and 501.2MB in the end (delta: 339.7MB). Free memory was 108.0MB in the beginning and 352.8MB in the end (delta: -244.9MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. [2024-10-13 04:01:47,036 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 161.5MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:01:47,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.76ms. Allocated memory is still 161.5MB. Free memory was 108.0MB in the beginning and 89.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 04:01:47,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.21ms. Allocated memory is still 161.5MB. Free memory was 89.1MB in the beginning and 83.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 04:01:47,036 INFO L158 Benchmark]: Boogie Preprocessor took 89.24ms. Allocated memory is still 161.5MB. Free memory was 83.2MB in the beginning and 73.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 04:01:47,036 INFO L158 Benchmark]: RCFGBuilder took 737.51ms. Allocated memory was 161.5MB in the beginning and 218.1MB in the end (delta: 56.6MB). Free memory was 73.4MB in the beginning and 176.9MB in the end (delta: -103.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-13 04:01:47,037 INFO L158 Benchmark]: TraceAbstraction took 16489.43ms. Allocated memory was 218.1MB in the beginning and 501.2MB in the end (delta: 283.1MB). Free memory was 175.9MB in the beginning and 352.8MB in the end (delta: -177.0MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. [2024-10-13 04:01:47,037 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 501.2MB. Free memory is still 352.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:01:47,037 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 161.5MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.76ms. Allocated memory is still 161.5MB. Free memory was 108.0MB in the beginning and 89.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.21ms. Allocated memory is still 161.5MB. Free memory was 89.1MB in the beginning and 83.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.24ms. Allocated memory is still 161.5MB. Free memory was 83.2MB in the beginning and 73.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 737.51ms. Allocated memory was 161.5MB in the beginning and 218.1MB in the end (delta: 56.6MB). Free memory was 73.4MB in the beginning and 176.9MB in the end (delta: -103.5MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16489.43ms. Allocated memory was 218.1MB in the beginning and 501.2MB in the end (delta: 283.1MB). Free memory was 175.9MB in the beginning and 352.8MB in the end (delta: -177.0MB). Peak memory consumption was 106.1MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 501.2MB. Free memory is still 352.8MB. 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 someBinaryDOUBLEComparisonOperation at line 200, overapproximation of someBinaryFLOATComparisonOperation at line 200. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] signed short int var_1_8 = -16; [L28] signed long int var_1_12 = -10; [L29] double var_1_14 = 127.8; [L30] double var_1_15 = 1.375; [L31] unsigned char var_1_19 = 1; [L32] float var_1_20 = 10.4; [L33] float var_1_21 = 3.075; [L34] double var_1_22 = 64.375; [L35] signed char var_1_23 = 16; [L36] signed char var_1_24 = 64; [L37] signed char var_1_25 = 0; [L38] double var_1_26 = 255.125; [L39] unsigned short int var_1_27 = 128; [L40] unsigned char var_1_28 = 1; [L41] unsigned short int var_1_29 = 128; [L42] unsigned short int var_1_30 = 49567; [L43] unsigned short int var_1_31 = 100; [L44] unsigned short int var_1_32 = 0; [L45] unsigned short int var_1_33 = 1; [L46] unsigned short int var_1_34 = 4; [L47] unsigned short int var_1_35 = 0; [L48] unsigned long int var_1_36 = 16; [L49] signed short int last_1_var_1_8 = -16; [L50] signed long int last_1_var_1_12 = -10; [L51] float last_1_var_1_20 = 10.4; [L52] signed char last_1_var_1_23 = 16; [L53] unsigned char last_1_var_1_28 = 1; [L54] unsigned short int last_1_var_1_29 = 128; [L55] unsigned long int last_1_var_1_36 = 16; [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L191] last_1_var_1_8 = var_1_8 [L192] last_1_var_1_12 = var_1_12 [L193] last_1_var_1_20 = var_1_20 [L194] last_1_var_1_23 = var_1_23 [L195] last_1_var_1_28 = var_1_28 [L196] last_1_var_1_29 = var_1_29 [L197] last_1_var_1_36 = var_1_36 [L207] RET updateLastVariables() [L208] CALL updateVariables() [L145] var_1_4 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L146] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L147] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L147] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L148] var_1_5 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L149] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L150] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L150] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L151] var_1_6 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=-16] [L152] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=-16] [L153] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L153] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L154] var_1_7 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=-16] [L155] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=-16] [L156] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L156] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L157] var_1_14 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L158] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L159] CALL assume_abort_if_not(var_1_14 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L159] RET assume_abort_if_not(var_1_14 != 0.0F) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L160] var_1_15 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L161] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L162] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L162] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L163] var_1_21 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L164] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L165] var_1_24 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_24 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L166] RET assume_abort_if_not(var_1_24 >= 63) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L167] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L167] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L168] var_1_25 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L170] CALL assume_abort_if_not(var_1_25 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L170] RET assume_abort_if_not(var_1_25 <= 63) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L171] var_1_30 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L172] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L173] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L173] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L174] var_1_31 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L176] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L176] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L177] var_1_32 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L178] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L179] CALL assume_abort_if_not(var_1_32 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L179] RET assume_abort_if_not(var_1_32 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L180] var_1_33 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L181] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L182] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L182] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L183] var_1_34 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L184] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L185] CALL assume_abort_if_not(var_1_34 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L185] RET assume_abort_if_not(var_1_34 <= 32767) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L186] var_1_35 = __VERIFIER_nondet_ushort() [L187] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L187] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L188] CALL assume_abort_if_not(var_1_35 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L188] RET assume_abort_if_not(var_1_35 <= 32767) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L208] RET updateVariables() [L209] CALL step() [L59] signed long int stepLocal_7 = last_1_var_1_23 + var_1_24; [L60] signed long int stepLocal_6 = last_1_var_1_23; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L61] COND FALSE !(\read(var_1_7)) [L70] var_1_28 = 0 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L72] unsigned char stepLocal_5 = var_1_21 != last_1_var_1_20; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_5=0, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L73] COND FALSE !((var_1_6 || last_1_var_1_28) && stepLocal_5) [L76] var_1_23 = (var_1_25 - var_1_24) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L78] COND FALSE !(\read(var_1_5)) [L81] var_1_26 = var_1_21 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L83] var_1_27 = var_1_24 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L84] COND FALSE !(\read(var_1_28)) [L87] var_1_8 = var_1_23 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L89] unsigned char stepLocal_3 = var_1_27 < (var_1_23 >> 25); [L90] unsigned short int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_3=0, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L91] COND FALSE !(stepLocal_3 && var_1_6) [L98] var_1_19 = var_1_7 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L100] signed long int stepLocal_4 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_4=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L101] COND FALSE !(last_1_var_1_23 <= stepLocal_4) [L104] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L106] COND TRUE var_1_20 > var_1_15 [L107] var_1_22 = var_1_21 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L109] COND TRUE var_1_20 < var_1_14 [L110] var_1_29 = ((((((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) < (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33))))) ? (((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) : (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33)))))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L114] EXPR (var_1_23 * var_1_23) & var_1_8 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L114] signed long int stepLocal_1 = (var_1_23 * var_1_23) & var_1_8; [L115] COND TRUE (var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L116] COND TRUE var_1_14 >= (var_1_15 * var_1_22) [L117] var_1_12 = (var_1_23 + var_1_23) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L128] unsigned char stepLocal_0 = var_1_28; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_0=0, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L129] COND FALSE !(stepLocal_0 || var_1_19) [L132] var_1_1 = (var_1_4 && ((var_1_5 || var_1_6) || var_1_7)) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L134] COND TRUE (var_1_12 < (var_1_33 + var_1_30)) || (256 > last_1_var_1_36) [L135] var_1_36 = var_1_30 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L209] RET step() [L210] CALL, EXPR property() [L200] EXPR (((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23)))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR ((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR (((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23)))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR ((((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))))) && (((var_1_27 < (var_1_23 >> 25)) && var_1_6) ? ((var_1_27 < (var_1_23 | var_1_23)) ? (var_1_19 == ((unsigned char) var_1_5)) : (var_1_19 == ((unsigned char) var_1_4))) : (var_1_19 == ((unsigned char) var_1_7))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR ((((((((((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))))) && (((var_1_27 < (var_1_23 >> 25)) && var_1_6) ? ((var_1_27 < (var_1_23 | var_1_23)) ? (var_1_19 == ((unsigned char) var_1_5)) : (var_1_19 == ((unsigned char) var_1_4))) : (var_1_19 == ((unsigned char) var_1_7)))) && ((last_1_var_1_23 <= last_1_var_1_8) ? (var_1_20 == ((float) (var_1_21 + 10.4f))) : (var_1_20 == ((float) var_1_21)))) && ((var_1_20 > var_1_15) ? (var_1_22 == ((double) var_1_21)) : 1)) && (((var_1_6 || last_1_var_1_28) && (var_1_21 != last_1_var_1_20)) ? (var_1_23 == ((signed char) (-1 - (var_1_24 - var_1_25)))) : (var_1_23 == ((signed char) (var_1_25 - var_1_24))))) && (var_1_5 ? (var_1_26 == ((double) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (var_1_26 == ((double) var_1_21)))) && (var_1_27 == ((unsigned short int) var_1_24))) && (var_1_7 ? (((last_1_var_1_23 + var_1_24) < (last_1_var_1_36 ^ last_1_var_1_29)) ? ((last_1_var_1_36 <= last_1_var_1_23) ? (var_1_28 == ((unsigned char) var_1_4)) : (var_1_28 == ((unsigned char) var_1_6))) : 1) : (var_1_28 == ((unsigned char) 0))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200-L201] return ((((((((((((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))))) && (((var_1_27 < (var_1_23 >> 25)) && var_1_6) ? ((var_1_27 < (var_1_23 | var_1_23)) ? (var_1_19 == ((unsigned char) var_1_5)) : (var_1_19 == ((unsigned char) var_1_4))) : (var_1_19 == ((unsigned char) var_1_7)))) && ((last_1_var_1_23 <= last_1_var_1_8) ? (var_1_20 == ((float) (var_1_21 + 10.4f))) : (var_1_20 == ((float) var_1_21)))) && ((var_1_20 > var_1_15) ? (var_1_22 == ((double) var_1_21)) : 1)) && (((var_1_6 || last_1_var_1_28) && (var_1_21 != last_1_var_1_20)) ? (var_1_23 == ((signed char) (-1 - (var_1_24 - var_1_25)))) : (var_1_23 == ((signed char) (var_1_25 - var_1_24))))) && (var_1_5 ? (var_1_26 == ((double) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (var_1_26 == ((double) var_1_21)))) && (var_1_27 == ((unsigned short int) var_1_24))) && (var_1_7 ? (((last_1_var_1_23 + var_1_24) < (last_1_var_1_36 ^ last_1_var_1_29)) ? ((last_1_var_1_36 <= last_1_var_1_23) ? (var_1_28 == ((unsigned char) var_1_4)) : (var_1_28 == ((unsigned char) var_1_6))) : 1) : (var_1_28 == ((unsigned char) 0)))) && ((var_1_20 < var_1_14) ? (var_1_29 == ((unsigned short int) ((((((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) < (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33))))) ? (((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) : (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33)))))))) : (var_1_29 == ((unsigned short int) ((((var_1_24) > ((((((var_1_25) > (var_1_34)) ? (var_1_25) : (var_1_34))) + var_1_35))) ? (var_1_24) : ((((((var_1_25) > (var_1_34)) ? (var_1_25) : (var_1_34))) + var_1_35)))))))) && (((var_1_12 < (var_1_33 + var_1_30)) || (256 > last_1_var_1_36)) ? (var_1_36 == ((unsigned long int) var_1_30)) : ((((var_1_28 || var_1_19) || var_1_7) && var_1_1) ? (var_1_36 == ((unsigned long int) var_1_31)) : (var_1_36 == ((unsigned long int) var_1_34)))) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 11, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2047 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2030 mSDsluCounter, 6310 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4294 mSDsCounter, 341 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2630 IncrementalHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 341 mSolverCounterUnsat, 2016 mSDtfsCounter, 2630 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1329 GetRequests, 1234 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1117occurred in iteration=7, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 990 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 2676 NumberOfCodeBlocks, 2676 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2280 ConstructedInterpolants, 10 QuantifiedInterpolants, 6319 SizeOfPredicates, 5 NumberOfNonLiveVariables, 921 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 19119/19488 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 04:01:47,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.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 6b261b46738dc0a9db26822637ec843da493e234cf769a01c10942fcb0315b00 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:01:49,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:01:49,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:01:49,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:01:49,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:01:49,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:01:49,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:01:49,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:01:49,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:01:49,391 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:01:49,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:01:49,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:01:49,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:01:49,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:01:49,394 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:01:49,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:01:49,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:01:49,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:01:49,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:01:49,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:01:49,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:01:49,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:01:49,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:01:49,398 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:01:49,398 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:01:49,399 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:01:49,399 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:01:49,399 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:01:49,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:01:49,399 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:01:49,400 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:01:49,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:01:49,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:01:49,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:01:49,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:01:49,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:01:49,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:01:49,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:01:49,403 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:01:49,403 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:01:49,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:01:49,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:01:49,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:01:49,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:01:49,404 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:01:49,404 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 -> 6b261b46738dc0a9db26822637ec843da493e234cf769a01c10942fcb0315b00 [2024-10-13 04:01:49,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:01:49,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:01:49,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:01:49,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:01:49,664 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:01:49,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i [2024-10-13 04:01:50,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:01:51,136 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:01:51,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i [2024-10-13 04:01:51,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e59f50ca/1af24842e1ff4ee7a9c3e8825a06b7b1/FLAG29146c4d4 [2024-10-13 04:01:51,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e59f50ca/1af24842e1ff4ee7a9c3e8825a06b7b1 [2024-10-13 04:01:51,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:01:51,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:01:51,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:01:51,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:01:51,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:01:51,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7414039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51, skipping insertion in model container [2024-10-13 04:01:51,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:01:51,357 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i[916,929] [2024-10-13 04:01:51,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:01:51,474 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:01:51,485 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i[916,929] [2024-10-13 04:01:51,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:01:51,532 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:01:51,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51 WrapperNode [2024-10-13 04:01:51,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:01:51,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:01:51,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:01:51,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:01:51,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,591 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-10-13 04:01:51,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:01:51,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:01:51,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:01:51,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:01:51,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,630 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:01:51,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:01:51,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:01:51,658 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:01:51,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:01:51,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51" (1/1) ... [2024-10-13 04:01:51,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:01:51,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:01:51,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 04:01:51,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 04:01:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:01:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:01:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:01:51,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:01:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:01:51,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:01:51,795 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:01:51,797 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:02:11,232 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-13 04:02:11,233 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:02:11,281 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:02:11,282 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:02:11,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:02:11 BoogieIcfgContainer [2024-10-13 04:02:11,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:02:11,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:02:11,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:02:11,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:02:11,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:01:51" (1/3) ... [2024-10-13 04:02:11,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc1b806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:02:11, skipping insertion in model container [2024-10-13 04:02:11,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:51" (2/3) ... [2024-10-13 04:02:11,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc1b806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:02:11, skipping insertion in model container [2024-10-13 04:02:11,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:02:11" (3/3) ... [2024-10-13 04:02:11,289 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-72.i [2024-10-13 04:02:11,311 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:02:11,311 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:02:11,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:02:11,362 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;@4b33b972, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:02:11,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:02:11,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 04:02:11,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-13 04:02:11,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:02:11,379 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:02:11,379 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:02:11,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:02:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash -26098837, now seen corresponding path program 1 times [2024-10-13 04:02:11,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:02:11,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448737617] [2024-10-13 04:02:11,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:02:11,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:02:11,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:02:11,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:02:11,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 04:02:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:02:12,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 04:02:12,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:02:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 334 proven. 75 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2024-10-13 04:02:17,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:02:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-13 04:02:22,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:02:22,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448737617] [2024-10-13 04:02:22,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448737617] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:02:22,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 04:02:22,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-13 04:02:22,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541370231] [2024-10-13 04:02:22,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 04:02:22,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:02:22,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:02:22,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:02:22,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:02:22,051 INFO L87 Difference]: Start difference. First operand has 80 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-13 04:02:30,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:02:34,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:02:38,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:02:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:02:38,057 INFO L93 Difference]: Finished difference Result 165 states and 293 transitions. [2024-10-13 04:02:38,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 04:02:38,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 183 [2024-10-13 04:02:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:02:38,206 INFO L225 Difference]: With dead ends: 165 [2024-10-13 04:02:38,206 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 04:02:38,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 358 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 04:02:38,211 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 89 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2024-10-13 04:02:38,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 196 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 3 Unknown, 0 Unchecked, 15.5s Time] [2024-10-13 04:02:38,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 04:02:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-10-13 04:02:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 04:02:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-10-13 04:02:38,249 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 183 [2024-10-13 04:02:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:02:38,250 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-10-13 04:02:38,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-13 04:02:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-10-13 04:02:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-13 04:02:38,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:02:38,253 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:02:38,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 04:02:38,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:02:38,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:02:38,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:02:38,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2020243543, now seen corresponding path program 1 times [2024-10-13 04:02:38,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:02:38,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267423385] [2024-10-13 04:02:38,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:02:38,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:02:38,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:02:38,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:02:38,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 04:02:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:02:39,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 04:02:39,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:02:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 04:02:51,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:02:51,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:02:51,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267423385] [2024-10-13 04:02:51,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267423385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:02:51,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:02:51,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:02:51,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741220314] [2024-10-13 04:02:51,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:02:51,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:02:51,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:02:51,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:02:51,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:02:51,154 INFO L87 Difference]: Start difference. First operand 82 states and 125 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 04:02:55,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:02:58,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []