/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 10:46:48,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 10:46:48,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 10:46:48,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 10:46:48,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 10:46:48,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 10:46:48,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 10:46:48,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 10:46:48,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 10:46:48,487 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 10:46:48,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 10:46:48,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 10:46:48,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 10:46:48,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 10:46:48,490 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 10:46:48,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 10:46:48,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 10:46:48,491 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 10:46:48,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 10:46:48,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 10:46:48,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 10:46:48,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 10:46:48,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 10:46:48,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 10:46:48,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 10:46:48,494 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 10:46:48,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 10:46:48,494 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 10:46:48,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 10:46:48,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 10:46:48,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 10:46:48,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 10:46:48,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:46:48,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 10:46:48,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 10:46:48,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 10:46:48,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 10:46:48,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 10:46:48,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 10:46:48,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 10:46:48,497 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 10:46:48,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 10:46:48,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 10:46:48,498 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: Use bitabs translation -> true [2023-12-19 10:46:48,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 10:46:48,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 10:46:48,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 10:46:48,789 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 10:46:48,789 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 10:46:48,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i [2023-12-19 10:46:49,961 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 10:46:50,245 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 10:46:50,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i [2023-12-19 10:46:50,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed62b3275/539253933ef84358bdd46bdf3040399a/FLAG7e19fb9de [2023-12-19 10:46:50,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed62b3275/539253933ef84358bdd46bdf3040399a [2023-12-19 10:46:50,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 10:46:50,278 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 10:46:50,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 10:46:50,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 10:46:50,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 10:46:50,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d46a160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50, skipping insertion in model container [2023-12-19 10:46:50,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,319 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 10:46:50,477 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i[916,929] [2023-12-19 10:46:50,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:46:50,544 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 10:46:50,562 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-33.i[916,929] [2023-12-19 10:46:50,588 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 10:46:50,606 INFO L206 MainTranslator]: Completed translation [2023-12-19 10:46:50,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50 WrapperNode [2023-12-19 10:46:50,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 10:46:50,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 10:46:50,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 10:46:50,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 10:46:50,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,658 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2023-12-19 10:46:50,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 10:46:50,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 10:46:50,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 10:46:50,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 10:46:50,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,697 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]. [2023-12-19 10:46:50,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 10:46:50,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 10:46:50,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 10:46:50,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 10:46:50,736 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50" (1/1) ... [2023-12-19 10:46:50,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 10:46:50,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 10:46:50,770 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) [2023-12-19 10:46:50,794 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 [2023-12-19 10:46:50,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 10:46:50,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 10:46:50,803 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 10:46:50,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 10:46:50,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 10:46:50,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 10:46:50,897 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 10:46:50,900 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 10:46:51,203 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 10:46:51,240 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 10:46:51,240 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 10:46:51,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:46:51 BoogieIcfgContainer [2023-12-19 10:46:51,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 10:46:51,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 10:46:51,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 10:46:51,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 10:46:51,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 10:46:50" (1/3) ... [2023-12-19 10:46:51,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130aeb17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:46:51, skipping insertion in model container [2023-12-19 10:46:51,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 10:46:50" (2/3) ... [2023-12-19 10:46:51,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130aeb17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 10:46:51, skipping insertion in model container [2023-12-19 10:46:51,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 10:46:51" (3/3) ... [2023-12-19 10:46:51,254 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-33.i [2023-12-19 10:46:51,266 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 10:46:51,267 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 10:46:51,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 10:46:51,322 INFO L357 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, mHoare=true, 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;@3f836b40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 10:46:51,322 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 10:46:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 43 states have internal predecessors, (67), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 10:46:51,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-19 10:46:51,345 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:51,347 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:46:51,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:51,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:51,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2011261731, now seen corresponding path program 1 times [2023-12-19 10:46:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:51,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923830460] [2023-12-19 10:46:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:51,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:51,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:51,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:51,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:51,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:51,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:51,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:51,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:51,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:51,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:51,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:51,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:46:51,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:51,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923830460] [2023-12-19 10:46:51,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923830460] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:51,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:51,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 10:46:51,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011355143] [2023-12-19 10:46:51,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:51,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 10:46:51,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:51,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 10:46:51,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 10:46:51,805 INFO L87 Difference]: Start difference. First operand has 57 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 43 states have internal predecessors, (67), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 10:46:51,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:51,851 INFO L93 Difference]: Finished difference Result 111 states and 192 transitions. [2023-12-19 10:46:51,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 10:46:51,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 85 [2023-12-19 10:46:51,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:51,863 INFO L225 Difference]: With dead ends: 111 [2023-12-19 10:46:51,864 INFO L226 Difference]: Without dead ends: 55 [2023-12-19 10:46:51,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 10:46:51,872 INFO L413 NwaCegarLoop]: 83 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, 83 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 [2023-12-19 10:46:51,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:46:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-19 10:46:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-19 10:46:51,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 41 states have internal predecessors, (62), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 10:46:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 86 transitions. [2023-12-19 10:46:51,953 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 86 transitions. Word has length 85 [2023-12-19 10:46:51,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:51,954 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 86 transitions. [2023-12-19 10:46:51,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 10:46:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 86 transitions. [2023-12-19 10:46:51,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-19 10:46:51,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:51,960 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:46:51,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 10:46:51,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:51,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:51,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1026638627, now seen corresponding path program 1 times [2023-12-19 10:46:51,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:51,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520339370] [2023-12-19 10:46:51,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:51,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:46:52,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520339370] [2023-12-19 10:46:52,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520339370] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:52,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:52,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:46:52,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883265433] [2023-12-19 10:46:52,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:52,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:46:52,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:52,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:46:52,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:46:52,253 INFO L87 Difference]: Start difference. First operand 55 states and 86 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:52,284 INFO L93 Difference]: Finished difference Result 110 states and 173 transitions. [2023-12-19 10:46:52,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:46:52,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-19 10:46:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:52,288 INFO L225 Difference]: With dead ends: 110 [2023-12-19 10:46:52,288 INFO L226 Difference]: Without dead ends: 56 [2023-12-19 10:46:52,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:46:52,290 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:52,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:46:52,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-19 10:46:52,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-19 10:46:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.5) internal successors, (63), 42 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 10:46:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 87 transitions. [2023-12-19 10:46:52,303 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 87 transitions. Word has length 85 [2023-12-19 10:46:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:52,307 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 87 transitions. [2023-12-19 10:46:52,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2023-12-19 10:46:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-19 10:46:52,310 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:52,310 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:46:52,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 10:46:52,311 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:52,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1835985253, now seen corresponding path program 1 times [2023-12-19 10:46:52,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:52,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979865875] [2023-12-19 10:46:52,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:52,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:46:52,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:52,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979865875] [2023-12-19 10:46:52,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979865875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:52,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:52,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 10:46:52,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404004010] [2023-12-19 10:46:52,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:52,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 10:46:52,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 10:46:52,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 10:46:52,532 INFO L87 Difference]: Start difference. First operand 56 states and 87 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:52,758 INFO L93 Difference]: Finished difference Result 145 states and 225 transitions. [2023-12-19 10:46:52,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 10:46:52,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-19 10:46:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:52,760 INFO L225 Difference]: With dead ends: 145 [2023-12-19 10:46:52,760 INFO L226 Difference]: Without dead ends: 90 [2023-12-19 10:46:52,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:46:52,762 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 105 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:52,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 278 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:46:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-19 10:46:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 58. [2023-12-19 10:46:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 44 states have internal predecessors, (65), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 10:46:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 89 transitions. [2023-12-19 10:46:52,770 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 89 transitions. Word has length 85 [2023-12-19 10:46:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:52,771 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 89 transitions. [2023-12-19 10:46:52,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 89 transitions. [2023-12-19 10:46:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-19 10:46:52,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:52,787 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:46:52,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 10:46:52,788 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:52,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:52,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1134920675, now seen corresponding path program 1 times [2023-12-19 10:46:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:52,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065846324] [2023-12-19 10:46:52,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:52,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:54,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:54,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:54,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:54,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:54,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:54,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:54,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:54,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:54,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:54,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:54,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:54,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:46:54,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:54,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065846324] [2023-12-19 10:46:54,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065846324] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:54,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:54,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 10:46:54,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716601527] [2023-12-19 10:46:54,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:54,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 10:46:54,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:54,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 10:46:54,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:46:54,288 INFO L87 Difference]: Start difference. First operand 58 states and 89 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:54,910 INFO L93 Difference]: Finished difference Result 180 states and 279 transitions. [2023-12-19 10:46:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 10:46:54,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-19 10:46:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:54,915 INFO L225 Difference]: With dead ends: 180 [2023-12-19 10:46:54,915 INFO L226 Difference]: Without dead ends: 123 [2023-12-19 10:46:54,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-12-19 10:46:54,917 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 120 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:54,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 332 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 10:46:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-19 10:46:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 79. [2023-12-19 10:46:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 65 states have internal predecessors, (98), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 10:46:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2023-12-19 10:46:54,926 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 85 [2023-12-19 10:46:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:54,927 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2023-12-19 10:46:54,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2023-12-19 10:46:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-19 10:46:54,928 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:54,928 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:46:54,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 10:46:54,929 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:54,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:54,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1571698719, now seen corresponding path program 1 times [2023-12-19 10:46:54,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:54,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653166513] [2023-12-19 10:46:54,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:54,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:46:55,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:55,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653166513] [2023-12-19 10:46:55,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653166513] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:55,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:55,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 10:46:55,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491951893] [2023-12-19 10:46:55,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:55,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 10:46:55,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:55,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 10:46:55,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:46:55,390 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:55,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:55,732 INFO L93 Difference]: Finished difference Result 212 states and 329 transitions. [2023-12-19 10:46:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 10:46:55,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-12-19 10:46:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:55,737 INFO L225 Difference]: With dead ends: 212 [2023-12-19 10:46:55,737 INFO L226 Difference]: Without dead ends: 134 [2023-12-19 10:46:55,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-12-19 10:46:55,738 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 144 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:55,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 358 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:46:55,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-19 10:46:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 68. [2023-12-19 10:46:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.5) internal successors, (81), 54 states have internal predecessors, (81), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 10:46:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 105 transitions. [2023-12-19 10:46:55,745 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 105 transitions. Word has length 85 [2023-12-19 10:46:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:55,746 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 105 transitions. [2023-12-19 10:46:55,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:55,746 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 105 transitions. [2023-12-19 10:46:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-19 10:46:55,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:55,747 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:46:55,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 10:46:55,748 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:55,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash 667005088, now seen corresponding path program 1 times [2023-12-19 10:46:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:55,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741199780] [2023-12-19 10:46:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:55,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:46:55,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:55,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741199780] [2023-12-19 10:46:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741199780] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:55,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:55,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:46:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554414284] [2023-12-19 10:46:55,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:55,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:46:55,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:55,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:46:55,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:46:55,812 INFO L87 Difference]: Start difference. First operand 68 states and 105 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:55,854 INFO L93 Difference]: Finished difference Result 179 states and 275 transitions. [2023-12-19 10:46:55,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:46:55,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2023-12-19 10:46:55,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:55,855 INFO L225 Difference]: With dead ends: 179 [2023-12-19 10:46:55,856 INFO L226 Difference]: Without dead ends: 112 [2023-12-19 10:46:55,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:46:55,857 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 56 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:55,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 182 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:46:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-19 10:46:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 79. [2023-12-19 10:46:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 65 states have internal predecessors, (97), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 10:46:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2023-12-19 10:46:55,865 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 86 [2023-12-19 10:46:55,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:55,866 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2023-12-19 10:46:55,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2023-12-19 10:46:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-19 10:46:55,867 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:55,867 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:46:55,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 10:46:55,868 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:55,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash -39689868, now seen corresponding path program 1 times [2023-12-19 10:46:55,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:55,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065709149] [2023-12-19 10:46:55,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:55,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:46:55,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:55,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065709149] [2023-12-19 10:46:55,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065709149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:55,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:55,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:46:55,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701517345] [2023-12-19 10:46:55,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:55,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:46:55,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:55,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:46:55,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:46:55,924 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:55,956 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. [2023-12-19 10:46:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:46:55,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2023-12-19 10:46:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:55,958 INFO L225 Difference]: With dead ends: 188 [2023-12-19 10:46:55,958 INFO L226 Difference]: Without dead ends: 110 [2023-12-19 10:46:55,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:46:55,959 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 71 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:55,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 142 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:46:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-12-19 10:46:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 69. [2023-12-19 10:46:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 10:46:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2023-12-19 10:46:55,966 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 86 [2023-12-19 10:46:55,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:55,966 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2023-12-19 10:46:55,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2023-12-19 10:46:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-19 10:46:55,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:55,967 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:46:55,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 10:46:55,968 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:55,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:55,968 INFO L85 PathProgramCache]: Analyzing trace with hash 259421737, now seen corresponding path program 1 times [2023-12-19 10:46:55,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:55,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446411407] [2023-12-19 10:46:55,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:55,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:56,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:56,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:56,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:56,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:56,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:56,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:56,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:56,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:56,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:56,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:46:56,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:56,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446411407] [2023-12-19 10:46:56,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446411407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:56,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:56,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 10:46:56,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189328848] [2023-12-19 10:46:56,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:56,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 10:46:56,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:56,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 10:46:56,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 10:46:56,094 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:56,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:56,319 INFO L93 Difference]: Finished difference Result 224 states and 330 transitions. [2023-12-19 10:46:56,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 10:46:56,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2023-12-19 10:46:56,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:56,321 INFO L225 Difference]: With dead ends: 224 [2023-12-19 10:46:56,321 INFO L226 Difference]: Without dead ends: 156 [2023-12-19 10:46:56,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-19 10:46:56,323 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 209 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:56,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 329 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:46:56,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-19 10:46:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2023-12-19 10:46:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 114 states have internal predecessors, (157), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 10:46:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions. [2023-12-19 10:46:56,348 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 87 [2023-12-19 10:46:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:56,349 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions. [2023-12-19 10:46:56,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:56,349 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions. [2023-12-19 10:46:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-19 10:46:56,351 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:56,351 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:46:56,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 10:46:56,351 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:56,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:56,352 INFO L85 PathProgramCache]: Analyzing trace with hash 517587175, now seen corresponding path program 1 times [2023-12-19 10:46:56,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:56,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43470092] [2023-12-19 10:46:56,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:56,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:57,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:57,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:57,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:57,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:57,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:57,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:57,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:57,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:57,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:57,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:57,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:46:57,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:57,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43470092] [2023-12-19 10:46:57,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43470092] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:57,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:57,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 10:46:57,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110675536] [2023-12-19 10:46:57,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:57,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 10:46:57,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:57,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 10:46:57,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-19 10:46:57,640 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:58,587 INFO L93 Difference]: Finished difference Result 415 states and 609 transitions. [2023-12-19 10:46:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 10:46:58,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2023-12-19 10:46:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:58,593 INFO L225 Difference]: With dead ends: 415 [2023-12-19 10:46:58,593 INFO L226 Difference]: Without dead ends: 276 [2023-12-19 10:46:58,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-12-19 10:46:58,594 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 279 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:58,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 355 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 10:46:58,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-12-19 10:46:58,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 161. [2023-12-19 10:46:58,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.4153846153846155) internal successors, (184), 132 states have internal predecessors, (184), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 10:46:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 236 transitions. [2023-12-19 10:46:58,608 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 236 transitions. Word has length 87 [2023-12-19 10:46:58,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:58,608 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 236 transitions. [2023-12-19 10:46:58,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:58,609 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2023-12-19 10:46:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-19 10:46:58,610 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:58,610 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:46:58,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 10:46:58,610 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:58,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:58,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1171356567, now seen corresponding path program 1 times [2023-12-19 10:46:58,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:58,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173142794] [2023-12-19 10:46:58,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:58,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:58,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:58,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:58,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:58,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:58,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:58,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:58,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:58,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:58,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:58,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:58,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:46:58,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:58,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173142794] [2023-12-19 10:46:58,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173142794] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:58,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:58,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:46:58,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882109729] [2023-12-19 10:46:58,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:58,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:46:58,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:58,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:46:58,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:46:58,732 INFO L87 Difference]: Start difference. First operand 161 states and 236 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:58,799 INFO L93 Difference]: Finished difference Result 455 states and 667 transitions. [2023-12-19 10:46:58,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:46:58,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2023-12-19 10:46:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:58,803 INFO L225 Difference]: With dead ends: 455 [2023-12-19 10:46:58,803 INFO L226 Difference]: Without dead ends: 298 [2023-12-19 10:46:58,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:46:58,804 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 57 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:58,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 161 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:46:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-19 10:46:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 234. [2023-12-19 10:46:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 189 states have (on average 1.3968253968253967) internal successors, (264), 191 states have internal predecessors, (264), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 10:46:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 340 transitions. [2023-12-19 10:46:58,843 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 340 transitions. Word has length 87 [2023-12-19 10:46:58,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:58,845 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 340 transitions. [2023-12-19 10:46:58,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:58,846 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 340 transitions. [2023-12-19 10:46:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-19 10:46:58,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:58,848 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:46:58,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 10:46:58,849 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:58,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:58,849 INFO L85 PathProgramCache]: Analyzing trace with hash 835858693, now seen corresponding path program 1 times [2023-12-19 10:46:58,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:58,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742349351] [2023-12-19 10:46:58,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:58,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:46:59,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:59,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742349351] [2023-12-19 10:46:59,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742349351] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:59,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:59,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 10:46:59,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250024050] [2023-12-19 10:46:59,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:59,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 10:46:59,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:59,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 10:46:59,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 10:46:59,325 INFO L87 Difference]: Start difference. First operand 234 states and 340 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:59,688 INFO L93 Difference]: Finished difference Result 524 states and 748 transitions. [2023-12-19 10:46:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 10:46:59,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-19 10:46:59,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:59,691 INFO L225 Difference]: With dead ends: 524 [2023-12-19 10:46:59,691 INFO L226 Difference]: Without dead ends: 294 [2023-12-19 10:46:59,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-19 10:46:59,692 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 149 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:59,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 244 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 10:46:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-12-19 10:46:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 242. [2023-12-19 10:46:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 200 states have (on average 1.28) internal successors, (256), 201 states have internal predecessors, (256), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 10:46:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 328 transitions. [2023-12-19 10:46:59,712 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 328 transitions. Word has length 88 [2023-12-19 10:46:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:59,712 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 328 transitions. [2023-12-19 10:46:59,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 328 transitions. [2023-12-19 10:46:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-19 10:46:59,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:59,714 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:46:59,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 10:46:59,714 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:59,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:59,715 INFO L85 PathProgramCache]: Analyzing trace with hash 498286641, now seen corresponding path program 1 times [2023-12-19 10:46:59,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:59,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489428211] [2023-12-19 10:46:59,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:59,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:46:59,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:59,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489428211] [2023-12-19 10:46:59,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489428211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:59,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:59,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:46:59,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593642979] [2023-12-19 10:46:59,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:59,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:46:59,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:59,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:46:59,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:46:59,779 INFO L87 Difference]: Start difference. First operand 242 states and 328 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:59,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:59,836 INFO L93 Difference]: Finished difference Result 457 states and 617 transitions. [2023-12-19 10:46:59,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:46:59,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-19 10:46:59,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:59,839 INFO L225 Difference]: With dead ends: 457 [2023-12-19 10:46:59,839 INFO L226 Difference]: Without dead ends: 337 [2023-12-19 10:46:59,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:46:59,840 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 64 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:59,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 178 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:46:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2023-12-19 10:46:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2023-12-19 10:46:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 279 states have (on average 1.2616487455197132) internal successors, (352), 280 states have internal predecessors, (352), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 10:46:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 448 transitions. [2023-12-19 10:46:59,864 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 448 transitions. Word has length 88 [2023-12-19 10:46:59,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:46:59,865 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 448 transitions. [2023-12-19 10:46:59,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 448 transitions. [2023-12-19 10:46:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-19 10:46:59,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:46:59,867 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:46:59,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 10:46:59,867 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:46:59,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:46:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1689607901, now seen corresponding path program 1 times [2023-12-19 10:46:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:46:59,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471959313] [2023-12-19 10:46:59,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:46:59,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:46:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:46:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:46:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:46:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:46:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:46:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:46:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:46:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:46:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:46:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:46:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:46:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:46:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:46:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:46:59,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:46:59,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471959313] [2023-12-19 10:46:59,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471959313] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:46:59,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:46:59,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:46:59,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415270775] [2023-12-19 10:46:59,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:46:59,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:46:59,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:46:59,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:46:59,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:46:59,924 INFO L87 Difference]: Start difference. First operand 335 states and 448 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:46:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:46:59,989 INFO L93 Difference]: Finished difference Result 616 states and 816 transitions. [2023-12-19 10:46:59,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:46:59,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-19 10:46:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:46:59,992 INFO L225 Difference]: With dead ends: 616 [2023-12-19 10:46:59,992 INFO L226 Difference]: Without dead ends: 403 [2023-12-19 10:46:59,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:46:59,994 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 67 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:46:59,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 149 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:46:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-12-19 10:47:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2023-12-19 10:47:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 331 states have (on average 1.2326283987915407) internal successors, (408), 332 states have internal predecessors, (408), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-19 10:47:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 528 transitions. [2023-12-19 10:47:00,028 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 528 transitions. Word has length 88 [2023-12-19 10:47:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:00,028 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 528 transitions. [2023-12-19 10:47:00,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 528 transitions. [2023-12-19 10:47:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-19 10:47:00,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:00,029 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:00,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 10:47:00,030 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:00,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash 414863964, now seen corresponding path program 1 times [2023-12-19 10:47:00,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:00,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940609553] [2023-12-19 10:47:00,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:00,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,163 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:00,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:00,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940609553] [2023-12-19 10:47:00,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940609553] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:00,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:00,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 10:47:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840743091] [2023-12-19 10:47:00,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:00,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 10:47:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 10:47:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 10:47:00,165 INFO L87 Difference]: Start difference. First operand 401 states and 528 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:00,469 INFO L93 Difference]: Finished difference Result 944 states and 1245 transitions. [2023-12-19 10:47:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 10:47:00,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-19 10:47:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:00,472 INFO L225 Difference]: With dead ends: 944 [2023-12-19 10:47:00,473 INFO L226 Difference]: Without dead ends: 665 [2023-12-19 10:47:00,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-19 10:47:00,474 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 150 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:00,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 428 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:47:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-19 10:47:00,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 409. [2023-12-19 10:47:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 339 states have (on average 1.2359882005899705) internal successors, (419), 340 states have internal predecessors, (419), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-19 10:47:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 539 transitions. [2023-12-19 10:47:00,527 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 539 transitions. Word has length 88 [2023-12-19 10:47:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:00,527 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 539 transitions. [2023-12-19 10:47:00,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 539 transitions. [2023-12-19 10:47:00,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-19 10:47:00,528 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:00,529 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:00,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 10:47:00,529 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:00,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:00,529 INFO L85 PathProgramCache]: Analyzing trace with hash 673029402, now seen corresponding path program 1 times [2023-12-19 10:47:00,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:00,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630073631] [2023-12-19 10:47:00,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:00,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:00,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:00,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630073631] [2023-12-19 10:47:00,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630073631] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:00,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:00,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 10:47:00,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129700609] [2023-12-19 10:47:00,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:00,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 10:47:00,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:00,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 10:47:00,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:47:00,614 INFO L87 Difference]: Start difference. First operand 409 states and 539 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:00,668 INFO L93 Difference]: Finished difference Result 688 states and 902 transitions. [2023-12-19 10:47:00,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 10:47:00,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-19 10:47:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:00,672 INFO L225 Difference]: With dead ends: 688 [2023-12-19 10:47:00,672 INFO L226 Difference]: Without dead ends: 401 [2023-12-19 10:47:00,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 10:47:00,674 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:00,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 110 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 10:47:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-12-19 10:47:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 302. [2023-12-19 10:47:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 246 states have (on average 1.2113821138211383) internal successors, (298), 247 states have internal predecessors, (298), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 10:47:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 394 transitions. [2023-12-19 10:47:00,704 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 394 transitions. Word has length 88 [2023-12-19 10:47:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:00,704 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 394 transitions. [2023-12-19 10:47:00,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 394 transitions. [2023-12-19 10:47:00,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-19 10:47:00,705 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:00,706 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:00,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 10:47:00,706 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:00,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:00,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1173483938, now seen corresponding path program 1 times [2023-12-19 10:47:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513462545] [2023-12-19 10:47:00,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:00,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:00,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:00,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513462545] [2023-12-19 10:47:00,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513462545] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:00,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:00,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 10:47:00,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087833724] [2023-12-19 10:47:00,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:00,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 10:47:00,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:00,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 10:47:00,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 10:47:00,790 INFO L87 Difference]: Start difference. First operand 302 states and 394 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:00,935 INFO L93 Difference]: Finished difference Result 601 states and 783 transitions. [2023-12-19 10:47:00,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 10:47:00,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-19 10:47:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:00,937 INFO L225 Difference]: With dead ends: 601 [2023-12-19 10:47:00,938 INFO L226 Difference]: Without dead ends: 322 [2023-12-19 10:47:00,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-19 10:47:00,939 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 128 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:00,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 302 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 10:47:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-12-19 10:47:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 306. [2023-12-19 10:47:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 250 states have (on average 1.204) internal successors, (301), 251 states have internal predecessors, (301), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 10:47:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 397 transitions. [2023-12-19 10:47:00,966 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 397 transitions. Word has length 88 [2023-12-19 10:47:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:00,966 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 397 transitions. [2023-12-19 10:47:00,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 397 transitions. [2023-12-19 10:47:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-19 10:47:00,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:00,968 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:00,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 10:47:00,968 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:00,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash -915318500, now seen corresponding path program 1 times [2023-12-19 10:47:00,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:00,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640945417] [2023-12-19 10:47:00,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:01,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:01,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640945417] [2023-12-19 10:47:01,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640945417] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:01,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:01,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 10:47:01,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699442923] [2023-12-19 10:47:01,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:01,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 10:47:01,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:01,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 10:47:01,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 10:47:01,074 INFO L87 Difference]: Start difference. First operand 306 states and 397 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:01,372 INFO L93 Difference]: Finished difference Result 717 states and 930 transitions. [2023-12-19 10:47:01,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 10:47:01,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-12-19 10:47:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:01,375 INFO L225 Difference]: With dead ends: 717 [2023-12-19 10:47:01,375 INFO L226 Difference]: Without dead ends: 433 [2023-12-19 10:47:01,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:47:01,376 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 201 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:01,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 242 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:47:01,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2023-12-19 10:47:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 290. [2023-12-19 10:47:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 234 states have (on average 1.188034188034188) internal successors, (278), 235 states have internal predecessors, (278), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 10:47:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 374 transitions. [2023-12-19 10:47:01,444 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 374 transitions. Word has length 88 [2023-12-19 10:47:01,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:01,444 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 374 transitions. [2023-12-19 10:47:01,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 374 transitions. [2023-12-19 10:47:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 10:47:01,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:01,445 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:01,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 10:47:01,446 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:01,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1884384765, now seen corresponding path program 1 times [2023-12-19 10:47:01,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:01,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355142887] [2023-12-19 10:47:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:01,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355142887] [2023-12-19 10:47:01,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355142887] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:01,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:01,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 10:47:01,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100258122] [2023-12-19 10:47:01,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:01,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 10:47:01,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:01,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 10:47:01,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-19 10:47:01,573 INFO L87 Difference]: Start difference. First operand 290 states and 374 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:01,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:01,977 INFO L93 Difference]: Finished difference Result 641 states and 824 transitions. [2023-12-19 10:47:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 10:47:01,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2023-12-19 10:47:01,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:01,980 INFO L225 Difference]: With dead ends: 641 [2023-12-19 10:47:01,980 INFO L226 Difference]: Without dead ends: 374 [2023-12-19 10:47:01,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:47:01,982 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 195 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:01,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 354 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 10:47:01,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-12-19 10:47:02,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 328. [2023-12-19 10:47:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 258 states have (on average 1.1744186046511629) internal successors, (303), 259 states have internal predecessors, (303), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-19 10:47:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 423 transitions. [2023-12-19 10:47:02,025 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 423 transitions. Word has length 89 [2023-12-19 10:47:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:02,026 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 423 transitions. [2023-12-19 10:47:02,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 423 transitions. [2023-12-19 10:47:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 10:47:02,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:02,027 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:02,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 10:47:02,027 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:02,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:02,028 INFO L85 PathProgramCache]: Analyzing trace with hash -634544272, now seen corresponding path program 1 times [2023-12-19 10:47:02,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:02,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461914329] [2023-12-19 10:47:02,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:02,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:02,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:02,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:02,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:02,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:02,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:02,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:02,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:02,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:02,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:02,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:02,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:02,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:02,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461914329] [2023-12-19 10:47:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461914329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:02,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:02,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 10:47:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579376681] [2023-12-19 10:47:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:02,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 10:47:02,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:02,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 10:47:02,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-19 10:47:02,457 INFO L87 Difference]: Start difference. First operand 328 states and 423 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:02,987 INFO L93 Difference]: Finished difference Result 762 states and 972 transitions. [2023-12-19 10:47:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 10:47:02,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2023-12-19 10:47:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:02,990 INFO L225 Difference]: With dead ends: 762 [2023-12-19 10:47:02,990 INFO L226 Difference]: Without dead ends: 457 [2023-12-19 10:47:02,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2023-12-19 10:47:02,992 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 161 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:02,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 345 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 10:47:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-12-19 10:47:03,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 447. [2023-12-19 10:47:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 325 states have (on average 1.1292307692307693) internal successors, (367), 330 states have internal predecessors, (367), 100 states have call successors, (100), 21 states have call predecessors, (100), 21 states have return successors, (100), 95 states have call predecessors, (100), 100 states have call successors, (100) [2023-12-19 10:47:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 567 transitions. [2023-12-19 10:47:03,070 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 567 transitions. Word has length 89 [2023-12-19 10:47:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:03,070 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 567 transitions. [2023-12-19 10:47:03,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 567 transitions. [2023-12-19 10:47:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-19 10:47:03,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:03,072 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:03,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 10:47:03,072 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:03,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:03,072 INFO L85 PathProgramCache]: Analyzing trace with hash -958965774, now seen corresponding path program 1 times [2023-12-19 10:47:03,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:03,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845982207] [2023-12-19 10:47:03,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:03,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:03,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:03,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845982207] [2023-12-19 10:47:03,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845982207] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:03,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:03,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 10:47:03,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131697448] [2023-12-19 10:47:03,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:03,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 10:47:03,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:03,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 10:47:03,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 10:47:03,179 INFO L87 Difference]: Start difference. First operand 447 states and 567 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:03,474 INFO L93 Difference]: Finished difference Result 1082 states and 1367 transitions. [2023-12-19 10:47:03,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 10:47:03,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2023-12-19 10:47:03,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:03,478 INFO L225 Difference]: With dead ends: 1082 [2023-12-19 10:47:03,478 INFO L226 Difference]: Without dead ends: 658 [2023-12-19 10:47:03,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 10:47:03,480 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 153 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:03,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 142 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:47:03,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2023-12-19 10:47:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 436. [2023-12-19 10:47:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 327 states have (on average 1.1376146788990826) internal successors, (372), 331 states have internal predecessors, (372), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-19 10:47:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 548 transitions. [2023-12-19 10:47:03,590 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 548 transitions. Word has length 90 [2023-12-19 10:47:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:03,591 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 548 transitions. [2023-12-19 10:47:03,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 548 transitions. [2023-12-19 10:47:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-19 10:47:03,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:03,593 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:03,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 10:47:03,594 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:03,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:03,595 INFO L85 PathProgramCache]: Analyzing trace with hash -911658576, now seen corresponding path program 1 times [2023-12-19 10:47:03,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:03,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280928275] [2023-12-19 10:47:03,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:03,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280928275] [2023-12-19 10:47:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280928275] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:03,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:03,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 10:47:03,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695048871] [2023-12-19 10:47:03,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:03,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 10:47:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:03,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 10:47:03,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 10:47:03,705 INFO L87 Difference]: Start difference. First operand 436 states and 548 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:03,881 INFO L93 Difference]: Finished difference Result 905 states and 1142 transitions. [2023-12-19 10:47:03,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 10:47:03,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2023-12-19 10:47:03,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:03,885 INFO L225 Difference]: With dead ends: 905 [2023-12-19 10:47:03,885 INFO L226 Difference]: Without dead ends: 470 [2023-12-19 10:47:03,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-19 10:47:03,887 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 126 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:03,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 235 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 10:47:03,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-12-19 10:47:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2023-12-19 10:47:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 325 states have (on average 1.1323076923076922) internal successors, (368), 329 states have internal predecessors, (368), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-19 10:47:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 544 transitions. [2023-12-19 10:47:03,962 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 544 transitions. Word has length 90 [2023-12-19 10:47:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:03,963 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 544 transitions. [2023-12-19 10:47:03,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 544 transitions. [2023-12-19 10:47:03,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-19 10:47:03,964 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:03,965 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:03,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 10:47:03,965 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:03,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:03,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1922775826, now seen corresponding path program 1 times [2023-12-19 10:47:03,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:03,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332626014] [2023-12-19 10:47:03,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:03,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:04,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:04,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:04,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:04,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:04,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:04,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:04,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:04,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:04,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:04,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:04,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:04,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:04,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:04,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332626014] [2023-12-19 10:47:04,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332626014] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:04,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:04,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 10:47:04,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58829521] [2023-12-19 10:47:04,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:04,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 10:47:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:04,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 10:47:04,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 10:47:04,072 INFO L87 Difference]: Start difference. First operand 434 states and 544 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:04,303 INFO L93 Difference]: Finished difference Result 896 states and 1127 transitions. [2023-12-19 10:47:04,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 10:47:04,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2023-12-19 10:47:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:04,306 INFO L225 Difference]: With dead ends: 896 [2023-12-19 10:47:04,306 INFO L226 Difference]: Without dead ends: 463 [2023-12-19 10:47:04,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:47:04,310 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 70 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:04,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 235 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 10:47:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-12-19 10:47:04,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 432. [2023-12-19 10:47:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 323 states have (on average 1.1176470588235294) internal successors, (361), 327 states have internal predecessors, (361), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-19 10:47:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 537 transitions. [2023-12-19 10:47:04,387 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 537 transitions. Word has length 90 [2023-12-19 10:47:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:04,387 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 537 transitions. [2023-12-19 10:47:04,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 537 transitions. [2023-12-19 10:47:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-19 10:47:04,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:04,388 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:04,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-19 10:47:04,388 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:04,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:04,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1979164460, now seen corresponding path program 1 times [2023-12-19 10:47:04,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:04,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768215733] [2023-12-19 10:47:04,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:04,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,133 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:05,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:05,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768215733] [2023-12-19 10:47:05,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768215733] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:05,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:05,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 10:47:05,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51815469] [2023-12-19 10:47:05,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:05,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 10:47:05,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:05,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 10:47:05,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-19 10:47:05,136 INFO L87 Difference]: Start difference. First operand 432 states and 537 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:05,383 INFO L93 Difference]: Finished difference Result 862 states and 1071 transitions. [2023-12-19 10:47:05,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 10:47:05,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 90 [2023-12-19 10:47:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:05,386 INFO L225 Difference]: With dead ends: 862 [2023-12-19 10:47:05,386 INFO L226 Difference]: Without dead ends: 431 [2023-12-19 10:47:05,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-12-19 10:47:05,388 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 57 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:05,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 178 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 10:47:05,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2023-12-19 10:47:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 419. [2023-12-19 10:47:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 310 states have (on average 1.103225806451613) internal successors, (342), 314 states have internal predecessors, (342), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-19 10:47:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 518 transitions. [2023-12-19 10:47:05,466 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 518 transitions. Word has length 90 [2023-12-19 10:47:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:05,466 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 518 transitions. [2023-12-19 10:47:05,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:05,467 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 518 transitions. [2023-12-19 10:47:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-19 10:47:05,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:05,468 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:05,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-19 10:47:05,468 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:05,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash -538538961, now seen corresponding path program 1 times [2023-12-19 10:47:05,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:05,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926598522] [2023-12-19 10:47:05,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:05,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:05,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:05,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926598522] [2023-12-19 10:47:05,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926598522] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:05,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:05,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 10:47:05,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855157706] [2023-12-19 10:47:05,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:05,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 10:47:05,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:05,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 10:47:05,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 10:47:05,630 INFO L87 Difference]: Start difference. First operand 419 states and 518 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:06,063 INFO L93 Difference]: Finished difference Result 908 states and 1129 transitions. [2023-12-19 10:47:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 10:47:06,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2023-12-19 10:47:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:06,066 INFO L225 Difference]: With dead ends: 908 [2023-12-19 10:47:06,066 INFO L226 Difference]: Without dead ends: 490 [2023-12-19 10:47:06,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2023-12-19 10:47:06,068 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 223 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:06,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 307 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 10:47:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2023-12-19 10:47:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 419. [2023-12-19 10:47:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 310 states have (on average 1.1) internal successors, (341), 314 states have internal predecessors, (341), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-19 10:47:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 517 transitions. [2023-12-19 10:47:06,167 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 517 transitions. Word has length 91 [2023-12-19 10:47:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:06,168 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 517 transitions. [2023-12-19 10:47:06,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 517 transitions. [2023-12-19 10:47:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-19 10:47:06,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:06,169 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:06,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-19 10:47:06,169 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:06,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:06,170 INFO L85 PathProgramCache]: Analyzing trace with hash -536691919, now seen corresponding path program 1 times [2023-12-19 10:47:06,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:06,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625050028] [2023-12-19 10:47:06,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:06,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:06,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:06,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625050028] [2023-12-19 10:47:06,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625050028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:06,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:06,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 10:47:06,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169315312] [2023-12-19 10:47:06,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:06,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 10:47:06,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:06,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 10:47:06,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 10:47:06,262 INFO L87 Difference]: Start difference. First operand 419 states and 517 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:06,451 INFO L93 Difference]: Finished difference Result 896 states and 1113 transitions. [2023-12-19 10:47:06,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 10:47:06,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2023-12-19 10:47:06,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:06,454 INFO L225 Difference]: With dead ends: 896 [2023-12-19 10:47:06,454 INFO L226 Difference]: Without dead ends: 478 [2023-12-19 10:47:06,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-19 10:47:06,455 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 119 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:06,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 326 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 10:47:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-12-19 10:47:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 411. [2023-12-19 10:47:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 302 states have (on average 1.096026490066225) internal successors, (331), 306 states have internal predecessors, (331), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-19 10:47:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 507 transitions. [2023-12-19 10:47:06,530 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 507 transitions. Word has length 91 [2023-12-19 10:47:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:06,530 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 507 transitions. [2023-12-19 10:47:06,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 507 transitions. [2023-12-19 10:47:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-19 10:47:06,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:06,531 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:06,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-19 10:47:06,532 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:06,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash 225298420, now seen corresponding path program 1 times [2023-12-19 10:47:06,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:06,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769149736] [2023-12-19 10:47:06,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:06,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:06,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:06,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769149736] [2023-12-19 10:47:06,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769149736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:06,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:06,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 10:47:06,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749085822] [2023-12-19 10:47:06,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:06,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 10:47:06,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:06,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 10:47:06,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 10:47:06,677 INFO L87 Difference]: Start difference. First operand 411 states and 507 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:07,156 INFO L93 Difference]: Finished difference Result 1017 states and 1253 transitions. [2023-12-19 10:47:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 10:47:07,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2023-12-19 10:47:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:07,159 INFO L225 Difference]: With dead ends: 1017 [2023-12-19 10:47:07,159 INFO L226 Difference]: Without dead ends: 607 [2023-12-19 10:47:07,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 10:47:07,161 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 198 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:07,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 291 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 10:47:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2023-12-19 10:47:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 416. [2023-12-19 10:47:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 307 states have (on average 1.0977198697068404) internal successors, (337), 311 states have internal predecessors, (337), 88 states have call successors, (88), 20 states have call predecessors, (88), 20 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-19 10:47:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 513 transitions. [2023-12-19 10:47:07,246 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 513 transitions. Word has length 94 [2023-12-19 10:47:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:07,247 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 513 transitions. [2023-12-19 10:47:07,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 513 transitions. [2023-12-19 10:47:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-19 10:47:07,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 10:47:07,248 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:07,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-19 10:47:07,248 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 10:47:07,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 10:47:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash 227145462, now seen corresponding path program 1 times [2023-12-19 10:47:07,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 10:47:07,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218957353] [2023-12-19 10:47:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 10:47:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 10:47:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:07,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 10:47:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:07,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 10:47:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:07,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 10:47:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:07,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 10:47:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:07,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 10:47:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:07,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 10:47:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:07,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 10:47:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:07,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 10:47:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:07,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 10:47:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:07,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 10:47:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 10:47:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:07,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 10:47:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 10:47:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 10:47:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 10:47:07,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218957353] [2023-12-19 10:47:07,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218957353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 10:47:07,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 10:47:07,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 10:47:07,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145637684] [2023-12-19 10:47:07,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 10:47:07,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 10:47:07,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 10:47:07,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 10:47:07,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 10:47:07,774 INFO L87 Difference]: Start difference. First operand 416 states and 513 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:08,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 10:47:08,200 INFO L93 Difference]: Finished difference Result 445 states and 553 transitions. [2023-12-19 10:47:08,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 10:47:08,200 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2023-12-19 10:47:08,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 10:47:08,201 INFO L225 Difference]: With dead ends: 445 [2023-12-19 10:47:08,201 INFO L226 Difference]: Without dead ends: 0 [2023-12-19 10:47:08,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-12-19 10:47:08,203 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 114 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 10:47:08,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 244 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 10:47:08,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-19 10:47:08,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-19 10:47:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-19 10:47:08,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-19 10:47:08,204 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2023-12-19 10:47:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 10:47:08,204 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-19 10:47:08,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 10:47:08,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-19 10:47:08,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-19 10:47:08,207 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 10:47:08,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-19 10:47:08,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-19 10:47:42,489 WARN L293 SmtUtils]: Spent 15.97s on a formula simplification. DAG size of input: 238 DAG size of output: 304 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-19 10:47:51,113 INFO L895 garLoopResultBuilder]: At program point L93-2(lines 93 99) the Hoare annotation is: (let ((.cse3 (div ~var_1_7~0 256))) (let ((.cse6 (+ ~var_1_8~0 1)) (.cse0 (* .cse3 256))) (let ((.cse9 (+ ~var_1_8~0 .cse0 1)) (.cse10 (+ (* 256 (div .cse6 256)) ~var_1_7~0)) (.cse8 (+ ~var_1_5~0 1))) (let ((.cse2 (= (+ .cse0 ~var_1_16~0) ~var_1_7~0)) (.cse1 (or (= .cse9 .cse10) (< ~last_1_var_1_13~0 .cse8))) (.cse5 (* (div ~var_1_8~0 256) 256))) (or (and (not (= ~var_1_7~0 .cse0)) .cse1 (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) .cse2) (and (= (+ (* ~var_1_7~0 65534) 128) (+ (* .cse3 16776704) ~var_1_1~0 (* 65536 (div (+ 64 (* (- 8388352) .cse3) (* ~var_1_7~0 32767)) 32768)))) .cse1 (let ((.cse4 (= (* 256 (div ~var_1_14~0 256)) ~var_1_14~0))) (or (and (not .cse4) (= ~var_1_16~0 ~var_1_13~0)) (and (= ~var_1_8~0 (+ .cse5 ~var_1_13~0)) .cse4))) (= ~var_1_15~0 ~var_1_11~0) .cse2) (let ((.cse7 (< .cse9 .cse10))) (and (<= .cse6 (+ .cse5 ~var_1_7~0)) (or .cse7 (<= .cse8 ~last_1_var_1_13~0)) .cse1 (or (< ~var_1_8~0 (+ .cse5 ~var_1_16~0 ~var_1_13~0 1)) .cse7) (<= 200 ~var_1_7~0) (<= .cse3 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))))))) [2023-12-19 10:47:51,114 INFO L899 garLoopResultBuilder]: For program point L93-3(lines 93 99) no Hoare annotation was computed. [2023-12-19 10:47:51,114 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-19 10:47:51,114 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-19 10:47:51,114 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-19 10:47:51,114 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-19 10:47:51,114 INFO L895 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-19 10:47:51,114 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-19 10:47:51,115 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-19 10:47:51,115 INFO L899 garLoopResultBuilder]: For program point L53-2(line 53) no Hoare annotation was computed. [2023-12-19 10:47:51,115 INFO L899 garLoopResultBuilder]: For program point L53-4(line 53) no Hoare annotation was computed. [2023-12-19 10:47:51,115 INFO L899 garLoopResultBuilder]: For program point L53-6(line 53) no Hoare annotation was computed. [2023-12-19 10:47:51,115 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-12-19 10:47:51,115 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 62) no Hoare annotation was computed. [2023-12-19 10:47:51,115 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-12-19 10:47:51,115 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2023-12-19 10:47:51,115 INFO L899 garLoopResultBuilder]: For program point L87-2(line 87) no Hoare annotation was computed. [2023-12-19 10:47:51,115 INFO L899 garLoopResultBuilder]: For program point L54-2(lines 37 62) no Hoare annotation was computed. [2023-12-19 10:47:51,115 INFO L899 garLoopResultBuilder]: For program point L87-4(line 87) no Hoare annotation was computed. [2023-12-19 10:47:51,115 INFO L899 garLoopResultBuilder]: For program point L87-6(line 87) no Hoare annotation was computed. [2023-12-19 10:47:51,116 INFO L899 garLoopResultBuilder]: For program point L87-7(line 87) no Hoare annotation was computed. [2023-12-19 10:47:51,116 INFO L899 garLoopResultBuilder]: For program point L87-8(line 87) no Hoare annotation was computed. [2023-12-19 10:47:51,116 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-12-19 10:47:51,116 INFO L899 garLoopResultBuilder]: For program point L87-10(line 87) no Hoare annotation was computed. [2023-12-19 10:47:51,116 INFO L899 garLoopResultBuilder]: For program point L46-2(lines 43 51) no Hoare annotation was computed. [2023-12-19 10:47:51,116 INFO L899 garLoopResultBuilder]: For program point L87-12(line 87) no Hoare annotation was computed. [2023-12-19 10:47:51,116 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-19 10:47:51,116 INFO L899 garLoopResultBuilder]: For program point L87-14(line 87) no Hoare annotation was computed. [2023-12-19 10:47:51,116 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-19 10:47:51,116 INFO L899 garLoopResultBuilder]: For program point L87-16(line 87) no Hoare annotation was computed. [2023-12-19 10:47:51,117 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-19 10:47:51,117 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-12-19 10:47:51,117 INFO L899 garLoopResultBuilder]: For program point L87-18(line 87) no Hoare annotation was computed. [2023-12-19 10:47:51,117 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2023-12-19 10:47:51,117 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-19 10:47:51,117 INFO L895 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-19 10:47:51,117 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-12-19 10:47:51,117 INFO L899 garLoopResultBuilder]: For program point L81(lines 63 82) no Hoare annotation was computed. [2023-12-19 10:47:51,118 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (let ((.cse3 (div ~var_1_7~0 256))) (let ((.cse4 (* .cse3 256))) (let ((.cse1 (* (div ~var_1_8~0 256) 256)) (.cse2 (= (+ .cse4 ~var_1_16~0) ~var_1_7~0))) (or (and (let ((.cse0 (= (* 256 (div ~var_1_14~0 256)) ~var_1_14~0))) (or (and (not .cse0) (= ~var_1_16~0 ~var_1_13~0)) (and (= ~var_1_8~0 (+ .cse1 ~var_1_13~0)) .cse0))) (= ~var_1_15~0 ~var_1_11~0) .cse2) (and (<= (+ ~var_1_8~0 1) (+ .cse1 ~var_1_7~0)) (<= 200 ~var_1_7~0) (<= .cse3 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)) (and (not (= ~var_1_7~0 .cse4)) (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) .cse2))))) [2023-12-19 10:47:51,118 INFO L895 garLoopResultBuilder]: At program point L65-1(line 65) the Hoare annotation is: (let ((.cse3 (div ~var_1_7~0 256))) (let ((.cse4 (* .cse3 256))) (let ((.cse1 (* (div ~var_1_8~0 256) 256)) (.cse2 (= (+ .cse4 ~var_1_16~0) ~var_1_7~0))) (or (and (let ((.cse0 (= (* 256 (div ~var_1_14~0 256)) ~var_1_14~0))) (or (and (not .cse0) (= ~var_1_16~0 ~var_1_13~0)) (and (= ~var_1_8~0 (+ .cse1 ~var_1_13~0)) .cse0))) (= ~var_1_15~0 ~var_1_11~0) .cse2) (and (<= (+ ~var_1_8~0 1) (+ .cse1 ~var_1_7~0)) (<= 200 ~var_1_7~0) (<= .cse3 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)) (and (not (= ~var_1_7~0 .cse4)) (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) .cse2))))) [2023-12-19 10:47:51,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-19 10:47:51,118 INFO L895 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-19 10:47:51,118 INFO L895 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-19 10:47:51,118 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-12-19 10:47:51,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-19 10:47:51,119 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-19 10:47:51,119 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-12-19 10:47:51,119 INFO L899 garLoopResultBuilder]: For program point L59-3(line 59) no Hoare annotation was computed. [2023-12-19 10:47:51,119 INFO L899 garLoopResultBuilder]: For program point L59-5(line 59) no Hoare annotation was computed. [2023-12-19 10:47:51,119 INFO L899 garLoopResultBuilder]: For program point L59-7(lines 59 61) no Hoare annotation was computed. [2023-12-19 10:47:51,119 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2023-12-19 10:47:51,119 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-19 10:47:51,119 INFO L895 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: (let ((.cse0 (div ~var_1_7~0 256))) (or (and (<= 0 (+ ~var_1_16~0 ~var_1_13~0)) (= (+ (* .cse0 256) ~var_1_16~0) ~var_1_7~0)) (and (<= 200 ~var_1_7~0) (<= .cse0 0) (<= (+ ~var_1_13~0 1) ~var_1_7~0)))) [2023-12-19 10:47:51,119 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-19 10:47:51,120 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-19 10:47:51,120 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-19 10:47:51,120 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-19 10:47:51,123 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 10:47:51,125 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 10:47:51,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 10:47:51 BoogieIcfgContainer [2023-12-19 10:47:51,147 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 10:47:51,147 INFO L158 Benchmark]: Toolchain (without parser) took 60869.51ms. Allocated memory was 262.1MB in the beginning and 697.3MB in the end (delta: 435.2MB). Free memory was 225.4MB in the beginning and 559.6MB in the end (delta: -334.2MB). Peak memory consumption was 422.9MB. Max. memory is 8.0GB. [2023-12-19 10:47:51,147 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 210.8MB. Free memory is still 157.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 10:47:51,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.90ms. Allocated memory is still 262.1MB. Free memory was 224.9MB in the beginning and 212.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 10:47:51,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.72ms. Allocated memory is still 262.1MB. Free memory was 212.3MB in the beginning and 209.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 10:47:51,148 INFO L158 Benchmark]: Boogie Preprocessor took 62.62ms. Allocated memory is still 262.1MB. Free memory was 209.1MB in the beginning and 206.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 10:47:51,148 INFO L158 Benchmark]: RCFGBuilder took 520.56ms. Allocated memory is still 262.1MB. Free memory was 206.0MB in the beginning and 184.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-19 10:47:51,148 INFO L158 Benchmark]: TraceAbstraction took 59898.84ms. Allocated memory was 262.1MB in the beginning and 697.3MB in the end (delta: 435.2MB). Free memory was 183.5MB in the beginning and 559.6MB in the end (delta: -376.1MB). Peak memory consumption was 381.0MB. Max. memory is 8.0GB. [2023-12-19 10:47:51,149 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.68ms. Allocated memory is still 210.8MB. Free memory is still 157.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 326.90ms. Allocated memory is still 262.1MB. Free memory was 224.9MB in the beginning and 212.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.72ms. Allocated memory is still 262.1MB. Free memory was 212.3MB in the beginning and 209.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.62ms. Allocated memory is still 262.1MB. Free memory was 209.1MB in the beginning and 206.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 520.56ms. Allocated memory is still 262.1MB. Free memory was 206.0MB in the beginning and 184.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 59898.84ms. Allocated memory was 262.1MB in the beginning and 697.3MB in the end (delta: 435.2MB). Free memory was 183.5MB in the beginning and 559.6MB in the end (delta: -376.1MB). Peak memory consumption was 381.0MB. Max. memory is 8.0GB. * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.8s, OverallIterations: 27, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 42.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3235 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3235 mSDsluCounter, 6688 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4104 mSDsCounter, 414 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4312 IncrementalHoareTripleChecker+Invalid, 4726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 414 mSolverCounterUnsat, 2584 mSDtfsCounter, 4312 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 896 GetRequests, 743 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447occurred in iteration=19, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 1664 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 1173 PreInvPairs, 1282 NumberOfFragments, 730 HoareAnnotationTreeSize, 1173 FormulaSimplifications, 2650636 FormulaSimplificationTreeSizeReduction, 38.1s HoareSimplificationTime, 14 FormulaSimplificationsInter, 272468 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 2382 NumberOfCodeBlocks, 2382 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2355 ConstructedInterpolants, 0 QuantifiedInterpolants, 11819 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 7128/7128 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((!((var_1_7 == ((var_1_7 / 256) * 256))) && ((((var_1_8 + ((var_1_7 / 256) * 256)) + 1) == ((256 * ((var_1_8 + 1) / 256)) + var_1_7)) || (last_1_var_1_13 < (var_1_5 + 1)))) && (0 <= (var_1_16 + var_1_13))) && ((((var_1_7 / 256) * 256) + var_1_16) == var_1_7)) || (((((((var_1_7 * 65534) + 128) == ((((var_1_7 / 256) * 16776704) + var_1_1) + (65536 * (((64 + (-8388352 * (var_1_7 / 256))) + (var_1_7 * 32767)) / 32768)))) && ((((var_1_8 + ((var_1_7 / 256) * 256)) + 1) == ((256 * ((var_1_8 + 1) / 256)) + var_1_7)) || (last_1_var_1_13 < (var_1_5 + 1)))) && ((!(((256 * (var_1_14 / 256)) == var_1_14)) && (var_1_16 == var_1_13)) || ((var_1_8 == (((var_1_8 / 256) * 256) + var_1_13)) && ((256 * (var_1_14 / 256)) == var_1_14)))) && (var_1_15 == var_1_11)) && ((((var_1_7 / 256) * 256) + var_1_16) == var_1_7))) || ((((((((var_1_8 + 1) <= (((var_1_8 / 256) * 256) + var_1_7)) && ((((var_1_8 + ((var_1_7 / 256) * 256)) + 1) < ((256 * ((var_1_8 + 1) / 256)) + var_1_7)) || ((var_1_5 + 1) <= last_1_var_1_13))) && ((((var_1_8 + ((var_1_7 / 256) * 256)) + 1) == ((256 * ((var_1_8 + 1) / 256)) + var_1_7)) || (last_1_var_1_13 < (var_1_5 + 1)))) && ((var_1_8 < (((((var_1_8 / 256) * 256) + var_1_16) + var_1_13) + 1)) || (((var_1_8 + ((var_1_7 / 256) * 256)) + 1) < ((256 * ((var_1_8 + 1) / 256)) + var_1_7)))) && (200 <= var_1_7)) && ((var_1_7 / 256) <= 0)) && ((var_1_13 + 1) <= var_1_7))) RESULT: Ultimate proved your program to be correct! [2023-12-19 10:47:51,179 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...