/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 20:55:23,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 20:55:23,750 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-15 20:55:23,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 20:55:23,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 20:55:23,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 20:55:23,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 20:55:23,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 20:55:23,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 20:55:23,793 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 20:55:23,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 20:55:23,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 20:55:23,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 20:55:23,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 20:55:23,796 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 20:55:23,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 20:55:23,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 20:55:23,797 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 20:55:23,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 20:55:23,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 20:55:23,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 20:55:23,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 20:55:23,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 20:55:23,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 20:55:23,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 20:55:23,798 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 20:55:23,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 20:55:23,799 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 20:55:23,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 20:55:23,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 20:55:23,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 20:55:23,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 20:55:23,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:55:23,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 20:55:23,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 20:55:23,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 20:55:23,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 20:55:23,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 20:55:23,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 20:55:23,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 20:55:23,802 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 20:55:23,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 20:55:23,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 20:55:23,802 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 20:55:24,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 20:55:24,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 20:55:24,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 20:55:24,070 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 20:55:24,071 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 20:55:24,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i [2023-12-15 20:55:25,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 20:55:25,406 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 20:55:25,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i [2023-12-15 20:55:25,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4094fb752/3f5aaa5361fd429c9e5b8b10d460c651/FLAG316d34eaa [2023-12-15 20:55:25,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4094fb752/3f5aaa5361fd429c9e5b8b10d460c651 [2023-12-15 20:55:25,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 20:55:25,427 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 20:55:25,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 20:55:25,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 20:55:25,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 20:55:25,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d1ff4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25, skipping insertion in model container [2023-12-15 20:55:25,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,466 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 20:55:25,623 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i[915,928] [2023-12-15 20:55:25,675 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:55:25,695 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 20:55:25,715 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i[915,928] [2023-12-15 20:55:25,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 20:55:25,759 INFO L206 MainTranslator]: Completed translation [2023-12-15 20:55:25,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25 WrapperNode [2023-12-15 20:55:25,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 20:55:25,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 20:55:25,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 20:55:25,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 20:55:25,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,817 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2023-12-15 20:55:25,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 20:55:25,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 20:55:25,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 20:55:25,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 20:55:25,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,848 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-15 20:55:25,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,854 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 20:55:25,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 20:55:25,877 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 20:55:25,877 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 20:55:25,878 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25" (1/1) ... [2023-12-15 20:55:25,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 20:55:25,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:55:25,913 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-15 20:55:25,938 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-15 20:55:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 20:55:25,945 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 20:55:25,946 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 20:55:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 20:55:25,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 20:55:25,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 20:55:26,019 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 20:55:26,023 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 20:55:26,288 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 20:55:26,328 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 20:55:26,328 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 20:55:26,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:55:26 BoogieIcfgContainer [2023-12-15 20:55:26,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 20:55:26,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 20:55:26,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 20:55:26,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 20:55:26,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:55:25" (1/3) ... [2023-12-15 20:55:26,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4910963f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:55:26, skipping insertion in model container [2023-12-15 20:55:26,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:55:25" (2/3) ... [2023-12-15 20:55:26,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4910963f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:55:26, skipping insertion in model container [2023-12-15 20:55:26,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:55:26" (3/3) ... [2023-12-15 20:55:26,344 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-22.i [2023-12-15 20:55:26,359 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 20:55:26,359 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 20:55:26,417 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 20:55:26,423 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;@2e91dec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 20:55:26,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 20:55:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-15 20:55:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-15 20:55:26,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:26,439 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:55:26,440 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:26,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:26,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1610818779, now seen corresponding path program 1 times [2023-12-15 20:55:26,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:26,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134456269] [2023-12-15 20:55:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:26,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:26,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:26,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:26,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:26,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:26,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:26,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 20:55:26,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:26,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134456269] [2023-12-15 20:55:26,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134456269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:26,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:26,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 20:55:26,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852568732] [2023-12-15 20:55:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:26,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 20:55:26,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:26,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 20:55:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:55:26,737 INFO L87 Difference]: Start difference. First operand has 40 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 31 states have internal predecessors, (46), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-15 20:55:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:26,760 INFO L93 Difference]: Finished difference Result 77 states and 125 transitions. [2023-12-15 20:55:26,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 20:55:26,762 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2023-12-15 20:55:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:26,768 INFO L225 Difference]: With dead ends: 77 [2023-12-15 20:55:26,768 INFO L226 Difference]: Without dead ends: 38 [2023-12-15 20:55:26,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 20:55:26,777 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:26,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:55:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-15 20:55:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-15 20:55:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-15 20:55:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2023-12-15 20:55:26,812 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 54 [2023-12-15 20:55:26,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:26,812 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2023-12-15 20:55:26,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-15 20:55:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2023-12-15 20:55:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-15 20:55:26,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:26,814 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:55:26,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 20:55:26,815 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:26,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:26,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2047743005, now seen corresponding path program 1 times [2023-12-15 20:55:26,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:26,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645822419] [2023-12-15 20:55:26,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:26,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:27,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:27,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:27,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:27,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:27,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:27,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:27,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 20:55:27,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:27,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645822419] [2023-12-15 20:55:27,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645822419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:27,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:27,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:55:27,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973522161] [2023-12-15 20:55:27,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:27,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:55:27,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:27,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:55:27,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:55:27,632 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:27,876 INFO L93 Difference]: Finished difference Result 132 states and 180 transitions. [2023-12-15 20:55:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:55:27,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2023-12-15 20:55:27,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:27,882 INFO L225 Difference]: With dead ends: 132 [2023-12-15 20:55:27,882 INFO L226 Difference]: Without dead ends: 95 [2023-12-15 20:55:27,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:55:27,884 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 79 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:27,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 163 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:55:27,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-15 20:55:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2023-12-15 20:55:27,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 20:55:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2023-12-15 20:55:27,912 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 54 [2023-12-15 20:55:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:27,912 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2023-12-15 20:55:27,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2023-12-15 20:55:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-15 20:55:27,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:27,914 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:55:27,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 20:55:27,914 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:27,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:27,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1368803201, now seen corresponding path program 1 times [2023-12-15 20:55:27,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:27,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151747310] [2023-12-15 20:55:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:27,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 20:55:28,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:28,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151747310] [2023-12-15 20:55:28,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151747310] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:28,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:28,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 20:55:28,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472744062] [2023-12-15 20:55:28,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:28,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 20:55:28,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:28,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 20:55:28,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:55:28,308 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:28,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:28,562 INFO L93 Difference]: Finished difference Result 200 states and 269 transitions. [2023-12-15 20:55:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:55:28,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-12-15 20:55:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:28,565 INFO L225 Difference]: With dead ends: 200 [2023-12-15 20:55:28,566 INFO L226 Difference]: Without dead ends: 163 [2023-12-15 20:55:28,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:55:28,569 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 83 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:28,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 193 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:55:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-15 20:55:28,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 110. [2023-12-15 20:55:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-15 20:55:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2023-12-15 20:55:28,605 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 55 [2023-12-15 20:55:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:28,606 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2023-12-15 20:55:28,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2023-12-15 20:55:28,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-15 20:55:28,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:28,615 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:55:28,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 20:55:28,615 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:28,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:28,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1626968639, now seen corresponding path program 1 times [2023-12-15 20:55:28,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:28,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060210041] [2023-12-15 20:55:28,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 20:55:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:28,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060210041] [2023-12-15 20:55:28,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060210041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:28,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:28,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:55:28,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967124379] [2023-12-15 20:55:28,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:28,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:55:28,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:55:28,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:55:28,700 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:28,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:28,725 INFO L93 Difference]: Finished difference Result 175 states and 239 transitions. [2023-12-15 20:55:28,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:55:28,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-12-15 20:55:28,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:28,727 INFO L225 Difference]: With dead ends: 175 [2023-12-15 20:55:28,728 INFO L226 Difference]: Without dead ends: 138 [2023-12-15 20:55:28,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:55:28,739 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 21 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:28,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 105 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:55:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-15 20:55:28,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 114. [2023-12-15 20:55:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-15 20:55:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2023-12-15 20:55:28,761 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 55 [2023-12-15 20:55:28,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:28,762 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2023-12-15 20:55:28,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:28,762 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2023-12-15 20:55:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-15 20:55:28,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:28,764 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:55:28,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 20:55:28,764 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:28,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:28,764 INFO L85 PathProgramCache]: Analyzing trace with hash -715788875, now seen corresponding path program 1 times [2023-12-15 20:55:28,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:28,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36208021] [2023-12-15 20:55:28,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:28,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 20:55:28,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:28,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36208021] [2023-12-15 20:55:28,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36208021] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:28,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:28,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 20:55:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180984171] [2023-12-15 20:55:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:28,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 20:55:28,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:28,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 20:55:28,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 20:55:28,973 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:29,064 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2023-12-15 20:55:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 20:55:29,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2023-12-15 20:55:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:29,066 INFO L225 Difference]: With dead ends: 262 [2023-12-15 20:55:29,067 INFO L226 Difference]: Without dead ends: 167 [2023-12-15 20:55:29,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 20:55:29,068 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 49 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:29,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 135 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:55:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-15 20:55:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 114. [2023-12-15 20:55:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2696629213483146) internal successors, (113), 89 states have internal predecessors, (113), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-15 20:55:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2023-12-15 20:55:29,083 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 55 [2023-12-15 20:55:29,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:29,084 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2023-12-15 20:55:29,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2023-12-15 20:55:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-15 20:55:29,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:29,085 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:55:29,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 20:55:29,085 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:29,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash -288086319, now seen corresponding path program 1 times [2023-12-15 20:55:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:29,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753646078] [2023-12-15 20:55:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 20:55:30,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753646078] [2023-12-15 20:55:30,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753646078] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:30,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:30,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 20:55:30,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959626407] [2023-12-15 20:55:30,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:30,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 20:55:30,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:30,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 20:55:30,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:55:30,412 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:30,754 INFO L93 Difference]: Finished difference Result 321 states and 432 transitions. [2023-12-15 20:55:30,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 20:55:30,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2023-12-15 20:55:30,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:30,756 INFO L225 Difference]: With dead ends: 321 [2023-12-15 20:55:30,756 INFO L226 Difference]: Without dead ends: 226 [2023-12-15 20:55:30,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-12-15 20:55:30,757 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 159 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:30,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 284 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:55:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-12-15 20:55:30,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 105. [2023-12-15 20:55:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-15 20:55:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2023-12-15 20:55:30,772 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 56 [2023-12-15 20:55:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:30,772 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2023-12-15 20:55:30,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2023-12-15 20:55:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-15 20:55:30,773 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:30,773 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:55:30,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 20:55:30,774 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:30,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash 935446905, now seen corresponding path program 1 times [2023-12-15 20:55:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:30,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280566122] [2023-12-15 20:55:30,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:30,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 20:55:30,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:30,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280566122] [2023-12-15 20:55:30,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280566122] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:30,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:30,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:55:30,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202341083] [2023-12-15 20:55:30,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:30,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:55:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:30,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:55:30,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:55:30,851 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:30,910 INFO L93 Difference]: Finished difference Result 263 states and 356 transitions. [2023-12-15 20:55:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:55:30,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 56 [2023-12-15 20:55:30,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:30,913 INFO L225 Difference]: With dead ends: 263 [2023-12-15 20:55:30,913 INFO L226 Difference]: Without dead ends: 177 [2023-12-15 20:55:30,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:55:30,915 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 27 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:30,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 83 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:55:30,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-15 20:55:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2023-12-15 20:55:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 134 states have (on average 1.2313432835820894) internal successors, (165), 134 states have internal predecessors, (165), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-15 20:55:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 235 transitions. [2023-12-15 20:55:30,938 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 235 transitions. Word has length 56 [2023-12-15 20:55:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:30,938 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 235 transitions. [2023-12-15 20:55:30,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 235 transitions. [2023-12-15 20:55:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-15 20:55:30,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:30,940 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:55:30,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 20:55:30,940 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:30,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash -837229607, now seen corresponding path program 1 times [2023-12-15 20:55:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:30,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261779138] [2023-12-15 20:55:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:31,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:31,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:31,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:31,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:31,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:31,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:31,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 20:55:31,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:31,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261779138] [2023-12-15 20:55:31,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261779138] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:31,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:31,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:55:31,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643843255] [2023-12-15 20:55:31,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:31,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:55:31,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:31,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:55:31,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:55:31,699 INFO L87 Difference]: Start difference. First operand 175 states and 235 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:32,012 INFO L93 Difference]: Finished difference Result 320 states and 424 transitions. [2023-12-15 20:55:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:55:32,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 57 [2023-12-15 20:55:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:32,016 INFO L225 Difference]: With dead ends: 320 [2023-12-15 20:55:32,016 INFO L226 Difference]: Without dead ends: 246 [2023-12-15 20:55:32,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-15 20:55:32,018 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 66 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:32,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 164 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:55:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-12-15 20:55:32,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 192. [2023-12-15 20:55:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.2384105960264902) internal successors, (187), 151 states have internal predecessors, (187), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-15 20:55:32,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 257 transitions. [2023-12-15 20:55:32,044 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 257 transitions. Word has length 57 [2023-12-15 20:55:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:32,044 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 257 transitions. [2023-12-15 20:55:32,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 257 transitions. [2023-12-15 20:55:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-15 20:55:32,045 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:32,045 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:55:32,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 20:55:32,046 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:32,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash -136165029, now seen corresponding path program 1 times [2023-12-15 20:55:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:32,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949003166] [2023-12-15 20:55:32,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:32,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:32,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:32,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:32,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:32,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:32,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:32,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:32,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 20:55:32,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:32,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949003166] [2023-12-15 20:55:32,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949003166] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:32,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:32,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:55:32,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890333178] [2023-12-15 20:55:32,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:32,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:55:32,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:32,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:55:32,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:55:32,109 INFO L87 Difference]: Start difference. First operand 192 states and 257 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:32,150 INFO L93 Difference]: Finished difference Result 319 states and 427 transitions. [2023-12-15 20:55:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:55:32,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 57 [2023-12-15 20:55:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:32,154 INFO L225 Difference]: With dead ends: 319 [2023-12-15 20:55:32,154 INFO L226 Difference]: Without dead ends: 146 [2023-12-15 20:55:32,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:55:32,158 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 9 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:32,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 69 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:55:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-15 20:55:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2023-12-15 20:55:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 105 states have internal predecessors, (125), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-15 20:55:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2023-12-15 20:55:32,176 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 57 [2023-12-15 20:55:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:32,177 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2023-12-15 20:55:32,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:32,177 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2023-12-15 20:55:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-15 20:55:32,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:32,178 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:55:32,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 20:55:32,179 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:32,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:32,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2075889351, now seen corresponding path program 1 times [2023-12-15 20:55:32,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:32,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733256321] [2023-12-15 20:55:32,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:32,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:33,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:33,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:33,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:33,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:33,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:33,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:33,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 20:55:33,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:33,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733256321] [2023-12-15 20:55:33,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733256321] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:33,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:33,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 20:55:33,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143977978] [2023-12-15 20:55:33,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:33,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 20:55:33,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:33,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 20:55:33,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:55:33,274 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:33,612 INFO L93 Difference]: Finished difference Result 255 states and 327 transitions. [2023-12-15 20:55:33,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 20:55:33,613 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2023-12-15 20:55:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:33,614 INFO L225 Difference]: With dead ends: 255 [2023-12-15 20:55:33,614 INFO L226 Difference]: Without dead ends: 206 [2023-12-15 20:55:33,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2023-12-15 20:55:33,615 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 171 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:33,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 328 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:55:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-12-15 20:55:33,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 149. [2023-12-15 20:55:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 116 states have internal predecessors, (136), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-15 20:55:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 192 transitions. [2023-12-15 20:55:33,631 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 192 transitions. Word has length 59 [2023-12-15 20:55:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:33,631 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 192 transitions. [2023-12-15 20:55:33,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 192 transitions. [2023-12-15 20:55:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-15 20:55:33,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:33,632 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 20:55:33,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 20:55:33,633 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:33,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:33,633 INFO L85 PathProgramCache]: Analyzing trace with hash 2078627007, now seen corresponding path program 1 times [2023-12-15 20:55:33,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:33,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080929985] [2023-12-15 20:55:33,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:33,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:34,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:34,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:34,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:34,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:34,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:34,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-15 20:55:34,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:34,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080929985] [2023-12-15 20:55:34,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080929985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:34,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:34,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:55:34,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127147497] [2023-12-15 20:55:34,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:34,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:55:34,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:34,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:55:34,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:55:34,082 INFO L87 Difference]: Start difference. First operand 149 states and 192 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:34,245 INFO L93 Difference]: Finished difference Result 158 states and 201 transitions. [2023-12-15 20:55:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 20:55:34,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2023-12-15 20:55:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:34,247 INFO L225 Difference]: With dead ends: 158 [2023-12-15 20:55:34,247 INFO L226 Difference]: Without dead ends: 156 [2023-12-15 20:55:34,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-15 20:55:34,248 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 67 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:34,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 276 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:55:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-15 20:55:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 149. [2023-12-15 20:55:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.1637931034482758) internal successors, (135), 116 states have internal predecessors, (135), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-15 20:55:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 191 transitions. [2023-12-15 20:55:34,261 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 191 transitions. Word has length 60 [2023-12-15 20:55:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:34,262 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 191 transitions. [2023-12-15 20:55:34,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 191 transitions. [2023-12-15 20:55:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-15 20:55:34,263 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:34,263 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:34,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 20:55:34,263 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:34,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1350253502, now seen corresponding path program 1 times [2023-12-15 20:55:34,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:34,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064529563] [2023-12-15 20:55:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:34,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 20:55:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:55:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:55:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:55:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:55:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 20:55:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 20:55:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 20:55:35,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:35,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064529563] [2023-12-15 20:55:35,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064529563] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:55:35,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513673696] [2023-12-15 20:55:35,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:35,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:35,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:55:35,313 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-15 20:55:35,344 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-15 20:55:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:35,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-15 20:55:35,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:55:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-15 20:55:35,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 20:55:35,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513673696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:35,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 20:55:35,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2023-12-15 20:55:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579079814] [2023-12-15 20:55:35,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:35,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:55:35,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:35,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:55:35,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-12-15 20:55:35,740 INFO L87 Difference]: Start difference. First operand 149 states and 191 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:35,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:35,967 INFO L93 Difference]: Finished difference Result 243 states and 311 transitions. [2023-12-15 20:55:35,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 20:55:35,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 112 [2023-12-15 20:55:35,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:35,969 INFO L225 Difference]: With dead ends: 243 [2023-12-15 20:55:35,969 INFO L226 Difference]: Without dead ends: 194 [2023-12-15 20:55:35,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-12-15 20:55:35,970 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 62 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:35,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 163 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:55:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-15 20:55:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 156. [2023-12-15 20:55:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 123 states have (on average 1.170731707317073) internal successors, (144), 123 states have internal predecessors, (144), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-15 20:55:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 200 transitions. [2023-12-15 20:55:35,985 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 200 transitions. Word has length 112 [2023-12-15 20:55:35,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:35,985 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 200 transitions. [2023-12-15 20:55:35,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 200 transitions. [2023-12-15 20:55:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:55:35,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:35,987 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:35,993 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-15 20:55:36,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-15 20:55:36,193 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:36,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash -969015321, now seen corresponding path program 1 times [2023-12-15 20:55:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:36,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867334714] [2023-12-15 20:55:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 20:55:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:55:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:55:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:55:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:55:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 20:55:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 20:55:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 20:55:37,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:37,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867334714] [2023-12-15 20:55:37,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867334714] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:55:37,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891255408] [2023-12-15 20:55:37,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:37,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:37,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:55:37,277 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-15 20:55:37,325 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-15 20:55:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:37,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-15 20:55:37,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:55:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 7 proven. 39 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2023-12-15 20:55:37,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:55:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2023-12-15 20:55:37,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891255408] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 20:55:37,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-15 20:55:37,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 8] total 20 [2023-12-15 20:55:37,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592449725] [2023-12-15 20:55:37,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:37,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:55:37,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:37,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:55:37,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2023-12-15 20:55:37,878 INFO L87 Difference]: Start difference. First operand 156 states and 200 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:38,099 INFO L93 Difference]: Finished difference Result 267 states and 337 transitions. [2023-12-15 20:55:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 20:55:38,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 114 [2023-12-15 20:55:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:38,101 INFO L225 Difference]: With dead ends: 267 [2023-12-15 20:55:38,101 INFO L226 Difference]: Without dead ends: 265 [2023-12-15 20:55:38,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2023-12-15 20:55:38,102 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 44 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:38,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 284 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:55:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-12-15 20:55:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 170. [2023-12-15 20:55:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.167883211678832) internal successors, (160), 137 states have internal predecessors, (160), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-15 20:55:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 216 transitions. [2023-12-15 20:55:38,121 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 216 transitions. Word has length 114 [2023-12-15 20:55:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:38,121 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 216 transitions. [2023-12-15 20:55:38,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 216 transitions. [2023-12-15 20:55:38,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:55:38,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:38,124 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:38,132 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-15 20:55:38,329 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,SelfDestructingSolverStorable12 [2023-12-15 20:55:38,330 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:38,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash -288956951, now seen corresponding path program 1 times [2023-12-15 20:55:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:38,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294526148] [2023-12-15 20:55:38,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:38,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 20:55:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:55:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:55:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:55:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:55:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 20:55:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 20:55:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2023-12-15 20:55:38,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:38,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294526148] [2023-12-15 20:55:38,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294526148] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:38,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:38,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:55:38,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407522199] [2023-12-15 20:55:38,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:38,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:55:38,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:38,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:55:38,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:55:38,428 INFO L87 Difference]: Start difference. First operand 170 states and 216 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:38,456 INFO L93 Difference]: Finished difference Result 238 states and 306 transitions. [2023-12-15 20:55:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:55:38,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 114 [2023-12-15 20:55:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:38,457 INFO L225 Difference]: With dead ends: 238 [2023-12-15 20:55:38,457 INFO L226 Difference]: Without dead ends: 168 [2023-12-15 20:55:38,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:55:38,458 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:38,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:55:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-15 20:55:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-12-15 20:55:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.162962962962963) internal successors, (157), 135 states have internal predecessors, (157), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-15 20:55:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2023-12-15 20:55:38,477 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 114 [2023-12-15 20:55:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:38,478 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2023-12-15 20:55:38,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2023-12-15 20:55:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 20:55:38,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:38,480 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:38,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 20:55:38,480 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:38,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:38,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1638676468, now seen corresponding path program 1 times [2023-12-15 20:55:38,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:38,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544075707] [2023-12-15 20:55:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:38,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-15 20:55:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 20:55:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-15 20:55:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 20:55:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 20:55:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 20:55:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:55:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-15 20:55:39,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:39,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544075707] [2023-12-15 20:55:39,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544075707] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:39,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:39,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 20:55:39,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905125435] [2023-12-15 20:55:39,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:39,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 20:55:39,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:39,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 20:55:39,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 20:55:39,494 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:39,767 INFO L93 Difference]: Finished difference Result 301 states and 376 transitions. [2023-12-15 20:55:39,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 20:55:39,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 114 [2023-12-15 20:55:39,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:39,769 INFO L225 Difference]: With dead ends: 301 [2023-12-15 20:55:39,769 INFO L226 Difference]: Without dead ends: 233 [2023-12-15 20:55:39,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-15 20:55:39,770 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 90 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:39,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 153 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:55:39,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-12-15 20:55:39,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 170. [2023-12-15 20:55:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.167883211678832) internal successors, (160), 137 states have internal predecessors, (160), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-15 20:55:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 216 transitions. [2023-12-15 20:55:39,790 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 216 transitions. Word has length 114 [2023-12-15 20:55:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:39,790 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 216 transitions. [2023-12-15 20:55:39,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 216 transitions. [2023-12-15 20:55:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 20:55:39,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:39,791 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:39,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 20:55:39,792 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:39,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2083547049, now seen corresponding path program 1 times [2023-12-15 20:55:39,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:39,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502886535] [2023-12-15 20:55:39,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:39,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 20:55:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:55:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:55:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:55:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:55:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 20:55:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 20:55:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2023-12-15 20:55:39,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:39,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502886535] [2023-12-15 20:55:39,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502886535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:39,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:39,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 20:55:39,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564894282] [2023-12-15 20:55:39,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:39,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 20:55:39,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:39,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 20:55:39,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:55:39,863 INFO L87 Difference]: Start difference. First operand 170 states and 216 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:39,910 INFO L93 Difference]: Finished difference Result 276 states and 353 transitions. [2023-12-15 20:55:39,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 20:55:39,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 115 [2023-12-15 20:55:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:39,912 INFO L225 Difference]: With dead ends: 276 [2023-12-15 20:55:39,912 INFO L226 Difference]: Without dead ends: 206 [2023-12-15 20:55:39,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 20:55:39,913 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:39,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 74 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 20:55:39,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-12-15 20:55:39,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 186. [2023-12-15 20:55:39,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 145 states have (on average 1.1655172413793105) internal successors, (169), 145 states have internal predecessors, (169), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-15 20:55:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 239 transitions. [2023-12-15 20:55:39,933 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 239 transitions. Word has length 115 [2023-12-15 20:55:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:39,933 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 239 transitions. [2023-12-15 20:55:39,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2023-12-15 20:55:39,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 20:55:39,934 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:39,934 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-15 20:55:39,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 20:55:39,935 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:39,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:39,935 INFO L85 PathProgramCache]: Analyzing trace with hash -511949634, now seen corresponding path program 1 times [2023-12-15 20:55:39,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:39,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760251813] [2023-12-15 20:55:39,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:39,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-15 20:55:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 20:55:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-15 20:55:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 20:55:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 20:55:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 20:55:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 20:55:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-15 20:55:40,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:40,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760251813] [2023-12-15 20:55:40,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760251813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:40,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:40,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:55:40,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881495493] [2023-12-15 20:55:40,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:40,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:55:40,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:40,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:55:40,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:55:40,683 INFO L87 Difference]: Start difference. First operand 186 states and 239 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:40,831 INFO L93 Difference]: Finished difference Result 320 states and 401 transitions. [2023-12-15 20:55:40,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 20:55:40,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 115 [2023-12-15 20:55:40,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:40,837 INFO L225 Difference]: With dead ends: 320 [2023-12-15 20:55:40,837 INFO L226 Difference]: Without dead ends: 223 [2023-12-15 20:55:40,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:55:40,838 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 43 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:40,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 150 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:55:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-12-15 20:55:40,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 170. [2023-12-15 20:55:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 129 states have (on average 1.1317829457364341) internal successors, (146), 129 states have internal predecessors, (146), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-15 20:55:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 216 transitions. [2023-12-15 20:55:40,859 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 216 transitions. Word has length 115 [2023-12-15 20:55:40,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:40,859 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 216 transitions. [2023-12-15 20:55:40,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 216 transitions. [2023-12-15 20:55:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 20:55:40,860 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:40,861 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:40,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 20:55:40,861 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:40,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:40,861 INFO L85 PathProgramCache]: Analyzing trace with hash 279692040, now seen corresponding path program 1 times [2023-12-15 20:55:40,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:40,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57711581] [2023-12-15 20:55:40,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:40,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 20:55:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:55:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:55:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:55:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:55:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 20:55:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 20:55:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 20:55:43,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:43,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57711581] [2023-12-15 20:55:43,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57711581] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:55:43,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217993637] [2023-12-15 20:55:43,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:43,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:43,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:55:43,234 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-15 20:55:43,263 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-15 20:55:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:43,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-15 20:55:43,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:55:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 14 proven. 39 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2023-12-15 20:55:45,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:55:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2023-12-15 20:55:49,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217993637] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 20:55:49,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-15 20:55:49,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18, 13] total 34 [2023-12-15 20:55:49,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196599079] [2023-12-15 20:55:49,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:49,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 20:55:49,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:49,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 20:55:49,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2023-12-15 20:55:49,653 INFO L87 Difference]: Start difference. First operand 170 states and 216 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:50,026 INFO L93 Difference]: Finished difference Result 263 states and 333 transitions. [2023-12-15 20:55:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 20:55:50,027 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 116 [2023-12-15 20:55:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:50,028 INFO L225 Difference]: With dead ends: 263 [2023-12-15 20:55:50,029 INFO L226 Difference]: Without dead ends: 261 [2023-12-15 20:55:50,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=193, Invalid=1213, Unknown=0, NotChecked=0, Total=1406 [2023-12-15 20:55:50,030 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 46 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:50,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 342 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 20:55:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-12-15 20:55:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 178. [2023-12-15 20:55:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 137 states have (on average 1.1240875912408759) internal successors, (154), 137 states have internal predecessors, (154), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-15 20:55:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 224 transitions. [2023-12-15 20:55:50,048 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 224 transitions. Word has length 116 [2023-12-15 20:55:50,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:50,049 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 224 transitions. [2023-12-15 20:55:50,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 224 transitions. [2023-12-15 20:55:50,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 20:55:50,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:50,050 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:50,056 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-15 20:55:50,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-15 20:55:50,256 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:50,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:50,256 INFO L85 PathProgramCache]: Analyzing trace with hash -113334970, now seen corresponding path program 1 times [2023-12-15 20:55:50,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:50,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074820608] [2023-12-15 20:55:50,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:50,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 20:55:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:55:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:55:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:55:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:55:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 20:55:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 20:55:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-15 20:55:50,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:50,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074820608] [2023-12-15 20:55:50,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074820608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 20:55:50,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 20:55:50,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 20:55:50,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201769140] [2023-12-15 20:55:50,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:50,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:55:50,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:50,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:55:50,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 20:55:50,580 INFO L87 Difference]: Start difference. First operand 178 states and 224 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:50,778 INFO L93 Difference]: Finished difference Result 326 states and 398 transitions. [2023-12-15 20:55:50,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 20:55:50,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 116 [2023-12-15 20:55:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:50,780 INFO L225 Difference]: With dead ends: 326 [2023-12-15 20:55:50,780 INFO L226 Difference]: Without dead ends: 237 [2023-12-15 20:55:50,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-15 20:55:50,781 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 52 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:50,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 137 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:55:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-12-15 20:55:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 182. [2023-12-15 20:55:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 141 states have (on average 1.127659574468085) internal successors, (159), 141 states have internal predecessors, (159), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-15 20:55:50,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2023-12-15 20:55:50,801 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 116 [2023-12-15 20:55:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:50,802 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2023-12-15 20:55:50,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2023-12-15 20:55:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 20:55:50,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 20:55:50,803 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:50,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 20:55:50,803 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 20:55:50,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 20:55:50,804 INFO L85 PathProgramCache]: Analyzing trace with hash -868561190, now seen corresponding path program 1 times [2023-12-15 20:55:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 20:55:50,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18032469] [2023-12-15 20:55:50,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:50,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 20:55:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 20:55:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 20:55:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 20:55:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 20:55:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 20:55:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 20:55:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 20:55:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 20:55:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 20:55:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 20:55:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 20:55:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 20:55:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 20:55:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 20:55:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:51,947 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 20:55:51,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 20:55:51,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18032469] [2023-12-15 20:55:51,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18032469] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 20:55:51,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559610542] [2023-12-15 20:55:51,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 20:55:51,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:51,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 20:55:51,953 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-15 20:55:51,977 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-15 20:55:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 20:55:52,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-15 20:55:52,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 20:55:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2023-12-15 20:55:52,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 20:55:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2023-12-15 20:55:52,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559610542] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-15 20:55:52,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-15 20:55:52,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 10] total 23 [2023-12-15 20:55:52,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617817667] [2023-12-15 20:55:52,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 20:55:52,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 20:55:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 20:55:52,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 20:55:52,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2023-12-15 20:55:52,599 INFO L87 Difference]: Start difference. First operand 182 states and 229 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 20:55:52,777 INFO L93 Difference]: Finished difference Result 272 states and 345 transitions. [2023-12-15 20:55:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 20:55:52,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 117 [2023-12-15 20:55:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 20:55:52,777 INFO L225 Difference]: With dead ends: 272 [2023-12-15 20:55:52,777 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 20:55:52,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2023-12-15 20:55:52,779 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 40 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 20:55:52,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 291 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 20:55:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 20:55:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 20:55:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 20:55:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 20:55:52,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2023-12-15 20:55:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 20:55:52,782 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 20:55:52,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-15 20:55:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 20:55:52,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 20:55:52,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 20:55:52,793 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-15 20:55:52,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 20:55:52,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 20:55:53,310 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-12-15 20:55:53,311 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-15 20:55:53,311 INFO L899 garLoopResultBuilder]: For program point L52-2(line 52) no Hoare annotation was computed. [2023-12-15 20:55:53,311 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-15 20:55:53,311 INFO L899 garLoopResultBuilder]: For program point L52-4(lines 52 56) no Hoare annotation was computed. [2023-12-15 20:55:53,311 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-15 20:55:53,311 INFO L899 garLoopResultBuilder]: For program point L52-6(lines 35 60) no Hoare annotation was computed. [2023-12-15 20:55:53,311 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 50) no Hoare annotation was computed. [2023-12-15 20:55:53,311 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (or (not (= ~var_1_1~0 0)) (= (mod ~var_1_11~0 4294967296) 0)) [2023-12-15 20:55:53,311 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-12-15 20:55:53,311 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 42) no Hoare annotation was computed. [2023-12-15 20:55:53,311 INFO L895 garLoopResultBuilder]: At program point L86-2(lines 86 92) the Hoare annotation is: (or (not (= ~var_1_1~0 0)) (= (mod ~var_1_11~0 4294967296) 0)) [2023-12-15 20:55:53,311 INFO L899 garLoopResultBuilder]: For program point L86-3(lines 86 92) no Hoare annotation was computed. [2023-12-15 20:55:53,311 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 20:55:53,311 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (or (not (= ~var_1_1~0 0)) (= (mod ~var_1_11~0 4294967296) 0)) [2023-12-15 20:55:53,312 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-15 20:55:53,312 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (or (not (= ~var_1_1~0 0)) (= (mod ~var_1_11~0 4294967296) 0)) [2023-12-15 20:55:53,312 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (or (not (= ~var_1_1~0 0)) (= (mod ~var_1_11~0 4294967296) 0)) [2023-12-15 20:55:53,312 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-15 20:55:53,312 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 49) no Hoare annotation was computed. [2023-12-15 20:55:53,312 INFO L899 garLoopResultBuilder]: For program point L80-1(line 80) no Hoare annotation was computed. [2023-12-15 20:55:53,312 INFO L899 garLoopResultBuilder]: For program point L47-2(lines 44 50) no Hoare annotation was computed. [2023-12-15 20:55:53,312 INFO L899 garLoopResultBuilder]: For program point L80-3(line 80) no Hoare annotation was computed. [2023-12-15 20:55:53,312 INFO L899 garLoopResultBuilder]: For program point L80-5(line 80) no Hoare annotation was computed. [2023-12-15 20:55:53,312 INFO L899 garLoopResultBuilder]: For program point L80-7(line 80) no Hoare annotation was computed. [2023-12-15 20:55:53,312 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 41) no Hoare annotation was computed. [2023-12-15 20:55:53,312 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 36 42) no Hoare annotation was computed. [2023-12-15 20:55:53,312 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-15 20:55:53,312 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (or (not (= ~var_1_1~0 0)) (= (mod ~var_1_11~0 4294967296) 0)) [2023-12-15 20:55:53,313 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 61 74) no Hoare annotation was computed. [2023-12-15 20:55:53,313 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-15 20:55:53,313 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (or (not (= ~var_1_1~0 0)) (= (mod ~var_1_11~0 4294967296) 0)) [2023-12-15 20:55:53,313 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (or (not (= ~var_1_1~0 0)) (= (mod ~var_1_11~0 4294967296) 0)) [2023-12-15 20:55:53,313 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 20:55:53,313 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-15 20:55:53,313 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 60) no Hoare annotation was computed. [2023-12-15 20:55:53,313 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-15 20:55:53,313 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-15 20:55:53,313 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-15 20:55:53,313 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-15 20:55:53,316 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 20:55:53,317 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 20:55:53,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 08:55:53 BoogieIcfgContainer [2023-12-15 20:55:53,329 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 20:55:53,330 INFO L158 Benchmark]: Toolchain (without parser) took 27902.47ms. Allocated memory was 251.7MB in the beginning and 573.6MB in the end (delta: 321.9MB). Free memory was 196.0MB in the beginning and 532.5MB in the end (delta: -336.6MB). Peak memory consumption was 324.0MB. Max. memory is 8.0GB. [2023-12-15 20:55:53,330 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory was 133.4MB in the beginning and 133.3MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 20:55:53,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.54ms. Allocated memory is still 251.7MB. Free memory was 196.0MB in the beginning and 183.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 20:55:53,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.57ms. Allocated memory is still 251.7MB. Free memory was 183.3MB in the beginning and 180.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 20:55:53,335 INFO L158 Benchmark]: Boogie Preprocessor took 51.01ms. Allocated memory is still 251.7MB. Free memory was 180.8MB in the beginning and 177.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 20:55:53,335 INFO L158 Benchmark]: RCFGBuilder took 452.83ms. Allocated memory is still 251.7MB. Free memory was 177.6MB in the beginning and 160.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-15 20:55:53,336 INFO L158 Benchmark]: TraceAbstraction took 26998.54ms. Allocated memory was 251.7MB in the beginning and 573.6MB in the end (delta: 321.9MB). Free memory was 160.3MB in the beginning and 532.5MB in the end (delta: -372.2MB). Peak memory consumption was 288.4MB. Max. memory is 8.0GB. [2023-12-15 20:55:53,337 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.13ms. Allocated memory is still 184.5MB. Free memory was 133.4MB in the beginning and 133.3MB in the end (delta: 125.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.54ms. Allocated memory is still 251.7MB. Free memory was 196.0MB in the beginning and 183.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.57ms. Allocated memory is still 251.7MB. Free memory was 183.3MB in the beginning and 180.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.01ms. Allocated memory is still 251.7MB. Free memory was 180.8MB in the beginning and 177.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 452.83ms. Allocated memory is still 251.7MB. Free memory was 177.6MB in the beginning and 160.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 26998.54ms. Allocated memory was 251.7MB in the beginning and 573.6MB in the end (delta: 321.9MB). Free memory was 160.3MB in the beginning and 532.5MB in the end (delta: -372.2MB). Peak memory consumption was 288.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.9s, OverallIterations: 20, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1147 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1147 mSDsluCounter, 3533 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2454 mSDsCounter, 270 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1809 IncrementalHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 270 mSolverCounterUnsat, 1079 mSDtfsCounter, 1809 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1421 GetRequests, 1238 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=8, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 814 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 239 PreInvPairs, 303 NumberOfFragments, 81 HoareAnnotationTreeSize, 239 FormulaSimplifications, 27693 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FormulaSimplificationsInter, 1463 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 19.9s InterpolantComputationTime, 2110 NumberOfCodeBlocks, 2110 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2430 ConstructedInterpolants, 0 QuantifiedInterpolants, 14217 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1053 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 27 InterpolantComputations, 20 PerfectInterpolantSequences, 6973/7174 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: (!((var_1_1 == 0)) || ((var_1_11 % 4294967296) == 0)) RESULT: Ultimate proved your program to be correct! [2023-12-15 20:55:53,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...