/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 10:28:47,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 10:28:47,829 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-21 10:28:47,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 10:28:47,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 10:28:47,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 10:28:47,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 10:28:47,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 10:28:47,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 10:28:47,862 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 10:28:47,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 10:28:47,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 10:28:47,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 10:28:47,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 10:28:47,863 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 10:28:47,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 10:28:47,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 10:28:47,864 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 10:28:47,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 10:28:47,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 10:28:47,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 10:28:47,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 10:28:47,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 10:28:47,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 10:28:47,865 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 10:28:47,865 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 10:28:47,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 10:28:47,866 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 10:28:47,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 10:28:47,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 10:28:47,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 10:28:47,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 10:28:47,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 10:28:47,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 10:28:47,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 10:28:47,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 10:28:47,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 10:28:47,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 10:28:47,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 10:28:47,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 10:28:47,868 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 10:28:47,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 10:28:47,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 10:28:47,868 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 -> false [2023-12-21 10:28:48,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 10:28:48,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 10:28:48,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 10:28:48,057 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 10:28:48,057 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 10:28:48,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c [2023-12-21 10:28:49,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 10:28:49,330 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 10:28:49,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c [2023-12-21 10:28:49,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/888fd349b/700ca30af0c540249106a30cc4a1b2cc/FLAG44d101592 [2023-12-21 10:28:49,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/888fd349b/700ca30af0c540249106a30cc4a1b2cc [2023-12-21 10:28:49,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 10:28:49,738 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 10:28:49,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 10:28:49,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 10:28:49,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 10:28:49,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@293bc898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49, skipping insertion in model container [2023-12-21 10:28:49,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,756 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 10:28:49,880 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c[947,960] [2023-12-21 10:28:49,883 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 10:28:49,889 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 10:28:49,899 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_8-2.c[947,960] [2023-12-21 10:28:49,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 10:28:49,909 INFO L206 MainTranslator]: Completed translation [2023-12-21 10:28:49,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49 WrapperNode [2023-12-21 10:28:49,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 10:28:49,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 10:28:49,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 10:28:49,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 10:28:49,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,929 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2023-12-21 10:28:49,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 10:28:49,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 10:28:49,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 10:28:49,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 10:28:49,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,945 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-21 10:28:49,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 10:28:49,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 10:28:49,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 10:28:49,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 10:28:49,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49" (1/1) ... [2023-12-21 10:28:49,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 10:28:49,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:28:49,983 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-21 10:28:50,001 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-21 10:28:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 10:28:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 10:28:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-12-21 10:28:50,008 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-12-21 10:28:50,008 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-12-21 10:28:50,008 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-12-21 10:28:50,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 10:28:50,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 10:28:50,057 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 10:28:50,059 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 10:28:50,171 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 10:28:50,191 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 10:28:50,191 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-21 10:28:50,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:28:50 BoogieIcfgContainer [2023-12-21 10:28:50,191 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 10:28:50,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 10:28:50,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 10:28:50,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 10:28:50,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:28:49" (1/3) ... [2023-12-21 10:28:50,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732bf44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:28:50, skipping insertion in model container [2023-12-21 10:28:50,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:28:49" (2/3) ... [2023-12-21 10:28:50,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732bf44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:28:50, skipping insertion in model container [2023-12-21 10:28:50,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:28:50" (3/3) ... [2023-12-21 10:28:50,202 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2023-12-21 10:28:50,214 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 10:28:50,215 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 10:28:50,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 10:28:50,266 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;@75c509b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 10:28:50,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 10:28:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 10:28:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 10:28:50,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:28:50,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 10:28:50,278 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:28:50,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:28:50,283 INFO L85 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2023-12-21 10:28:50,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:28:50,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620088855] [2023-12-21 10:28:50,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:50,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:28:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:28:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 10:28:50,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:28:50,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620088855] [2023-12-21 10:28:50,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620088855] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 10:28:50,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 10:28:50,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 10:28:50,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525577402] [2023-12-21 10:28:50,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 10:28:50,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 10:28:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:28:50,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 10:28:50,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 10:28:50,530 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 10:28:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:28:50,571 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2023-12-21 10:28:50,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 10:28:50,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-12-21 10:28:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:28:50,579 INFO L225 Difference]: With dead ends: 35 [2023-12-21 10:28:50,580 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 10:28:50,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 10:28:50,584 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 10:28:50,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 10:28:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 10:28:50,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-21 10:28:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-21 10:28:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-12-21 10:28:50,610 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2023-12-21 10:28:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:28:50,611 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-12-21 10:28:50,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 10:28:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-12-21 10:28:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 10:28:50,612 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:28:50,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 10:28:50,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 10:28:50,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:28:50,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:28:50,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2023-12-21 10:28:50,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:28:50,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202802055] [2023-12-21 10:28:50,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:50,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:28:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:50,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:28:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 10:28:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:28:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202802055] [2023-12-21 10:28:50,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202802055] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 10:28:50,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 10:28:50,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 10:28:50,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347261283] [2023-12-21 10:28:50,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 10:28:50,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 10:28:50,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:28:50,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 10:28:50,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 10:28:50,703 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 10:28:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:28:50,716 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2023-12-21 10:28:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 10:28:50,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-21 10:28:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:28:50,718 INFO L225 Difference]: With dead ends: 32 [2023-12-21 10:28:50,718 INFO L226 Difference]: Without dead ends: 28 [2023-12-21 10:28:50,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 10:28:50,719 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 10:28:50,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 10:28:50,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-21 10:28:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-12-21 10:28:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-21 10:28:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-12-21 10:28:50,724 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2023-12-21 10:28:50,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:28:50,724 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-12-21 10:28:50,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 10:28:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-12-21 10:28:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 10:28:50,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:28:50,725 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 10:28:50,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 10:28:50,726 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:28:50,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:28:50,726 INFO L85 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2023-12-21 10:28:50,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:28:50,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871019996] [2023-12-21 10:28:50,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:50,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:28:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:50,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:28:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:50,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:50,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 10:28:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 10:28:50,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:28:50,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871019996] [2023-12-21 10:28:50,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871019996] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:28:50,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211357583] [2023-12-21 10:28:50,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:50,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:28:50,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:28:50,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 10:28:50,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 10:28:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:51,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 10:28:51,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:28:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 10:28:51,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:28:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 10:28:51,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211357583] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:28:51,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:28:51,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2023-12-21 10:28:51,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987982372] [2023-12-21 10:28:51,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:28:51,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 10:28:51,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:28:51,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 10:28:51,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-21 10:28:51,333 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 10:28:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:28:51,480 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2023-12-21 10:28:51,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 10:28:51,481 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2023-12-21 10:28:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:28:51,484 INFO L225 Difference]: With dead ends: 54 [2023-12-21 10:28:51,484 INFO L226 Difference]: Without dead ends: 30 [2023-12-21 10:28:51,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-12-21 10:28:51,485 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 10:28:51,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 101 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 10:28:51,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-21 10:28:51,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-12-21 10:28:51,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-21 10:28:51,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-12-21 10:28:51,490 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2023-12-21 10:28:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:28:51,490 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-12-21 10:28:51,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 10:28:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-12-21 10:28:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 10:28:51,491 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:28:51,491 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 10:28:51,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 10:28:51,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:28:51,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:28:51,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:28:51,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2023-12-21 10:28:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:28:51,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156136386] [2023-12-21 10:28:51,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:51,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:28:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:51,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:28:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:51,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:51,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:28:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 10:28:51,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:28:51,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156136386] [2023-12-21 10:28:51,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156136386] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:28:51,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834633772] [2023-12-21 10:28:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:51,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:28:51,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:28:51,800 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 10:28:51,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 10:28:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:51,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 10:28:51,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:28:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 10:28:51,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:28:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 10:28:51,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834633772] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:28:51,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:28:51,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2023-12-21 10:28:51,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911207915] [2023-12-21 10:28:51,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:28:51,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 10:28:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:28:51,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 10:28:51,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-12-21 10:28:51,990 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-21 10:28:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:28:52,078 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2023-12-21 10:28:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 10:28:52,079 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2023-12-21 10:28:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:28:52,080 INFO L225 Difference]: With dead ends: 50 [2023-12-21 10:28:52,081 INFO L226 Difference]: Without dead ends: 46 [2023-12-21 10:28:52,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-12-21 10:28:52,082 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 10:28:52,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 81 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 10:28:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-21 10:28:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2023-12-21 10:28:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2023-12-21 10:28:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2023-12-21 10:28:52,089 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 23 [2023-12-21 10:28:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:28:52,090 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2023-12-21 10:28:52,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-21 10:28:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2023-12-21 10:28:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 10:28:52,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:28:52,091 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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-21 10:28:52,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 10:28:52,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-21 10:28:52,296 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:28:52,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:28:52,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2023-12-21 10:28:52,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:28:52,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028679163] [2023-12-21 10:28:52,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:52,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:28:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:52,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:28:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:52,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:52,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:52,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-21 10:28:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:52,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-21 10:28:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 10:28:52,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:28:52,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028679163] [2023-12-21 10:28:52,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028679163] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:28:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38620450] [2023-12-21 10:28:52,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:52,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:28:52,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:28:52,466 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 10:28:52,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 10:28:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:52,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 10:28:52,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:28:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 10:28:52,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:28:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 10:28:52,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38620450] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:28:52,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:28:52,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2023-12-21 10:28:52,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479328535] [2023-12-21 10:28:52,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:28:52,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-21 10:28:52,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:28:52,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-21 10:28:52,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-12-21 10:28:52,852 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-21 10:28:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:28:53,019 INFO L93 Difference]: Finished difference Result 104 states and 166 transitions. [2023-12-21 10:28:53,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 10:28:53,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 35 [2023-12-21 10:28:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:28:53,021 INFO L225 Difference]: With dead ends: 104 [2023-12-21 10:28:53,021 INFO L226 Difference]: Without dead ends: 62 [2023-12-21 10:28:53,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-12-21 10:28:53,023 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 53 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 10:28:53,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 125 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 10:28:53,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-21 10:28:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-21 10:28:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2023-12-21 10:28:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2023-12-21 10:28:53,031 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 35 [2023-12-21 10:28:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:28:53,031 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2023-12-21 10:28:53,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-21 10:28:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2023-12-21 10:28:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-21 10:28:53,032 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:28:53,032 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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-21 10:28:53,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 10:28:53,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:28:53,237 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:28:53,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:28:53,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2023-12-21 10:28:53,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:28:53,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848717309] [2023-12-21 10:28:53,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:53,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:28:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:53,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:28:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:53,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:53,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:53,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:28:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:53,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:28:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:53,340 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-21 10:28:53,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:28:53,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848717309] [2023-12-21 10:28:53,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848717309] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:28:53,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257666552] [2023-12-21 10:28:53,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:53,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:28:53,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:28:53,347 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 10:28:53,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 10:28:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:53,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 10:28:53,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:28:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 10:28:53,447 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:28:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 10:28:53,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257666552] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:28:53,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:28:53,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2023-12-21 10:28:53,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732533887] [2023-12-21 10:28:53,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:28:53,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 10:28:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:28:53,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 10:28:53,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-21 10:28:53,686 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-21 10:28:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:28:53,977 INFO L93 Difference]: Finished difference Result 176 states and 320 transitions. [2023-12-21 10:28:53,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 10:28:53,978 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2023-12-21 10:28:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:28:53,980 INFO L225 Difference]: With dead ends: 176 [2023-12-21 10:28:53,980 INFO L226 Difference]: Without dead ends: 116 [2023-12-21 10:28:53,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2023-12-21 10:28:53,982 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 37 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 10:28:53,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 282 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 10:28:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-21 10:28:53,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2023-12-21 10:28:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 68 states have internal predecessors, (79), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2023-12-21 10:28:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 165 transitions. [2023-12-21 10:28:53,997 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 165 transitions. Word has length 36 [2023-12-21 10:28:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:28:53,997 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 165 transitions. [2023-12-21 10:28:53,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-21 10:28:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 165 transitions. [2023-12-21 10:28:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-21 10:28:53,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:28:53,999 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 10:28:54,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 10:28:54,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:28:54,221 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:28:54,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:28:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2023-12-21 10:28:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:28:54,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017707411] [2023-12-21 10:28:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:54,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:28:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:54,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:28:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:54,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:54,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:54,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:54,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:28:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:54,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:28:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:54,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-21 10:28:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-21 10:28:54,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:28:54,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017707411] [2023-12-21 10:28:54,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017707411] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:28:54,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154523051] [2023-12-21 10:28:54,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:54,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:28:54,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:28:54,381 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 10:28:54,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 10:28:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:54,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 10:28:54,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:28:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-21 10:28:54,496 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:28:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 10:28:54,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154523051] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:28:54,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:28:54,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2023-12-21 10:28:54,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291935307] [2023-12-21 10:28:54,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:28:54,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 10:28:54,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:28:54,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 10:28:54,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-12-21 10:28:54,912 INFO L87 Difference]: Start difference. First operand 102 states and 165 transitions. Second operand has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2023-12-21 10:28:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:28:55,171 INFO L93 Difference]: Finished difference Result 254 states and 494 transitions. [2023-12-21 10:28:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 10:28:55,172 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 50 [2023-12-21 10:28:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:28:55,175 INFO L225 Difference]: With dead ends: 254 [2023-12-21 10:28:55,175 INFO L226 Difference]: Without dead ends: 154 [2023-12-21 10:28:55,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2023-12-21 10:28:55,178 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 10:28:55,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 254 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 10:28:55,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-21 10:28:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2023-12-21 10:28:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 71 states have internal predecessors, (86), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2023-12-21 10:28:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 176 transitions. [2023-12-21 10:28:55,209 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 176 transitions. Word has length 50 [2023-12-21 10:28:55,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:28:55,212 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 176 transitions. [2023-12-21 10:28:55,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2023-12-21 10:28:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 176 transitions. [2023-12-21 10:28:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-21 10:28:55,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:28:55,216 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 10:28:55,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-21 10:28:55,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:28:55,424 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:28:55,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:28:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash 18580375, now seen corresponding path program 1 times [2023-12-21 10:28:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:28:55,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429113771] [2023-12-21 10:28:55,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:55,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:28:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:55,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:28:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:55,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:55,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:55,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:28:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:55,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:28:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:55,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:28:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:55,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 10:28:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:55,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:55,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:28:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-12-21 10:28:55,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:28:55,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429113771] [2023-12-21 10:28:55,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429113771] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:28:55,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961657670] [2023-12-21 10:28:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:55,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:28:55,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:28:55,670 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 10:28:55,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-21 10:28:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:55,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 10:28:55,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:28:55,871 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-21 10:28:55,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:28:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-21 10:28:56,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961657670] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:28:56,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:28:56,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2023-12-21 10:28:56,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407254055] [2023-12-21 10:28:56,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:28:56,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 10:28:56,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:28:56,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 10:28:56,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2023-12-21 10:28:56,462 INFO L87 Difference]: Start difference. First operand 108 states and 176 transitions. Second operand has 24 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 24 states have internal predecessors, (73), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 11 states have call predecessors, (25), 18 states have call successors, (25) [2023-12-21 10:28:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:28:56,776 INFO L93 Difference]: Finished difference Result 239 states and 461 transitions. [2023-12-21 10:28:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-21 10:28:56,776 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 24 states have internal predecessors, (73), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 11 states have call predecessors, (25), 18 states have call successors, (25) Word has length 78 [2023-12-21 10:28:56,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:28:56,778 INFO L225 Difference]: With dead ends: 239 [2023-12-21 10:28:56,778 INFO L226 Difference]: Without dead ends: 106 [2023-12-21 10:28:56,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 10:28:56,779 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 78 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 10:28:56,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 260 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 10:28:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-21 10:28:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 83. [2023-12-21 10:28:56,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 57 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2023-12-21 10:28:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2023-12-21 10:28:56,786 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 78 [2023-12-21 10:28:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:28:56,786 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2023-12-21 10:28:56,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 24 states have internal predecessors, (73), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 11 states have call predecessors, (25), 18 states have call successors, (25) [2023-12-21 10:28:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2023-12-21 10:28:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-21 10:28:56,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:28:56,789 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 14, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2023-12-21 10:28:56,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-21 10:28:56,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:28:56,994 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:28:56,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:28:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 370437973, now seen corresponding path program 1 times [2023-12-21 10:28:56,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:28:56,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947691024] [2023-12-21 10:28:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:56,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:28:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:28:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:28:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:28:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:28:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 10:28:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:28:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:28:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:28:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-21 10:28:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:28:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:28:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:28:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 10:28:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:28:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:28:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:28:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 84 proven. 258 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2023-12-21 10:28:57,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:28:57,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947691024] [2023-12-21 10:28:57,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947691024] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:28:57,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436772673] [2023-12-21 10:28:57,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:57,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:28:57,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:28:57,403 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 10:28:57,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-21 10:28:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:57,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 10:28:57,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:28:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 47 proven. 369 refuted. 0 times theorem prover too weak. 881 trivial. 0 not checked. [2023-12-21 10:28:57,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:28:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 47 proven. 385 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2023-12-21 10:28:58,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436772673] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:28:58,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:28:58,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 26 [2023-12-21 10:28:58,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086785096] [2023-12-21 10:28:58,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:28:58,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 10:28:58,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:28:58,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 10:28:58,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2023-12-21 10:28:58,845 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2023-12-21 10:28:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:28:59,281 INFO L93 Difference]: Finished difference Result 213 states and 371 transitions. [2023-12-21 10:28:59,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-21 10:28:59,282 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 216 [2023-12-21 10:28:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:28:59,283 INFO L225 Difference]: With dead ends: 213 [2023-12-21 10:28:59,283 INFO L226 Difference]: Without dead ends: 133 [2023-12-21 10:28:59,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 475 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2023-12-21 10:28:59,285 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 84 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 10:28:59,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 314 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 10:28:59,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-21 10:28:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2023-12-21 10:28:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 77 states have internal predecessors, (92), 20 states have call successors, (20), 11 states have call predecessors, (20), 16 states have return successors, (56), 24 states have call predecessors, (56), 20 states have call successors, (56) [2023-12-21 10:28:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 168 transitions. [2023-12-21 10:28:59,294 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 168 transitions. Word has length 216 [2023-12-21 10:28:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:28:59,294 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 168 transitions. [2023-12-21 10:28:59,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2023-12-21 10:28:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 168 transitions. [2023-12-21 10:28:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-21 10:28:59,297 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:28:59,297 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1] [2023-12-21 10:28:59,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-21 10:28:59,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:28:59,503 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:28:59,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:28:59,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1656224918, now seen corresponding path program 1 times [2023-12-21 10:28:59,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:28:59,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45439837] [2023-12-21 10:28:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:28:59,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:28:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:28:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:59,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:59,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:59,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:59,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:59,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:59,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:59,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:28:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:59,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:28:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:59,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:28:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:59,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:28:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:59,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:28:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:28:59,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-21 10:29:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-12-21 10:29:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 167 proven. 260 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2023-12-21 10:29:00,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:29:00,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45439837] [2023-12-21 10:29:00,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45439837] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:29:00,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983045301] [2023-12-21 10:29:00,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:29:00,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:29:00,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:29:00,109 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 10:29:00,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 10:29:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:00,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-21 10:29:00,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:29:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 77 proven. 418 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2023-12-21 10:29:00,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:29:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 77 proven. 442 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2023-12-21 10:29:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983045301] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:29:01,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:29:01,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 27 [2023-12-21 10:29:01,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079350211] [2023-12-21 10:29:01,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:29:01,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-21 10:29:01,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:29:01,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-21 10:29:01,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2023-12-21 10:29:01,832 INFO L87 Difference]: Start difference. First operand 113 states and 168 transitions. Second operand has 27 states, 26 states have (on average 3.423076923076923) internal successors, (89), 27 states have internal predecessors, (89), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2023-12-21 10:29:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:29:02,262 INFO L93 Difference]: Finished difference Result 259 states and 446 transitions. [2023-12-21 10:29:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-21 10:29:02,262 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.423076923076923) internal successors, (89), 27 states have internal predecessors, (89), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) Word has length 227 [2023-12-21 10:29:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:29:02,264 INFO L225 Difference]: With dead ends: 259 [2023-12-21 10:29:02,264 INFO L226 Difference]: Without dead ends: 154 [2023-12-21 10:29:02,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 498 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2023-12-21 10:29:02,266 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 96 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 10:29:02,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 297 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 10:29:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-21 10:29:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2023-12-21 10:29:02,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.24) internal successors, (124), 98 states have internal predecessors, (124), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (73), 27 states have call predecessors, (73), 26 states have call successors, (73) [2023-12-21 10:29:02,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 223 transitions. [2023-12-21 10:29:02,277 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 223 transitions. Word has length 227 [2023-12-21 10:29:02,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:29:02,277 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 223 transitions. [2023-12-21 10:29:02,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.423076923076923) internal successors, (89), 27 states have internal predecessors, (89), 21 states have call successors, (27), 1 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 21 states have call successors, (36) [2023-12-21 10:29:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 223 transitions. [2023-12-21 10:29:02,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2023-12-21 10:29:02,282 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:29:02,282 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 27, 27, 23, 22, 15, 15, 15, 15, 15, 15, 15, 13, 13, 13, 13, 13, 13, 13, 9, 8, 8, 4, 1, 1, 1, 1, 1, 1] [2023-12-21 10:29:02,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-21 10:29:02,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-21 10:29:02,499 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:29:02,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:29:02,500 INFO L85 PathProgramCache]: Analyzing trace with hash 549509852, now seen corresponding path program 2 times [2023-12-21 10:29:02,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:29:02,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085695708] [2023-12-21 10:29:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:29:02,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:29:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:02,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:29:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:02,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-21 10:29:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-12-21 10:29:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-12-21 10:29:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:29:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4360 backedges. 264 proven. 620 refuted. 0 times theorem prover too weak. 3476 trivial. 0 not checked. [2023-12-21 10:29:03,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:29:03,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085695708] [2023-12-21 10:29:03,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085695708] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:29:03,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730189445] [2023-12-21 10:29:03,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 10:29:03,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:29:03,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:29:03,377 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 10:29:03,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 10:29:03,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 10:29:03,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 10:29:03,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 10:29:03,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:29:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4360 backedges. 212 proven. 620 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2023-12-21 10:29:03,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:29:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4360 backedges. 212 proven. 636 refuted. 0 times theorem prover too weak. 3512 trivial. 0 not checked. [2023-12-21 10:29:04,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730189445] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:29:04,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:29:04,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 25 [2023-12-21 10:29:04,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527817223] [2023-12-21 10:29:04,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:29:04,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-21 10:29:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:29:04,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-21 10:29:04,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2023-12-21 10:29:04,933 INFO L87 Difference]: Start difference. First operand 144 states and 223 transitions. Second operand has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 18 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (34), 15 states have call predecessors, (34), 18 states have call successors, (34) [2023-12-21 10:29:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:29:05,303 INFO L93 Difference]: Finished difference Result 322 states and 533 transitions. [2023-12-21 10:29:05,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-21 10:29:05,304 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 18 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (34), 15 states have call predecessors, (34), 18 states have call successors, (34) Word has length 390 [2023-12-21 10:29:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:29:05,305 INFO L225 Difference]: With dead ends: 322 [2023-12-21 10:29:05,305 INFO L226 Difference]: Without dead ends: 187 [2023-12-21 10:29:05,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 876 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2023-12-21 10:29:05,307 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 90 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 10:29:05,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 287 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 10:29:05,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-21 10:29:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 144. [2023-12-21 10:29:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.2) internal successors, (120), 98 states have internal predecessors, (120), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (68), 27 states have call predecessors, (68), 26 states have call successors, (68) [2023-12-21 10:29:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2023-12-21 10:29:05,314 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 390 [2023-12-21 10:29:05,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:29:05,315 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2023-12-21 10:29:05,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5) internal successors, (84), 25 states have internal predecessors, (84), 18 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (34), 15 states have call predecessors, (34), 18 states have call successors, (34) [2023-12-21 10:29:05,315 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2023-12-21 10:29:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2023-12-21 10:29:05,318 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:29:05,318 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 26, 25, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 11, 9, 6, 6, 1, 1, 1, 1, 1, 1] [2023-12-21 10:29:05,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-21 10:29:05,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:29:05,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:29:05,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:29:05,525 INFO L85 PathProgramCache]: Analyzing trace with hash 527930297, now seen corresponding path program 3 times [2023-12-21 10:29:05,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:29:05,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549697311] [2023-12-21 10:29:05,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:29:05,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:29:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:05,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:29:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:29:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-21 10:29:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-21 10:29:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:29:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1060 proven. 718 refuted. 0 times theorem prover too weak. 3591 trivial. 0 not checked. [2023-12-21 10:29:06,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:29:06,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549697311] [2023-12-21 10:29:06,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549697311] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:29:06,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241836466] [2023-12-21 10:29:06,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 10:29:06,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:29:06,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:29:06,965 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 10:29:06,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-21 10:29:07,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-21 10:29:07,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 10:29:07,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-21 10:29:07,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:29:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1096 proven. 84 refuted. 0 times theorem prover too weak. 4189 trivial. 0 not checked. [2023-12-21 10:29:07,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:29:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5369 backedges. 1096 proven. 89 refuted. 0 times theorem prover too weak. 4184 trivial. 0 not checked. [2023-12-21 10:29:08,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241836466] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:29:08,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:29:08,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 14, 17] total 42 [2023-12-21 10:29:08,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185048904] [2023-12-21 10:29:08,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:29:08,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-21 10:29:08,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:29:08,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-21 10:29:08,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2023-12-21 10:29:08,609 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand has 42 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 42 states have internal predecessors, (114), 26 states have call successors, (38), 1 states have call predecessors, (38), 16 states have return successors, (48), 29 states have call predecessors, (48), 26 states have call successors, (48) [2023-12-21 10:29:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:29:09,022 INFO L93 Difference]: Finished difference Result 327 states and 559 transitions. [2023-12-21 10:29:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-21 10:29:09,023 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 42 states have internal predecessors, (114), 26 states have call successors, (38), 1 states have call predecessors, (38), 16 states have return successors, (48), 29 states have call predecessors, (48), 26 states have call successors, (48) Word has length 432 [2023-12-21 10:29:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:29:09,025 INFO L225 Difference]: With dead ends: 327 [2023-12-21 10:29:09,025 INFO L226 Difference]: Without dead ends: 184 [2023-12-21 10:29:09,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1025 GetRequests, 967 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=402, Invalid=2250, Unknown=0, NotChecked=0, Total=2652 [2023-12-21 10:29:09,027 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 109 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 10:29:09,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 512 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 10:29:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-12-21 10:29:09,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2023-12-21 10:29:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 128 states have (on average 1.09375) internal successors, (140), 124 states have internal predecessors, (140), 35 states have call successors, (35), 28 states have call predecessors, (35), 16 states have return successors, (83), 27 states have call predecessors, (83), 35 states have call successors, (83) [2023-12-21 10:29:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 258 transitions. [2023-12-21 10:29:09,037 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 258 transitions. Word has length 432 [2023-12-21 10:29:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:29:09,039 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 258 transitions. [2023-12-21 10:29:09,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 42 states have internal predecessors, (114), 26 states have call successors, (38), 1 states have call predecessors, (38), 16 states have return successors, (48), 29 states have call predecessors, (48), 26 states have call successors, (48) [2023-12-21 10:29:09,039 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 258 transitions. [2023-12-21 10:29:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2023-12-21 10:29:09,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:29:09,047 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 42, 42, 37, 35, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 21, 21, 21, 21, 16, 12, 10, 7, 1, 1, 1, 1, 1, 1] [2023-12-21 10:29:09,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-21 10:29:09,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-21 10:29:09,269 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:29:09,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:29:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2057548022, now seen corresponding path program 4 times [2023-12-21 10:29:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:29:09,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591466580] [2023-12-21 10:29:09,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:29:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:29:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:09,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:29:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:29:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-21 10:29:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:10,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:29:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2023-12-21 10:29:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:29:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10881 backedges. 441 proven. 1734 refuted. 0 times theorem prover too weak. 8706 trivial. 0 not checked. [2023-12-21 10:29:11,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:29:11,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591466580] [2023-12-21 10:29:11,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591466580] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:29:11,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015345827] [2023-12-21 10:29:11,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 10:29:11,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:29:11,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:29:11,118 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 10:29:11,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-21 10:29:11,321 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 10:29:11,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 10:29:11,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-21 10:29:11,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:29:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10881 backedges. 5323 proven. 409 refuted. 0 times theorem prover too weak. 5149 trivial. 0 not checked. [2023-12-21 10:29:11,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:29:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10881 backedges. 472 proven. 2086 refuted. 0 times theorem prover too weak. 8323 trivial. 0 not checked. [2023-12-21 10:29:14,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015345827] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:29:14,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:29:14,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 23] total 38 [2023-12-21 10:29:14,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229512738] [2023-12-21 10:29:14,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:29:14,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-21 10:29:14,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:29:14,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-21 10:29:14,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1200, Unknown=0, NotChecked=0, Total=1406 [2023-12-21 10:29:14,208 INFO L87 Difference]: Start difference. First operand 180 states and 258 transitions. Second operand has 38 states, 37 states have (on average 3.4054054054054053) internal successors, (126), 38 states have internal predecessors, (126), 32 states have call successors, (43), 2 states have call predecessors, (43), 13 states have return successors, (54), 19 states have call predecessors, (54), 32 states have call successors, (54) [2023-12-21 10:29:14,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:29:14,730 INFO L93 Difference]: Finished difference Result 379 states and 561 transitions. [2023-12-21 10:29:14,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-21 10:29:14,731 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.4054054054054053) internal successors, (126), 38 states have internal predecessors, (126), 32 states have call successors, (43), 2 states have call predecessors, (43), 13 states have return successors, (54), 19 states have call predecessors, (54), 32 states have call successors, (54) Word has length 609 [2023-12-21 10:29:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:29:14,733 INFO L225 Difference]: With dead ends: 379 [2023-12-21 10:29:14,733 INFO L226 Difference]: Without dead ends: 201 [2023-12-21 10:29:14,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1433 GetRequests, 1368 SyntacticMatches, 11 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=493, Invalid=2587, Unknown=0, NotChecked=0, Total=3080 [2023-12-21 10:29:14,734 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 112 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 10:29:14,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 414 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 10:29:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-21 10:29:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 178. [2023-12-21 10:29:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 127 states have (on average 1.0866141732283465) internal successors, (138), 122 states have internal predecessors, (138), 34 states have call successors, (34), 28 states have call predecessors, (34), 16 states have return successors, (78), 27 states have call predecessors, (78), 34 states have call successors, (78) [2023-12-21 10:29:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 250 transitions. [2023-12-21 10:29:14,743 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 250 transitions. Word has length 609 [2023-12-21 10:29:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:29:14,743 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 250 transitions. [2023-12-21 10:29:14,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.4054054054054053) internal successors, (126), 38 states have internal predecessors, (126), 32 states have call successors, (43), 2 states have call predecessors, (43), 13 states have return successors, (54), 19 states have call predecessors, (54), 32 states have call successors, (54) [2023-12-21 10:29:14,743 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 250 transitions. [2023-12-21 10:29:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2023-12-21 10:29:14,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:29:14,753 INFO L195 NwaCegarLoop]: trace histogram [53, 53, 50, 50, 42, 41, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 16, 16, 12, 8, 1, 1, 1, 1, 1, 1] [2023-12-21 10:29:14,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-21 10:29:14,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-21 10:29:14,959 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:29:14,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:29:14,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1614030059, now seen corresponding path program 5 times [2023-12-21 10:29:14,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:29:14,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055873665] [2023-12-21 10:29:14,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:29:14,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:29:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:15,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:29:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:15,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:15,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:29:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-21 10:29:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:29:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-12-21 10:29:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:29:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-21 10:29:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:29:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 579 proven. 2330 refuted. 0 times theorem prover too weak. 11684 trivial. 0 not checked. [2023-12-21 10:29:16,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:29:16,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055873665] [2023-12-21 10:29:16,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055873665] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:29:16,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650911500] [2023-12-21 10:29:16,656 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 10:29:16,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:29:16,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:29:16,674 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 10:29:16,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-21 10:29:16,981 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2023-12-21 10:29:16,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 10:29:16,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 10:29:16,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:29:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 2275 proven. 795 refuted. 0 times theorem prover too weak. 11523 trivial. 0 not checked. [2023-12-21 10:29:17,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:29:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 2275 proven. 819 refuted. 0 times theorem prover too weak. 11499 trivial. 0 not checked. [2023-12-21 10:29:20,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650911500] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:29:20,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:29:20,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18, 25] total 44 [2023-12-21 10:29:20,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102297705] [2023-12-21 10:29:20,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:29:20,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-21 10:29:20,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:29:20,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-21 10:29:20,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1633, Unknown=0, NotChecked=0, Total=1892 [2023-12-21 10:29:20,175 INFO L87 Difference]: Start difference. First operand 178 states and 250 transitions. Second operand has 44 states, 43 states have (on average 2.953488372093023) internal successors, (127), 44 states have internal predecessors, (127), 35 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (57), 25 states have call predecessors, (57), 35 states have call successors, (57) [2023-12-21 10:29:20,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:29:20,949 INFO L93 Difference]: Finished difference Result 404 states and 622 transitions. [2023-12-21 10:29:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-21 10:29:20,952 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.953488372093023) internal successors, (127), 44 states have internal predecessors, (127), 35 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (57), 25 states have call predecessors, (57), 35 states have call successors, (57) Word has length 704 [2023-12-21 10:29:20,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:29:20,954 INFO L225 Difference]: With dead ends: 404 [2023-12-21 10:29:20,954 INFO L226 Difference]: Without dead ends: 228 [2023-12-21 10:29:20,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1662 GetRequests, 1582 SyntacticMatches, 12 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=711, Invalid=4119, Unknown=0, NotChecked=0, Total=4830 [2023-12-21 10:29:20,957 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 119 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 10:29:20,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 540 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 10:29:20,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-12-21 10:29:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 196. [2023-12-21 10:29:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 139 states have (on average 1.079136690647482) internal successors, (150), 135 states have internal predecessors, (150), 39 states have call successors, (39), 31 states have call predecessors, (39), 17 states have return successors, (92), 29 states have call predecessors, (92), 39 states have call successors, (92) [2023-12-21 10:29:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 281 transitions. [2023-12-21 10:29:20,975 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 281 transitions. Word has length 704 [2023-12-21 10:29:20,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:29:20,975 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 281 transitions. [2023-12-21 10:29:20,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.953488372093023) internal successors, (127), 44 states have internal predecessors, (127), 35 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (57), 25 states have call predecessors, (57), 35 states have call successors, (57) [2023-12-21 10:29:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 281 transitions. [2023-12-21 10:29:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2023-12-21 10:29:20,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:29:20,978 INFO L195 NwaCegarLoop]: trace histogram [42, 42, 41, 41, 34, 33, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 14, 12, 8, 8, 1, 1, 1, 1, 1, 1] [2023-12-21 10:29:20,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-21 10:29:21,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-21 10:29:21,198 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:29:21,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:29:21,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1624531253, now seen corresponding path program 6 times [2023-12-21 10:29:21,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:29:21,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770863775] [2023-12-21 10:29:21,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:29:21,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:29:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:21,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 10:29:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:29:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-21 10:29:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-21 10:29:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-21 10:29:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-21 10:29:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-21 10:29:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-21 10:29:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-21 10:29:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-21 10:29:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 10:29:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 10:29:22,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 835 proven. 1688 refuted. 0 times theorem prover too weak. 6890 trivial. 0 not checked. [2023-12-21 10:29:22,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 10:29:22,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770863775] [2023-12-21 10:29:22,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770863775] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 10:29:22,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53072444] [2023-12-21 10:29:22,686 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 10:29:22,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 10:29:22,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 10:29:22,687 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 10:29:22,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-21 10:29:23,013 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2023-12-21 10:29:23,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 10:29:23,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 168 conjunts are in the unsatisfiable core [2023-12-21 10:29:23,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 10:29:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 1711 proven. 1409 refuted. 0 times theorem prover too weak. 6293 trivial. 0 not checked. [2023-12-21 10:29:23,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 10:30:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 2111 proven. 1097 refuted. 0 times theorem prover too weak. 6205 trivial. 0 not checked. [2023-12-21 10:30:03,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53072444] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 10:30:03,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 10:30:03,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 37, 53] total 95 [2023-12-21 10:30:03,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291892204] [2023-12-21 10:30:03,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 10:30:03,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2023-12-21 10:30:03,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 10:30:03,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2023-12-21 10:30:03,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=8352, Unknown=0, NotChecked=0, Total=8930 [2023-12-21 10:30:03,995 INFO L87 Difference]: Start difference. First operand 196 states and 281 transitions. Second operand has 95 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 66 states have internal predecessors, (138), 30 states have call successors, (36), 1 states have call predecessors, (36), 34 states have return successors, (74), 69 states have call predecessors, (74), 30 states have call successors, (74) [2023-12-21 10:30:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 10:30:06,266 INFO L93 Difference]: Finished difference Result 423 states and 663 transitions. [2023-12-21 10:30:06,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-12-21 10:30:06,278 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 66 states have internal predecessors, (138), 30 states have call successors, (36), 1 states have call predecessors, (36), 34 states have return successors, (74), 69 states have call predecessors, (74), 30 states have call successors, (74) Word has length 568 [2023-12-21 10:30:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 10:30:06,280 INFO L225 Difference]: With dead ends: 423 [2023-12-21 10:30:06,280 INFO L226 Difference]: Without dead ends: 235 [2023-12-21 10:30:06,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1390 GetRequests, 1123 SyntacticMatches, 111 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15636 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1766, Invalid=23040, Unknown=0, NotChecked=0, Total=24806 [2023-12-21 10:30:06,287 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 121 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 2817 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-21 10:30:06,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 914 Invalid, 2928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2817 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-21 10:30:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2023-12-21 10:30:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 216. [2023-12-21 10:30:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 154 states have (on average 1.0714285714285714) internal successors, (165), 149 states have internal predecessors, (165), 43 states have call successors, (43), 35 states have call predecessors, (43), 18 states have return successors, (106), 31 states have call predecessors, (106), 43 states have call successors, (106) [2023-12-21 10:30:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 314 transitions. [2023-12-21 10:30:06,323 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 314 transitions. Word has length 568 [2023-12-21 10:30:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 10:30:06,323 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 314 transitions. [2023-12-21 10:30:06,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 94 states have (on average 1.4680851063829787) internal successors, (138), 66 states have internal predecessors, (138), 30 states have call successors, (36), 1 states have call predecessors, (36), 34 states have return successors, (74), 69 states have call predecessors, (74), 30 states have call successors, (74) [2023-12-21 10:30:06,323 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 314 transitions. [2023-12-21 10:30:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2023-12-21 10:30:06,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 10:30:06,325 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1] [2023-12-21 10:30:06,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-21 10:30:06,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-21 10:30:06,526 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 10:30:06,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 10:30:06,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1278903223, now seen corresponding path program 7 times [2023-12-21 10:30:06,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 10:30:06,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959532190] [2023-12-21 10:30:06,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 10:30:06,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 10:30:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 10:30:06,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 10:30:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 10:30:06,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 10:30:06,650 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 10:30:06,650 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 10:30:06,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 10:30:06,654 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 10:30:06,657 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 10:30:06,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 10:30:06 BoogieIcfgContainer [2023-12-21 10:30:06,736 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 10:30:06,737 INFO L158 Benchmark]: Toolchain (without parser) took 76999.12ms. Allocated memory was 249.6MB in the beginning and 934.3MB in the end (delta: 684.7MB). Free memory was 200.0MB in the beginning and 696.3MB in the end (delta: -496.3MB). Peak memory consumption was 189.9MB. Max. memory is 8.0GB. [2023-12-21 10:30:06,737 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 10:30:06,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.16ms. Allocated memory is still 249.6MB. Free memory was 199.5MB in the beginning and 188.8MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 10:30:06,737 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.77ms. Allocated memory is still 249.6MB. Free memory was 188.8MB in the beginning and 187.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 10:30:06,737 INFO L158 Benchmark]: Boogie Preprocessor took 20.45ms. Allocated memory is still 249.6MB. Free memory was 187.4MB in the beginning and 185.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 10:30:06,738 INFO L158 Benchmark]: RCFGBuilder took 240.91ms. Allocated memory is still 249.6MB. Free memory was 185.8MB in the beginning and 175.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 10:30:06,738 INFO L158 Benchmark]: TraceAbstraction took 76539.10ms. Allocated memory was 249.6MB in the beginning and 934.3MB in the end (delta: 684.7MB). Free memory was 174.8MB in the beginning and 696.3MB in the end (delta: -521.5MB). Peak memory consumption was 164.8MB. Max. memory is 8.0GB. [2023-12-21 10:30:06,739 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.10ms. Allocated memory is still 207.6MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.16ms. Allocated memory is still 249.6MB. Free memory was 199.5MB in the beginning and 188.8MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.77ms. Allocated memory is still 249.6MB. Free memory was 188.8MB in the beginning and 187.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.45ms. Allocated memory is still 249.6MB. Free memory was 187.4MB in the beginning and 185.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 240.91ms. Allocated memory is still 249.6MB. Free memory was 185.8MB in the beginning and 175.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 76539.10ms. Allocated memory was 249.6MB in the beginning and 934.3MB in the end (delta: 684.7MB). Free memory was 174.8MB in the beginning and 696.3MB in the end (delta: -521.5MB). Peak memory consumption was 164.8MB. 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 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [result=21, x=8] [L41] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.4s, OverallIterations: 16, TraceHistogramMax: 53, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1092 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1025 mSDsluCounter, 4608 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4167 mSDsCounter, 905 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8688 IncrementalHoareTripleChecker+Invalid, 9593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 905 mSolverCounterUnsat, 441 mSDtfsCounter, 8688 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8168 GetRequests, 7403 SyntacticMatches, 182 SemanticMatches, 583 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21276 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=15, InterpolantAutomatonStates: 389, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 240 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 64.2s InterpolantComputationTime, 7258 NumberOfCodeBlocks, 6764 NumberOfCodeBlocksAsserted, 111 NumberOfCheckSat, 10148 ConstructedInterpolants, 0 QuantifiedInterpolants, 15665 SizeOfPredicates, 66 NumberOfNonLiveVariables, 6605 ConjunctsInSsa, 324 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 125057/142626 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-21 10:30:06,768 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...