./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 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-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-dev-4a390ef-m [2024-10-24 09:20:01,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:20:01,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:20:01,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:20:01,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:20:01,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:20:01,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:20:01,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:20:01,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:20:01,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:20:01,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:20:01,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:20:01,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:20:01,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:20:01,894 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:20:01,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:20:01,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:20:01,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:20:01,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:20:01,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:20:01,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:20:01,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:20:01,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:20:01,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:20:01,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:20:01,898 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:20:01,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:20:01,898 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:20:01,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:20:01,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:20:01,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:20:01,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:20:01,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:20:01,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:20:01,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:20:01,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:20:01,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:20:01,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:20:01,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:20:01,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:20:01,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:20:01,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:20:01,903 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-24 09:20:02,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:20:02,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:20:02,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:20:02,153 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:20:02,155 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:20:02,156 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-24 09:20:03,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:20:03,778 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:20:03,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i [2024-10-24 09:20:03,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac96a1de/95f683de4c754d0ab87f7d4a3e325bb0/FLAGd7d3c0352 [2024-10-24 09:20:04,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac96a1de/95f683de4c754d0ab87f7d4a3e325bb0 [2024-10-24 09:20:04,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:20:04,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:20:04,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:20:04,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:20:04,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:20:04,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@676546a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04, skipping insertion in model container [2024-10-24 09:20:04,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:20:04,337 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-24 09:20:04,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:20:04,408 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:20:04,421 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-24 09:20:04,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:20:04,469 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:20:04,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04 WrapperNode [2024-10-24 09:20:04,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:20:04,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:20:04,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:20:04,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:20:04,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,541 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 304 [2024-10-24 09:20:04,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:20:04,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:20:04,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:20:04,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:20:04,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,632 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:20:04,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:20:04,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:20:04,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:20:04,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:20:04,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04" (1/1) ... [2024-10-24 09:20:04,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:20:04,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:20:04,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:20:04,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:20:04,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:20:04,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:20:04,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:20:04,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:20:04,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:20:04,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:20:04,834 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:20:04,836 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:20:05,454 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-10-24 09:20:05,454 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:20:05,492 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:20:05,493 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:20:05,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:20:05 BoogieIcfgContainer [2024-10-24 09:20:05,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:20:05,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:20:05,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:20:05,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:20:05,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:20:04" (1/3) ... [2024-10-24 09:20:05,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528540e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:20:05, skipping insertion in model container [2024-10-24 09:20:05,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:04" (2/3) ... [2024-10-24 09:20:05,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528540e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:20:05, skipping insertion in model container [2024-10-24 09:20:05,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:20:05" (3/3) ... [2024-10-24 09:20:05,500 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-72.i [2024-10-24 09:20:05,512 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:20:05,512 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:20:05,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:20:05,569 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;@262d21d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:20:05,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:20:05,574 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-24 09:20:05,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-24 09:20:05,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:05,585 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-24 09:20:05,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:05,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:05,589 INFO L85 PathProgramCache]: Analyzing trace with hash 278803541, now seen corresponding path program 1 times [2024-10-24 09:20:05,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:05,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933219860] [2024-10-24 09:20:05,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:05,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:20:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:20:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:20:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:20:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:20:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:20:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:20:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:20:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:20:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:20:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:20:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:20:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:05,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:20:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:20:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:20:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:20:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,025 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-24 09:20:06,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:06,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933219860] [2024-10-24 09:20:06,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933219860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:06,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:06,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:20:06,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598172845] [2024-10-24 09:20:06,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:06,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:20:06,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:06,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:20:06,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:20:06,053 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-24 09:20:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:06,096 INFO L93 Difference]: Finished difference Result 231 states and 399 transitions. [2024-10-24 09:20:06,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:20:06,102 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-24 09:20:06,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:06,144 INFO L225 Difference]: With dead ends: 231 [2024-10-24 09:20:06,144 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 09:20:06,147 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-24 09:20:06,150 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-24 09:20:06,153 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-24 09:20:06,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 09:20:06,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-24 09:20:06,217 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-24 09:20:06,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 176 transitions. [2024-10-24 09:20:06,225 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 176 transitions. Word has length 190 [2024-10-24 09:20:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:06,225 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 176 transitions. [2024-10-24 09:20:06,225 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-24 09:20:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 176 transitions. [2024-10-24 09:20:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-24 09:20:06,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:06,229 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-24 09:20:06,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:20:06,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:06,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash 538436115, now seen corresponding path program 1 times [2024-10-24 09:20:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:06,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738147839] [2024-10-24 09:20:06,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:20:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:20:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:20:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:20:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:20:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:20:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:20:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:20:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:20:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:20:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:20:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:20:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:20:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:20:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:20:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:20:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:06,628 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-24 09:20:06,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:06,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738147839] [2024-10-24 09:20:06,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738147839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:06,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:06,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:20:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445993037] [2024-10-24 09:20:06,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:06,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:20:06,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:06,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:20:06,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:20:06,635 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-24 09:20:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:06,945 INFO L93 Difference]: Finished difference Result 338 states and 527 transitions. [2024-10-24 09:20:06,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:20:06,945 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-24 09:20:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:06,948 INFO L225 Difference]: With dead ends: 338 [2024-10-24 09:20:06,948 INFO L226 Difference]: Without dead ends: 226 [2024-10-24 09:20:06,949 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-24 09:20:06,950 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-24 09:20:06,950 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-24 09:20:06,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-24 09:20:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 180. [2024-10-24 09:20:06,989 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-24 09:20:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 282 transitions. [2024-10-24 09:20:06,992 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 282 transitions. Word has length 190 [2024-10-24 09:20:06,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:06,993 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 282 transitions. [2024-10-24 09:20:06,993 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-24 09:20:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 282 transitions. [2024-10-24 09:20:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-24 09:20:06,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:06,997 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-24 09:20:06,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:20:06,997 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:06,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1150507627, now seen corresponding path program 1 times [2024-10-24 09:20:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:06,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572555579] [2024-10-24 09:20:06,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:06,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:20:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:20:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:20:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:20:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:20:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:20:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:20:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:20:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:20:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:20:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:20:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:20:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:20:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:20:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:20:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:20:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,386 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-24 09:20:07,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:07,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572555579] [2024-10-24 09:20:07,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572555579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:07,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:07,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:20:07,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475581707] [2024-10-24 09:20:07,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:07,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:20:07,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:07,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:20:07,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:20:07,389 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-24 09:20:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:07,437 INFO L93 Difference]: Finished difference Result 421 states and 656 transitions. [2024-10-24 09:20:07,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:20:07,438 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-24 09:20:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:07,445 INFO L225 Difference]: With dead ends: 421 [2024-10-24 09:20:07,445 INFO L226 Difference]: Without dead ends: 303 [2024-10-24 09:20:07,446 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-24 09:20:07,447 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-24 09:20:07,447 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-24 09:20:07,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-24 09:20:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2024-10-24 09:20:07,487 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-24 09:20:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 468 transitions. [2024-10-24 09:20:07,489 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 468 transitions. Word has length 190 [2024-10-24 09:20:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:07,490 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 468 transitions. [2024-10-24 09:20:07,490 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-24 09:20:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 468 transitions. [2024-10-24 09:20:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-24 09:20:07,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:07,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-24 09:20:07,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:20:07,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:07,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:07,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1339021335, now seen corresponding path program 1 times [2024-10-24 09:20:07,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:07,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929593279] [2024-10-24 09:20:07,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:07,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:20:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:07,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:20:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:20:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:20:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:20:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:20:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:20:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:20:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:20:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:20:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:20:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:20:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:20:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:20:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:20:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:20:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:08,057 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-24 09:20:08,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:08,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929593279] [2024-10-24 09:20:08,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929593279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:08,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:08,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:20:08,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574830045] [2024-10-24 09:20:08,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:08,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:20:08,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:08,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:20:08,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:20:08,062 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-24 09:20:08,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:08,385 INFO L93 Difference]: Finished difference Result 708 states and 1093 transitions. [2024-10-24 09:20:08,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 09:20:08,385 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-24 09:20:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:08,394 INFO L225 Difference]: With dead ends: 708 [2024-10-24 09:20:08,394 INFO L226 Difference]: Without dead ends: 487 [2024-10-24 09:20:08,395 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-24 09:20:08,399 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.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:20:08,399 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.3s Time] [2024-10-24 09:20:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-10-24 09:20:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 456. [2024-10-24 09:20:08,469 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-24 09:20:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 700 transitions. [2024-10-24 09:20:08,474 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 700 transitions. Word has length 190 [2024-10-24 09:20:08,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:08,475 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 700 transitions. [2024-10-24 09:20:08,476 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-24 09:20:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 700 transitions. [2024-10-24 09:20:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-24 09:20:08,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:08,480 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-24 09:20:08,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:20:08,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:08,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:08,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2040085913, now seen corresponding path program 1 times [2024-10-24 09:20:08,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:08,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465662496] [2024-10-24 09:20:08,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:08,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:20:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:20:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:20:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:20:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:20:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:20:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:20:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:20:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:20:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:20:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:20:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:20:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:20:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:20:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:20:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:20:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:09,891 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-24 09:20:09,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:09,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465662496] [2024-10-24 09:20:09,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465662496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:09,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:09,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:20:09,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92150174] [2024-10-24 09:20:09,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:09,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:20:09,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:09,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:20:09,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:20:09,893 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-24 09:20:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:10,198 INFO L93 Difference]: Finished difference Result 1200 states and 1808 transitions. [2024-10-24 09:20:10,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 09:20:10,199 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-24 09:20:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:10,204 INFO L225 Difference]: With dead ends: 1200 [2024-10-24 09:20:10,204 INFO L226 Difference]: Without dead ends: 825 [2024-10-24 09:20:10,205 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-24 09:20:10,205 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-24 09:20:10,206 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-24 09:20:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-24 09:20:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 723. [2024-10-24 09:20:10,271 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-24 09:20:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1090 transitions. [2024-10-24 09:20:10,278 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1090 transitions. Word has length 190 [2024-10-24 09:20:10,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:10,278 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1090 transitions. [2024-10-24 09:20:10,278 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-24 09:20:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1090 transitions. [2024-10-24 09:20:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-24 09:20:10,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:10,284 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-24 09:20:10,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:20:10,285 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:10,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:10,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2114332773, now seen corresponding path program 1 times [2024-10-24 09:20:10,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:10,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607623438] [2024-10-24 09:20:10,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:10,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:20:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:20:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:20:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:20:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:20:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:20:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:20:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:20:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:20:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:20:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:20:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:20:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:20:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:20:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:20:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:20:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:11,355 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-24 09:20:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607623438] [2024-10-24 09:20:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607623438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:11,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:11,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 09:20:11,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358784907] [2024-10-24 09:20:11,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:11,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:20:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:11,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:20:11,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:20:11,356 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-24 09:20:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:11,911 INFO L93 Difference]: Finished difference Result 1423 states and 2116 transitions. [2024-10-24 09:20:11,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 09:20:11,912 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-24 09:20:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:11,916 INFO L225 Difference]: With dead ends: 1423 [2024-10-24 09:20:11,916 INFO L226 Difference]: Without dead ends: 805 [2024-10-24 09:20:11,917 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-24 09:20:11,917 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 217 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-24 09:20:11,918 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.5s Time] [2024-10-24 09:20:11,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-10-24 09:20:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 685. [2024-10-24 09:20:11,950 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-24 09:20:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1018 transitions. [2024-10-24 09:20:11,953 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1018 transitions. Word has length 190 [2024-10-24 09:20:11,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:11,954 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1018 transitions. [2024-10-24 09:20:11,954 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-24 09:20:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1018 transitions. [2024-10-24 09:20:11,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 09:20:11,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:11,955 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-24 09:20:11,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 09:20:11,956 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:11,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1076408433, now seen corresponding path program 1 times [2024-10-24 09:20:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:11,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189667792] [2024-10-24 09:20:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:11,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:20:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:20:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:20:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:20:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:20:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:20:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:20:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:20:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:20:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:20:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:20:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:20:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:20:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:20:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:20:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:20:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:12,490 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-24 09:20:12,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:12,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189667792] [2024-10-24 09:20:12,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189667792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:12,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:12,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:20:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918183748] [2024-10-24 09:20:12,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:12,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:20:12,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:20:12,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:20:12,510 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-24 09:20:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:12,977 INFO L93 Difference]: Finished difference Result 1720 states and 2546 transitions. [2024-10-24 09:20:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:20:12,977 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-24 09:20:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:12,984 INFO L225 Difference]: With dead ends: 1720 [2024-10-24 09:20:12,984 INFO L226 Difference]: Without dead ends: 1122 [2024-10-24 09:20:12,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:20:12,986 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 107 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:20:12,986 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.4s Time] [2024-10-24 09:20:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-10-24 09:20:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1117. [2024-10-24 09:20:13,048 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-24 09:20:13,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1638 transitions. [2024-10-24 09:20:13,053 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1638 transitions. Word has length 192 [2024-10-24 09:20:13,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:13,053 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1638 transitions. [2024-10-24 09:20:13,054 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-24 09:20:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1638 transitions. [2024-10-24 09:20:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 09:20:13,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:13,055 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-24 09:20:13,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 09:20:13,055 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:13,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash -26213922, now seen corresponding path program 1 times [2024-10-24 09:20:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:13,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336010053] [2024-10-24 09:20:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:13,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:20:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:20:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:20:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:20:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:20:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:20:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:20:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:20:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:20:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:20:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:20:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:20:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:20:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:20:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:20:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:20:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,356 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-24 09:20:13,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:13,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336010053] [2024-10-24 09:20:13,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336010053] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:20:13,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342747222] [2024-10-24 09:20:13,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:13,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:20:13,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:20:13,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:20:13,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:20:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:13,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:20:13,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:20:13,820 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-24 09:20:13,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:20:14,087 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-24 09:20:14,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342747222] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:20:14,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 09:20:14,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 09:20:14,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115500877] [2024-10-24 09:20:14,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 09:20:14,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:20:14,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:14,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:20:14,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:20:14,090 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-24 09:20:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:14,395 INFO L93 Difference]: Finished difference Result 1913 states and 2749 transitions. [2024-10-24 09:20:14,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 09:20:14,395 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-24 09:20:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:14,400 INFO L225 Difference]: With dead ends: 1913 [2024-10-24 09:20:14,400 INFO L226 Difference]: Without dead ends: 883 [2024-10-24 09:20:14,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:20:14,403 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 195 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:20:14,403 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.2s Time] [2024-10-24 09:20:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-10-24 09:20:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 821. [2024-10-24 09:20:14,448 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-24 09:20:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1168 transitions. [2024-10-24 09:20:14,452 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1168 transitions. Word has length 192 [2024-10-24 09:20:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:14,452 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1168 transitions. [2024-10-24 09:20:14,452 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-24 09:20:14,452 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1168 transitions. [2024-10-24 09:20:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 09:20:14,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:14,454 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-24 09:20:14,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:20:14,658 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-24 09:20:14,659 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:14,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:14,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1897014112, now seen corresponding path program 1 times [2024-10-24 09:20:14,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:14,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736116263] [2024-10-24 09:20:14,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:14,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:20:14,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645938428] [2024-10-24 09:20:14,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:14,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:20:14,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:20:14,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:20:14,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 09:20:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:14,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 09:20:14,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:20:15,754 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-24 09:20:15,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:20:18,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:18,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736116263] [2024-10-24 09:20:18,991 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 09:20:18,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645938428] [2024-10-24 09:20:18,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645938428] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:20:18,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 09:20:18,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-10-24 09:20:18,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734293536] [2024-10-24 09:20:18,991 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 09:20:18,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 09:20:18,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 09:20:18,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-10-24 09:20:18,994 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-24 09:20:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:21,972 INFO L93 Difference]: Finished difference Result 1988 states and 2731 transitions. [2024-10-24 09:20:21,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-24 09:20:21,972 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-24 09:20:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:21,978 INFO L225 Difference]: With dead ends: 1988 [2024-10-24 09:20:21,978 INFO L226 Difference]: Without dead ends: 1274 [2024-10-24 09:20:21,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=736, Invalid=2344, Unknown=0, NotChecked=0, Total=3080 [2024-10-24 09:20:21,983 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 606 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:20:21,984 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.1s Time] [2024-10-24 09:20:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-10-24 09:20:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1003. [2024-10-24 09:20:22,048 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-24 09:20:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1361 transitions. [2024-10-24 09:20:22,052 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1361 transitions. Word has length 192 [2024-10-24 09:20:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:22,052 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1361 transitions. [2024-10-24 09:20:22,053 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-24 09:20:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1361 transitions. [2024-10-24 09:20:22,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 09:20:22,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:22,054 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-24 09:20:22,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 09:20:22,258 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-24 09:20:22,258 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:22,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash 337346511, now seen corresponding path program 1 times [2024-10-24 09:20:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:22,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324736259] [2024-10-24 09:20:22,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:22,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:20:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:20:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:20:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 09:20:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 09:20:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 09:20:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 09:20:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 09:20:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 09:20:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 09:20:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 09:20:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 09:20:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 09:20:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 09:20:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-24 09:20:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-24 09:20:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:22,767 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-24 09:20:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:22,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324736259] [2024-10-24 09:20:22,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324736259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:22,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:20:22,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287693728] [2024-10-24 09:20:22,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:22,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:20:22,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:22,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:20:22,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:20:22,769 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-24 09:20:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:23,042 INFO L93 Difference]: Finished difference Result 1822 states and 2472 transitions. [2024-10-24 09:20:23,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:20:23,042 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-24 09:20:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:23,046 INFO L225 Difference]: With dead ends: 1822 [2024-10-24 09:20:23,046 INFO L226 Difference]: Without dead ends: 938 [2024-10-24 09:20:23,048 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-24 09:20:23,048 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-24 09:20:23,049 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-24 09:20:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-10-24 09:20:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 588. [2024-10-24 09:20:23,170 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-24 09:20:23,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 798 transitions. [2024-10-24 09:20:23,173 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 798 transitions. Word has length 192 [2024-10-24 09:20:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:23,174 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 798 transitions. [2024-10-24 09:20:23,175 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-24 09:20:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 798 transitions. [2024-10-24 09:20:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 09:20:23,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:23,177 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-24 09:20:23,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 09:20:23,177 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:23,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:23,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1387541022, now seen corresponding path program 1 times [2024-10-24 09:20:23,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:23,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139857981] [2024-10-24 09:20:23,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:23,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:20:23,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75721160] [2024-10-24 09:20:23,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:23,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:20:23,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:20:23,253 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-24 09:20:23,254 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-24 09:20:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:20:23,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:20:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:20:23,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:20:23,536 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:20:23,537 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:20:23,554 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-24 09:20:23,739 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-24 09:20:23,742 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:20:23,862 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:20:23,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:20:23 BoogieIcfgContainer [2024-10-24 09:20:23,864 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:20:23,865 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:20:23,865 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:20:23,865 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:20:23,866 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:20:05" (3/4) ... [2024-10-24 09:20:23,867 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:20:23,868 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:20:23,868 INFO L158 Benchmark]: Toolchain (without parser) took 19716.95ms. Allocated memory was 142.6MB in the beginning and 666.9MB in the end (delta: 524.3MB). Free memory was 71.4MB in the beginning and 498.7MB in the end (delta: -427.3MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2024-10-24 09:20:23,869 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 142.6MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:20:23,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.30ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 52.6MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:20:23,869 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.67ms. Allocated memory is still 142.6MB. Free memory was 52.6MB in the beginning and 46.7MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:20:23,869 INFO L158 Benchmark]: Boogie Preprocessor took 112.61ms. Allocated memory was 142.6MB in the beginning and 241.2MB in the end (delta: 98.6MB). Free memory was 46.7MB in the beginning and 202.3MB in the end (delta: -155.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-10-24 09:20:23,869 INFO L158 Benchmark]: RCFGBuilder took 837.73ms. Allocated memory is still 241.2MB. Free memory was 202.3MB in the beginning and 161.4MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-24 09:20:23,870 INFO L158 Benchmark]: TraceAbstraction took 18369.46ms. Allocated memory was 241.2MB in the beginning and 666.9MB in the end (delta: 425.7MB). Free memory was 160.3MB in the beginning and 498.7MB in the end (delta: -338.3MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2024-10-24 09:20:23,870 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 666.9MB. Free memory is still 498.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:20:23,871 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.52ms. Allocated memory is still 142.6MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.30ms. Allocated memory is still 142.6MB. Free memory was 71.4MB in the beginning and 52.6MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.67ms. Allocated memory is still 142.6MB. Free memory was 52.6MB in the beginning and 46.7MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.61ms. Allocated memory was 142.6MB in the beginning and 241.2MB in the end (delta: 98.6MB). Free memory was 46.7MB in the beginning and 202.3MB in the end (delta: -155.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * RCFGBuilder took 837.73ms. Allocated memory is still 241.2MB. Free memory was 202.3MB in the beginning and 161.4MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18369.46ms. Allocated memory was 241.2MB in the beginning and 666.9MB in the end (delta: 425.7MB). Free memory was 160.3MB in the beginning and 498.7MB in the end (delta: -338.3MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 666.9MB. Free memory is still 498.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of 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: 18.2s, OverallIterations: 11, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2047 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2030 mSDsluCounter, 6310 SdHoareTripleChecker+Invalid, 2.7s 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.2s 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.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 990 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.6s 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-24 09:20:23,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-dev-4a390ef-m [2024-10-24 09:20:25,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:20:26,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:20:26,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:20:26,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:20:26,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:20:26,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:20:26,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:20:26,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:20:26,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:20:26,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:20:26,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:20:26,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:20:26,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:20:26,089 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:20:26,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:20:26,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:20:26,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:20:26,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:20:26,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:20:26,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:20:26,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:20:26,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:20:26,091 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:20:26,092 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:20:26,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:20:26,092 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:20:26,092 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:20:26,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:20:26,093 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:20:26,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:20:26,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:20:26,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:20:26,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:20:26,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:20:26,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:20:26,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:20:26,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:20:26,095 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:20:26,095 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:20:26,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:20:26,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:20:26,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:20:26,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:20:26,096 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:20:26,096 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-24 09:20:26,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:20:26,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:20:26,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:20:26,372 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:20:26,372 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:20:26,375 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-24 09:20:27,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:20:28,008 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:20:28,009 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i [2024-10-24 09:20:28,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a45c46dc/b814cd00607b4dc095e8349ff26723c5/FLAG8c00a0054 [2024-10-24 09:20:28,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a45c46dc/b814cd00607b4dc095e8349ff26723c5 [2024-10-24 09:20:28,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:20:28,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:20:28,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:20:28,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:20:28,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:20:28,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470a36e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28, skipping insertion in model container [2024-10-24 09:20:28,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:20:28,247 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-24 09:20:28,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:20:28,340 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:20:28,349 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-24 09:20:28,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:20:28,406 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:20:28,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28 WrapperNode [2024-10-24 09:20:28,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:20:28,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:20:28,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:20:28,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:20:28,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,451 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-10-24 09:20:28,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:20:28,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:20:28,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:20:28,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:20:28,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,485 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:20:28,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,486 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:20:28,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:20:28,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:20:28,511 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:20:28,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28" (1/1) ... [2024-10-24 09:20:28,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:20:28,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:20:28,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:20:28,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:20:28,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:20:28,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:20:28,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:20:28,606 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:20:28,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:20:28,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:20:28,687 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:20:28,688 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:20:50,152 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-24 09:20:50,152 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:20:50,199 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:20:50,200 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:20:50,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:20:50 BoogieIcfgContainer [2024-10-24 09:20:50,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:20:50,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:20:50,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:20:50,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:20:50,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:20:28" (1/3) ... [2024-10-24 09:20:50,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b46683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:20:50, skipping insertion in model container [2024-10-24 09:20:50,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:28" (2/3) ... [2024-10-24 09:20:50,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b46683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:20:50, skipping insertion in model container [2024-10-24 09:20:50,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:20:50" (3/3) ... [2024-10-24 09:20:50,205 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-72.i [2024-10-24 09:20:50,217 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:20:50,217 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:20:50,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:20:50,295 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;@5352be7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:20:50,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:20:50,300 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-24 09:20:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 09:20:50,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:50,317 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-24 09:20:50,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:50,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:50,323 INFO L85 PathProgramCache]: Analyzing trace with hash -26098837, now seen corresponding path program 1 times [2024-10-24 09:20:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:20:50,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362260999] [2024-10-24 09:20:50,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:50,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:20:50,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:20:50,341 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:20:50,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 09:20:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:51,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 09:20:51,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:20:56,837 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-24 09:20:56,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:21:01,002 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-24 09:21:01,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:21:01,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362260999] [2024-10-24 09:21:01,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362260999] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:21:01,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:21:01,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-24 09:21:01,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539274911] [2024-10-24 09:21:01,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:21:01,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:21:01,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:21:01,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:21:01,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:21:01,026 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-24 09:21:09,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:21:13,021 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-24 09:21:17,037 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-24 09:21:17,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:21:17,038 INFO L93 Difference]: Finished difference Result 165 states and 293 transitions. [2024-10-24 09:21:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 09:21:17,208 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-24 09:21:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:21:17,216 INFO L225 Difference]: With dead ends: 165 [2024-10-24 09:21:17,216 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 09:21:17,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 358 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 09:21:17,223 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 89 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:21:17,224 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.4s Time] [2024-10-24 09:21:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 09:21:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-10-24 09:21:17,259 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-24 09:21:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-10-24 09:21:17,263 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 183 [2024-10-24 09:21:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:21:17,264 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-10-24 09:21:17,264 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-24 09:21:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-10-24 09:21:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-24 09:21:17,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:21:17,267 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-24 09:21:17,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 09:21:17,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:21:17,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:21:17,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:21:17,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2020243543, now seen corresponding path program 1 times [2024-10-24 09:21:17,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:21:17,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557165336] [2024-10-24 09:21:17,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:21:17,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:21:17,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:21:17,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:21:17,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 09:21:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:18,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:21:18,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:21:31,626 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-24 09:21:31,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:21:31,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:21:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557165336] [2024-10-24 09:21:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557165336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:21:31,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:21:31,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:21:31,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137499050] [2024-10-24 09:21:31,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:21:31,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:21:31,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:21:31,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:21:31,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:21:31,630 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-24 09:21:36,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []