/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:47:37,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:47:37,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 01:47:37,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:47:37,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:47:37,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:47:37,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:47:37,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:47:37,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:47:37,670 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:47:37,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:47:37,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:47:37,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:47:37,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:47:37,672 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:47:37,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:47:37,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:47:37,672 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:47:37,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:47:37,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:47:37,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:47:37,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:47:37,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:47:37,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:47:37,674 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:47:37,674 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:47:37,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:47:37,675 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:47:37,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:47:37,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:47:37,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:47:37,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:47:37,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:47:37,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:47:37,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:47:37,677 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:47:37,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:47:37,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:47:37,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:47:37,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:47:37,678 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:47:37,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:47:37,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:47:37,679 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 01:47:37,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:47:37,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:47:37,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:47:37,905 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:47:37,906 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:47:37,907 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i [2023-12-21 01:47:39,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:47:39,231 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:47:39,231 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-62.i [2023-12-21 01:47:39,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f330dbf/13dba36b258d47d7923dcce3a1843424/FLAG83a81554b [2023-12-21 01:47:39,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f330dbf/13dba36b258d47d7923dcce3a1843424 [2023-12-21 01:47:39,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:47:39,253 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:47:39,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:47:39,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:47:39,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:47:39,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75888bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39, skipping insertion in model container [2023-12-21 01:47:39,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,289 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:47:39,412 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_variablewrapping_wrapper-a_file-62.i[916,929] [2023-12-21 01:47:39,444 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:47:39,455 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:47:39,462 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_variablewrapping_wrapper-a_file-62.i[916,929] [2023-12-21 01:47:39,482 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:47:39,499 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:47:39,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39 WrapperNode [2023-12-21 01:47:39,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:47:39,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:47:39,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:47:39,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:47:39,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,536 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 330 [2023-12-21 01:47:39,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:47:39,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:47:39,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:47:39,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:47:39,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,554 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,565 INFO L175 MemorySlicer]: Split 87 memory accesses to 6 slices as follows [2, 10, 29, 26, 4, 16]. 33 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 3, 1, 2]. The 14 writes are split as follows [0, 1, 4, 6, 1, 2]. [2023-12-21 01:47:39,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:47:39,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:47:39,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:47:39,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:47:39,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39" (1/1) ... [2023-12-21 01:47:39,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:47:39,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:47:39,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 01:47:39,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 01:47:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:47:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:47:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:47:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:47:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:47:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:47:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 01:47:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:47:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:47:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:47:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:47:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:47:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 01:47:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:47:39,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:47:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:47:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:47:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:47:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:47:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:47:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 01:47:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:47:39,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:47:39,731 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:47:39,733 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:47:39,966 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:47:39,991 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:47:39,991 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:47:39,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:47:39 BoogieIcfgContainer [2023-12-21 01:47:39,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:47:39,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:47:39,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:47:40,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:47:40,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:47:39" (1/3) ... [2023-12-21 01:47:40,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be0b7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:47:40, skipping insertion in model container [2023-12-21 01:47:40,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:47:39" (2/3) ... [2023-12-21 01:47:40,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be0b7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:47:40, skipping insertion in model container [2023-12-21 01:47:40,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:47:39" (3/3) ... [2023-12-21 01:47:40,002 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-62.i [2023-12-21 01:47:40,013 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:47:40,013 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:47:40,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:47:40,054 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;@ff27d97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:47:40,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:47:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 01:47:40,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-21 01:47:40,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:40,064 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:40,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:40,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:40,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1944691701, now seen corresponding path program 1 times [2023-12-21 01:47:40,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:40,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603650394] [2023-12-21 01:47:40,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:40,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:40,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:40,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603650394] [2023-12-21 01:47:40,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603650394] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:40,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:40,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:47:40,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762295073] [2023-12-21 01:47:40,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:40,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:47:40,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:40,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:47:40,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:47:40,416 INFO L87 Difference]: Start difference. First operand has 66 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:40,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:40,459 INFO L93 Difference]: Finished difference Result 129 states and 200 transitions. [2023-12-21 01:47:40,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:47:40,461 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2023-12-21 01:47:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:40,468 INFO L225 Difference]: With dead ends: 129 [2023-12-21 01:47:40,468 INFO L226 Difference]: Without dead ends: 64 [2023-12-21 01:47:40,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-21 01:47:40,475 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:40,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:40,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-21 01:47:40,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-21 01:47:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 54 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 01:47:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 92 transitions. [2023-12-21 01:47:40,508 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 92 transitions. Word has length 68 [2023-12-21 01:47:40,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:40,508 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 92 transitions. [2023-12-21 01:47:40,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 92 transitions. [2023-12-21 01:47:40,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-21 01:47:40,513 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:40,513 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:40,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:47:40,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:40,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:40,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2005151749, now seen corresponding path program 1 times [2023-12-21 01:47:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:40,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695188888] [2023-12-21 01:47:40,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:40,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:40,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:40,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695188888] [2023-12-21 01:47:40,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695188888] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:40,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:40,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:40,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116609720] [2023-12-21 01:47:40,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:40,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:40,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:40,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:40,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:40,768 INFO L87 Difference]: Start difference. First operand 64 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:40,822 INFO L93 Difference]: Finished difference Result 135 states and 194 transitions. [2023-12-21 01:47:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:40,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-21 01:47:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:40,824 INFO L225 Difference]: With dead ends: 135 [2023-12-21 01:47:40,824 INFO L226 Difference]: Without dead ends: 72 [2023-12-21 01:47:40,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-21 01:47:40,826 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 12 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:40,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 252 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:40,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-21 01:47:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2023-12-21 01:47:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 01:47:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2023-12-21 01:47:40,833 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 68 [2023-12-21 01:47:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:40,835 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2023-12-21 01:47:40,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2023-12-21 01:47:40,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-21 01:47:40,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:40,840 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:40,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:47:40,841 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:40,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:40,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1947893447, now seen corresponding path program 1 times [2023-12-21 01:47:40,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:40,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594016181] [2023-12-21 01:47:40,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:40,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:40,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594016181] [2023-12-21 01:47:40,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594016181] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:40,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:40,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:40,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709712899] [2023-12-21 01:47:40,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:40,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:40,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:40,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:40,994 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:41,038 INFO L93 Difference]: Finished difference Result 135 states and 192 transitions. [2023-12-21 01:47:41,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:41,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-21 01:47:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:41,042 INFO L225 Difference]: With dead ends: 135 [2023-12-21 01:47:41,042 INFO L226 Difference]: Without dead ends: 70 [2023-12-21 01:47:41,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-21 01:47:41,048 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:41,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 253 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-21 01:47:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2023-12-21 01:47:41,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 01:47:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2023-12-21 01:47:41,062 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 68 [2023-12-21 01:47:41,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:41,063 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2023-12-21 01:47:41,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:41,063 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2023-12-21 01:47:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-21 01:47:41,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:41,064 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:41,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:47:41,065 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:41,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1947833865, now seen corresponding path program 1 times [2023-12-21 01:47:41,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:41,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850262934] [2023-12-21 01:47:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:41,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:41,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850262934] [2023-12-21 01:47:41,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850262934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:41,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:41,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:41,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026558607] [2023-12-21 01:47:41,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:41,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:41,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:41,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:41,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:41,325 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:41,401 INFO L93 Difference]: Finished difference Result 160 states and 226 transitions. [2023-12-21 01:47:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 01:47:41,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 68 [2023-12-21 01:47:41,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:41,403 INFO L225 Difference]: With dead ends: 160 [2023-12-21 01:47:41,404 INFO L226 Difference]: Without dead ends: 93 [2023-12-21 01:47:41,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-21 01:47:41,411 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 90 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:41,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 224 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-21 01:47:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68. [2023-12-21 01:47:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 01:47:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2023-12-21 01:47:41,419 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 68 [2023-12-21 01:47:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:41,420 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2023-12-21 01:47:41,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2023-12-21 01:47:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-21 01:47:41,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:41,420 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:41,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:47:41,421 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:41,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1661631908, now seen corresponding path program 1 times [2023-12-21 01:47:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:41,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424089202] [2023-12-21 01:47:41,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:41,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:41,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424089202] [2023-12-21 01:47:41,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424089202] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:41,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:41,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:41,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169465993] [2023-12-21 01:47:41,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:41,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:41,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:41,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:41,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:41,631 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:41,751 INFO L93 Difference]: Finished difference Result 228 states and 319 transitions. [2023-12-21 01:47:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 01:47:41,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2023-12-21 01:47:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:41,753 INFO L225 Difference]: With dead ends: 228 [2023-12-21 01:47:41,753 INFO L226 Difference]: Without dead ends: 161 [2023-12-21 01:47:41,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:47:41,754 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 199 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:41,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 578 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-21 01:47:41,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 78. [2023-12-21 01:47:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 68 states have internal predecessors, (93), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 01:47:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2023-12-21 01:47:41,771 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 70 [2023-12-21 01:47:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:41,771 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2023-12-21 01:47:41,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2023-12-21 01:47:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 01:47:41,773 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:41,773 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:41,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:47:41,774 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:41,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1362359734, now seen corresponding path program 1 times [2023-12-21 01:47:41,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:41,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694459196] [2023-12-21 01:47:41,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:41,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:42,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:42,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694459196] [2023-12-21 01:47:42,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694459196] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:42,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:42,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:42,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737284208] [2023-12-21 01:47:42,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:42,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:42,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:42,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:42,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:42,065 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:42,137 INFO L93 Difference]: Finished difference Result 211 states and 293 transitions. [2023-12-21 01:47:42,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:47:42,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2023-12-21 01:47:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:42,140 INFO L225 Difference]: With dead ends: 211 [2023-12-21 01:47:42,140 INFO L226 Difference]: Without dead ends: 134 [2023-12-21 01:47:42,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:42,141 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 81 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:42,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 592 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:42,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-21 01:47:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 78. [2023-12-21 01:47:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 01:47:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2023-12-21 01:47:42,152 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 72 [2023-12-21 01:47:42,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:42,152 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2023-12-21 01:47:42,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2023-12-21 01:47:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 01:47:42,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:42,153 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:42,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:47:42,153 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:42,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash -686157583, now seen corresponding path program 1 times [2023-12-21 01:47:42,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:42,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916476343] [2023-12-21 01:47:42,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:42,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:42,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916476343] [2023-12-21 01:47:42,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916476343] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:42,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:42,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:47:42,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301092466] [2023-12-21 01:47:42,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:42,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:47:42,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:42,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:47:42,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:42,272 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:42,312 INFO L93 Difference]: Finished difference Result 171 states and 237 transitions. [2023-12-21 01:47:42,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:47:42,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2023-12-21 01:47:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:42,313 INFO L225 Difference]: With dead ends: 171 [2023-12-21 01:47:42,313 INFO L226 Difference]: Without dead ends: 94 [2023-12-21 01:47:42,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:42,314 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:42,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 319 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-21 01:47:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2023-12-21 01:47:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 01:47:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 111 transitions. [2023-12-21 01:47:42,321 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 111 transitions. Word has length 72 [2023-12-21 01:47:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:42,322 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 111 transitions. [2023-12-21 01:47:42,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2023-12-21 01:47:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 01:47:42,323 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:42,324 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:42,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 01:47:42,324 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:42,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1885600574, now seen corresponding path program 1 times [2023-12-21 01:47:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:42,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717971111] [2023-12-21 01:47:42,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:42,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:42,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:42,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:42,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717971111] [2023-12-21 01:47:42,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717971111] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:42,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:42,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:42,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001430607] [2023-12-21 01:47:42,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:42,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:42,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:42,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:42,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:42,539 INFO L87 Difference]: Start difference. First operand 81 states and 111 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:42,601 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2023-12-21 01:47:42,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:47:42,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2023-12-21 01:47:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:42,602 INFO L225 Difference]: With dead ends: 192 [2023-12-21 01:47:42,602 INFO L226 Difference]: Without dead ends: 112 [2023-12-21 01:47:42,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:42,603 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 73 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:42,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 414 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-21 01:47:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 81. [2023-12-21 01:47:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.323943661971831) internal successors, (94), 71 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 01:47:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2023-12-21 01:47:42,608 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 72 [2023-12-21 01:47:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:42,608 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2023-12-21 01:47:42,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2023-12-21 01:47:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 01:47:42,609 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:42,609 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:42,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 01:47:42,609 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:42,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:42,609 INFO L85 PathProgramCache]: Analyzing trace with hash 772475292, now seen corresponding path program 1 times [2023-12-21 01:47:42,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:42,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211389500] [2023-12-21 01:47:42,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 01:47:42,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:42,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211389500] [2023-12-21 01:47:42,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211389500] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:47:42,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154119965] [2023-12-21 01:47:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:42,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:47:42,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:47:42,982 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:47:42,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 01:47:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:43,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-21 01:47:43,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:47:43,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 53 [2023-12-21 01:47:43,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:47:43,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 42 [2023-12-21 01:47:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 01:47:43,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:47:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:43,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154119965] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 01:47:43,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-21 01:47:43,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 11] total 19 [2023-12-21 01:47:43,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560316247] [2023-12-21 01:47:43,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:43,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:47:43,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:43,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:47:43,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2023-12-21 01:47:43,697 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:44,064 INFO L93 Difference]: Finished difference Result 243 states and 326 transitions. [2023-12-21 01:47:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 01:47:44,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-21 01:47:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:44,065 INFO L225 Difference]: With dead ends: 243 [2023-12-21 01:47:44,065 INFO L226 Difference]: Without dead ends: 163 [2023-12-21 01:47:44,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2023-12-21 01:47:44,066 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 222 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:44,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 830 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-21 01:47:44,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 134. [2023-12-21 01:47:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 122 states have internal predecessors, (159), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 01:47:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 179 transitions. [2023-12-21 01:47:44,070 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 179 transitions. Word has length 74 [2023-12-21 01:47:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:44,070 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 179 transitions. [2023-12-21 01:47:44,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 179 transitions. [2023-12-21 01:47:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 01:47:44,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:44,071 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:44,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-21 01:47:44,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:47:44,277 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:44,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:44,277 INFO L85 PathProgramCache]: Analyzing trace with hash -238641958, now seen corresponding path program 1 times [2023-12-21 01:47:44,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:44,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353368825] [2023-12-21 01:47:44,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:44,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:44,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:44,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353368825] [2023-12-21 01:47:44,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353368825] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:44,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:44,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:44,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066674914] [2023-12-21 01:47:44,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:44,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:44,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:44,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:44,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:44,502 INFO L87 Difference]: Start difference. First operand 134 states and 179 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:44,592 INFO L93 Difference]: Finished difference Result 304 states and 403 transitions. [2023-12-21 01:47:44,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 01:47:44,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-21 01:47:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:44,595 INFO L225 Difference]: With dead ends: 304 [2023-12-21 01:47:44,595 INFO L226 Difference]: Without dead ends: 171 [2023-12-21 01:47:44,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:47:44,596 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 100 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:44,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 450 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-21 01:47:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 130. [2023-12-21 01:47:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 118 states have internal predecessors, (153), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 01:47:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 173 transitions. [2023-12-21 01:47:44,602 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 173 transitions. Word has length 74 [2023-12-21 01:47:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:44,602 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 173 transitions. [2023-12-21 01:47:44,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 173 transitions. [2023-12-21 01:47:44,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 01:47:44,603 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:44,603 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:44,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 01:47:44,604 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:44,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:44,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1195177118, now seen corresponding path program 1 times [2023-12-21 01:47:44,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:44,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499455126] [2023-12-21 01:47:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:44,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:44,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:44,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499455126] [2023-12-21 01:47:44,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499455126] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:44,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:44,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 01:47:44,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457575354] [2023-12-21 01:47:44,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:44,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 01:47:44,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:44,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 01:47:44,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:44,840 INFO L87 Difference]: Start difference. First operand 130 states and 173 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:44,965 INFO L93 Difference]: Finished difference Result 298 states and 394 transitions. [2023-12-21 01:47:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 01:47:44,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2023-12-21 01:47:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:44,967 INFO L225 Difference]: With dead ends: 298 [2023-12-21 01:47:44,967 INFO L226 Difference]: Without dead ends: 169 [2023-12-21 01:47:44,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:47:44,967 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 88 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:44,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 500 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:44,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-12-21 01:47:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 130. [2023-12-21 01:47:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.2991452991452992) internal successors, (152), 118 states have internal predecessors, (152), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 01:47:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 172 transitions. [2023-12-21 01:47:44,972 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 172 transitions. Word has length 74 [2023-12-21 01:47:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:44,972 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 172 transitions. [2023-12-21 01:47:44,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 172 transitions. [2023-12-21 01:47:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 01:47:44,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:44,973 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:44,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 01:47:44,973 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:44,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:44,973 INFO L85 PathProgramCache]: Analyzing trace with hash 184059868, now seen corresponding path program 1 times [2023-12-21 01:47:44,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:44,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837856320] [2023-12-21 01:47:44,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:44,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:45,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:45,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:45,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:45,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:45,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:45,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:45,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 01:47:45,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:45,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837856320] [2023-12-21 01:47:45,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837856320] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:47:45,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567988049] [2023-12-21 01:47:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:45,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:47:45,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:47:45,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:47:45,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 01:47:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:45,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 01:47:45,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:47:45,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-21 01:47:45,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:47:45,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 32 [2023-12-21 01:47:45,746 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 01:47:45,746 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:47:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:45,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567988049] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 01:47:45,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-21 01:47:45,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11] total 21 [2023-12-21 01:47:45,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300095421] [2023-12-21 01:47:45,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:45,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:47:45,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:45,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:47:45,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2023-12-21 01:47:45,923 INFO L87 Difference]: Start difference. First operand 130 states and 172 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:46,230 INFO L93 Difference]: Finished difference Result 298 states and 392 transitions. [2023-12-21 01:47:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 01:47:46,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-21 01:47:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:46,232 INFO L225 Difference]: With dead ends: 298 [2023-12-21 01:47:46,232 INFO L226 Difference]: Without dead ends: 169 [2023-12-21 01:47:46,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2023-12-21 01:47:46,233 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 187 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:46,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 773 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:46,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-12-21 01:47:46,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 126. [2023-12-21 01:47:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 114 states have internal predecessors, (147), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 01:47:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2023-12-21 01:47:46,237 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 74 [2023-12-21 01:47:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:46,238 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2023-12-21 01:47:46,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2023-12-21 01:47:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 01:47:46,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:46,238 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:46,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 01:47:46,445 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,SelfDestructingSolverStorable11 [2023-12-21 01:47:46,445 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:46,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:46,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1960346621, now seen corresponding path program 1 times [2023-12-21 01:47:46,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:46,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646778353] [2023-12-21 01:47:46,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:46,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:46,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:46,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:46,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:46,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:46,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:46,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:46,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:46,535 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:46,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:46,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646778353] [2023-12-21 01:47:46,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646778353] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:46,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:46,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:46,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708857385] [2023-12-21 01:47:46,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:46,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:46,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:46,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:46,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:46,537 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:46,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:46,616 INFO L93 Difference]: Finished difference Result 311 states and 415 transitions. [2023-12-21 01:47:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 01:47:46,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-21 01:47:46,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:46,617 INFO L225 Difference]: With dead ends: 311 [2023-12-21 01:47:46,617 INFO L226 Difference]: Without dead ends: 186 [2023-12-21 01:47:46,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:47:46,618 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 80 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:46,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 406 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-12-21 01:47:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 128. [2023-12-21 01:47:46,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 115 states have (on average 1.2956521739130435) internal successors, (149), 116 states have internal predecessors, (149), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-21 01:47:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 169 transitions. [2023-12-21 01:47:46,625 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 169 transitions. Word has length 74 [2023-12-21 01:47:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:46,626 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 169 transitions. [2023-12-21 01:47:46,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 169 transitions. [2023-12-21 01:47:46,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 01:47:46,626 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:46,626 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:46,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 01:47:46,627 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:46,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:46,627 INFO L85 PathProgramCache]: Analyzing trace with hash -513931126, now seen corresponding path program 1 times [2023-12-21 01:47:46,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:46,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613926037] [2023-12-21 01:47:46,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:46,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:47,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:47,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:47,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:47,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:47,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:47,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:47,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 01:47:47,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:47,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613926037] [2023-12-21 01:47:47,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613926037] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:47:47,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889338328] [2023-12-21 01:47:47,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:47,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:47:47,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:47:47,031 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:47:47,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 01:47:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:47,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 01:47:47,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:47:47,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 01:47:47,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:47:47,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 59 [2023-12-21 01:47:47,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 01:47:47,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 74 [2023-12-21 01:47:47,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 55 [2023-12-21 01:47:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:47,551 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 01:47:47,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889338328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:47,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 01:47:47,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2023-12-21 01:47:47,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51505774] [2023-12-21 01:47:47,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:47,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:47:47,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:47,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:47:47,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-12-21 01:47:47,554 INFO L87 Difference]: Start difference. First operand 128 states and 169 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:47,805 INFO L93 Difference]: Finished difference Result 202 states and 262 transitions. [2023-12-21 01:47:47,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 01:47:47,805 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-21 01:47:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:47,806 INFO L225 Difference]: With dead ends: 202 [2023-12-21 01:47:47,806 INFO L226 Difference]: Without dead ends: 200 [2023-12-21 01:47:47,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2023-12-21 01:47:47,807 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 130 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:47,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 502 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:47:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-21 01:47:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 160. [2023-12-21 01:47:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 136 states have (on average 1.25) internal successors, (170), 138 states have internal predecessors, (170), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 206 transitions. [2023-12-21 01:47:47,815 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 206 transitions. Word has length 74 [2023-12-21 01:47:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:47,815 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 206 transitions. [2023-12-21 01:47:47,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 206 transitions. [2023-12-21 01:47:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 01:47:47,817 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:47,817 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:47,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 01:47:48,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:47:48,026 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:48,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash -513871544, now seen corresponding path program 1 times [2023-12-21 01:47:48,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:48,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149810795] [2023-12-21 01:47:48,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:48,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,140 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:48,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:48,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149810795] [2023-12-21 01:47:48,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149810795] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:48,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:48,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:47:48,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928299819] [2023-12-21 01:47:48,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:48,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:47:48,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:48,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:47:48,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:48,141 INFO L87 Difference]: Start difference. First operand 160 states and 206 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:48,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:48,190 INFO L93 Difference]: Finished difference Result 295 states and 381 transitions. [2023-12-21 01:47:48,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:48,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-21 01:47:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:48,192 INFO L225 Difference]: With dead ends: 295 [2023-12-21 01:47:48,192 INFO L226 Difference]: Without dead ends: 160 [2023-12-21 01:47:48,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:48,194 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:48,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 302 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:48,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-12-21 01:47:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-12-21 01:47:48,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 136 states have (on average 1.2352941176470589) internal successors, (168), 138 states have internal predecessors, (168), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 204 transitions. [2023-12-21 01:47:48,202 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 204 transitions. Word has length 74 [2023-12-21 01:47:48,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:48,203 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 204 transitions. [2023-12-21 01:47:48,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 204 transitions. [2023-12-21 01:47:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-21 01:47:48,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:48,204 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:48,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 01:47:48,204 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:48,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:48,204 INFO L85 PathProgramCache]: Analyzing trace with hash -456613242, now seen corresponding path program 1 times [2023-12-21 01:47:48,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:48,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818430744] [2023-12-21 01:47:48,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:48,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:48,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818430744] [2023-12-21 01:47:48,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818430744] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:48,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:48,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 01:47:48,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710872398] [2023-12-21 01:47:48,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:48,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 01:47:48,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:48,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 01:47:48,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:48,547 INFO L87 Difference]: Start difference. First operand 160 states and 204 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:48,662 INFO L93 Difference]: Finished difference Result 408 states and 520 transitions. [2023-12-21 01:47:48,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 01:47:48,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 74 [2023-12-21 01:47:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:48,663 INFO L225 Difference]: With dead ends: 408 [2023-12-21 01:47:48,663 INFO L226 Difference]: Without dead ends: 273 [2023-12-21 01:47:48,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:47:48,664 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:48,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 377 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-12-21 01:47:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 227. [2023-12-21 01:47:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 203 states have (on average 1.2610837438423645) internal successors, (256), 205 states have internal predecessors, (256), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 292 transitions. [2023-12-21 01:47:48,678 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 292 transitions. Word has length 74 [2023-12-21 01:47:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:48,679 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 292 transitions. [2023-12-21 01:47:48,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 292 transitions. [2023-12-21 01:47:48,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-21 01:47:48,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:48,679 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:48,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 01:47:48,680 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:48,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:48,680 INFO L85 PathProgramCache]: Analyzing trace with hash -445694648, now seen corresponding path program 1 times [2023-12-21 01:47:48,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:48,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293510877] [2023-12-21 01:47:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:48,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:48,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:48,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293510877] [2023-12-21 01:47:48,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293510877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:48,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:48,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:47:48,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899217807] [2023-12-21 01:47:48,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:48,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:47:48,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:48,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:47:48,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:48,765 INFO L87 Difference]: Start difference. First operand 227 states and 292 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:48,859 INFO L93 Difference]: Finished difference Result 590 states and 741 transitions. [2023-12-21 01:47:48,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:47:48,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-21 01:47:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:48,861 INFO L225 Difference]: With dead ends: 590 [2023-12-21 01:47:48,861 INFO L226 Difference]: Without dead ends: 388 [2023-12-21 01:47:48,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:48,861 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 75 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:48,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 270 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-12-21 01:47:48,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 259. [2023-12-21 01:47:48,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 235 states have (on average 1.225531914893617) internal successors, (288), 237 states have internal predecessors, (288), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 324 transitions. [2023-12-21 01:47:48,872 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 324 transitions. Word has length 76 [2023-12-21 01:47:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:48,874 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 324 transitions. [2023-12-21 01:47:48,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 324 transitions. [2023-12-21 01:47:48,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-21 01:47:48,875 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:48,875 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:48,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 01:47:48,875 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:48,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:48,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1821417921, now seen corresponding path program 1 times [2023-12-21 01:47:48,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:48,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249554249] [2023-12-21 01:47:48,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:48,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:49,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:49,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249554249] [2023-12-21 01:47:49,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249554249] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:49,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:49,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:49,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415080710] [2023-12-21 01:47:49,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:49,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:49,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:49,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:49,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:49,053 INFO L87 Difference]: Start difference. First operand 259 states and 324 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:49,157 INFO L93 Difference]: Finished difference Result 620 states and 768 transitions. [2023-12-21 01:47:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 01:47:49,157 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-21 01:47:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:49,158 INFO L225 Difference]: With dead ends: 620 [2023-12-21 01:47:49,158 INFO L226 Difference]: Without dead ends: 386 [2023-12-21 01:47:49,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:47:49,159 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 76 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:49,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 312 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:49,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-12-21 01:47:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 336. [2023-12-21 01:47:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 312 states have (on average 1.2307692307692308) internal successors, (384), 314 states have internal predecessors, (384), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 420 transitions. [2023-12-21 01:47:49,170 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 420 transitions. Word has length 76 [2023-12-21 01:47:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:49,170 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 420 transitions. [2023-12-21 01:47:49,170 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, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 420 transitions. [2023-12-21 01:47:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-21 01:47:49,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:49,171 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:49,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 01:47:49,171 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:49,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:49,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2058710480, now seen corresponding path program 1 times [2023-12-21 01:47:49,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:49,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397653756] [2023-12-21 01:47:49,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:49,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:49,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:49,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397653756] [2023-12-21 01:47:49,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397653756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:49,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:49,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:47:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20080201] [2023-12-21 01:47:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:49,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:47:49,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:49,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:47:49,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:47:49,261 INFO L87 Difference]: Start difference. First operand 336 states and 420 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:49,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:49,308 INFO L93 Difference]: Finished difference Result 569 states and 709 transitions. [2023-12-21 01:47:49,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 01:47:49,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2023-12-21 01:47:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:49,311 INFO L225 Difference]: With dead ends: 569 [2023-12-21 01:47:49,311 INFO L226 Difference]: Without dead ends: 258 [2023-12-21 01:47:49,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-21 01:47:49,312 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 13 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:49,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 194 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-12-21 01:47:49,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2023-12-21 01:47:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 234 states have (on average 1.2094017094017093) internal successors, (283), 236 states have internal predecessors, (283), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 319 transitions. [2023-12-21 01:47:49,324 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 319 transitions. Word has length 76 [2023-12-21 01:47:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:49,324 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 319 transitions. [2023-12-21 01:47:49,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 319 transitions. [2023-12-21 01:47:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-21 01:47:49,325 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:49,325 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:49,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 01:47:49,325 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:49,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:49,325 INFO L85 PathProgramCache]: Analyzing trace with hash 561566617, now seen corresponding path program 1 times [2023-12-21 01:47:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:49,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978872969] [2023-12-21 01:47:49,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:49,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:49,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:49,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978872969] [2023-12-21 01:47:49,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978872969] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:49,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:49,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:49,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382896313] [2023-12-21 01:47:49,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:49,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:49,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:49,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:49,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:49,464 INFO L87 Difference]: Start difference. First operand 258 states and 319 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:49,540 INFO L93 Difference]: Finished difference Result 529 states and 649 transitions. [2023-12-21 01:47:49,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:47:49,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2023-12-21 01:47:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:49,541 INFO L225 Difference]: With dead ends: 529 [2023-12-21 01:47:49,541 INFO L226 Difference]: Without dead ends: 296 [2023-12-21 01:47:49,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:49,542 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:49,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 364 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-12-21 01:47:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 258. [2023-12-21 01:47:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 234 states have (on average 1.2008547008547008) internal successors, (281), 236 states have internal predecessors, (281), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 317 transitions. [2023-12-21 01:47:49,553 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 317 transitions. Word has length 77 [2023-12-21 01:47:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:49,553 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 317 transitions. [2023-12-21 01:47:49,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 317 transitions. [2023-12-21 01:47:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-21 01:47:49,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:49,554 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:49,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 01:47:49,554 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:49,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:49,555 INFO L85 PathProgramCache]: Analyzing trace with hash -39398829, now seen corresponding path program 1 times [2023-12-21 01:47:49,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:49,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148168284] [2023-12-21 01:47:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 01:47:49,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:49,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148168284] [2023-12-21 01:47:49,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148168284] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 01:47:49,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535933602] [2023-12-21 01:47:49,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:49,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:47:49,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:47:49,885 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 01:47:49,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 01:47:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:50,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 01:47:50,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 01:47:50,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-21 01:47:50,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 01:47:50,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-21 01:47:50,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-21 01:47:50,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 01:47:50,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-21 01:47:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 81 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 01:47:50,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 01:47:50,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-21 01:47:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 01:47:50,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535933602] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 01:47:50,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 01:47:50,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-12-21 01:47:50,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588851644] [2023-12-21 01:47:50,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 01:47:50,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-21 01:47:50,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:50,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-21 01:47:50,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2023-12-21 01:47:50,410 INFO L87 Difference]: Start difference. First operand 258 states and 317 transitions. Second operand has 21 states, 18 states have (on average 4.833333333333333) internal successors, (87), 21 states have internal predecessors, (87), 11 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) [2023-12-21 01:47:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:50,638 INFO L93 Difference]: Finished difference Result 477 states and 587 transitions. [2023-12-21 01:47:50,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 01:47:50,639 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 4.833333333333333) internal successors, (87), 21 states have internal predecessors, (87), 11 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) Word has length 77 [2023-12-21 01:47:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:50,641 INFO L225 Difference]: With dead ends: 477 [2023-12-21 01:47:50,641 INFO L226 Difference]: Without dead ends: 244 [2023-12-21 01:47:50,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2023-12-21 01:47:50,643 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 122 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:50,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 257 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:47:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-21 01:47:50,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 234. [2023-12-21 01:47:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 208 states have (on average 1.1971153846153846) internal successors, (249), 210 states have internal predecessors, (249), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 01:47:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 285 transitions. [2023-12-21 01:47:50,653 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 285 transitions. Word has length 77 [2023-12-21 01:47:50,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:50,654 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 285 transitions. [2023-12-21 01:47:50,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 4.833333333333333) internal successors, (87), 21 states have internal predecessors, (87), 11 states have call successors, (22), 4 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) [2023-12-21 01:47:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 285 transitions. [2023-12-21 01:47:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-21 01:47:50,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:50,655 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:50,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 01:47:50,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 01:47:50,862 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:50,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2094073389, now seen corresponding path program 1 times [2023-12-21 01:47:50,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:50,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441967808] [2023-12-21 01:47:50,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:51,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:51,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441967808] [2023-12-21 01:47:51,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441967808] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:51,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:51,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-21 01:47:51,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671439127] [2023-12-21 01:47:51,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:51,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 01:47:51,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:51,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 01:47:51,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:47:51,289 INFO L87 Difference]: Start difference. First operand 234 states and 285 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:51,503 INFO L93 Difference]: Finished difference Result 828 states and 997 transitions. [2023-12-21 01:47:51,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 01:47:51,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-21 01:47:51,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:51,518 INFO L225 Difference]: With dead ends: 828 [2023-12-21 01:47:51,518 INFO L226 Difference]: Without dead ends: 623 [2023-12-21 01:47:51,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2023-12-21 01:47:51,519 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 245 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:51,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 603 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-12-21 01:47:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 384. [2023-12-21 01:47:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 345 states have (on average 1.182608695652174) internal successors, (408), 349 states have internal predecessors, (408), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-21 01:47:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 460 transitions. [2023-12-21 01:47:51,536 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 460 transitions. Word has length 78 [2023-12-21 01:47:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:51,536 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 460 transitions. [2023-12-21 01:47:51,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 460 transitions. [2023-12-21 01:47:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-21 01:47:51,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:51,537 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:51,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-21 01:47:51,538 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:51,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:51,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1875218671, now seen corresponding path program 1 times [2023-12-21 01:47:51,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:51,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786490276] [2023-12-21 01:47:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:51,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:51,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:51,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786490276] [2023-12-21 01:47:51,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786490276] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:51,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:51,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:47:51,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551856801] [2023-12-21 01:47:51,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:51,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:47:51,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:51,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:47:51,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:51,597 INFO L87 Difference]: Start difference. First operand 384 states and 460 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:51,690 INFO L93 Difference]: Finished difference Result 933 states and 1109 transitions. [2023-12-21 01:47:51,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:47:51,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 78 [2023-12-21 01:47:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:51,693 INFO L225 Difference]: With dead ends: 933 [2023-12-21 01:47:51,693 INFO L226 Difference]: Without dead ends: 582 [2023-12-21 01:47:51,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:51,694 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 62 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:51,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 472 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2023-12-21 01:47:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 355. [2023-12-21 01:47:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 318 states have (on average 1.169811320754717) internal successors, (372), 321 states have internal predecessors, (372), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-21 01:47:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 420 transitions. [2023-12-21 01:47:51,711 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 420 transitions. Word has length 78 [2023-12-21 01:47:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:51,711 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 420 transitions. [2023-12-21 01:47:51,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 420 transitions. [2023-12-21 01:47:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-21 01:47:51,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:51,712 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:51,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-21 01:47:51,712 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:51,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:51,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1365462434, now seen corresponding path program 1 times [2023-12-21 01:47:51,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:51,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119156590] [2023-12-21 01:47:51,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:51,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:51,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:51,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119156590] [2023-12-21 01:47:51,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119156590] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:51,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:51,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:47:51,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474414615] [2023-12-21 01:47:51,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:51,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:47:51,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:51,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:47:51,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:47:51,791 INFO L87 Difference]: Start difference. First operand 355 states and 420 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:51,883 INFO L93 Difference]: Finished difference Result 681 states and 806 transitions. [2023-12-21 01:47:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:47:51,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2023-12-21 01:47:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:51,885 INFO L225 Difference]: With dead ends: 681 [2023-12-21 01:47:51,885 INFO L226 Difference]: Without dead ends: 359 [2023-12-21 01:47:51,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:51,886 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 73 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:51,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 170 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:47:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-21 01:47:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 308. [2023-12-21 01:47:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 273 states have (on average 1.1355311355311355) internal successors, (310), 275 states have internal predecessors, (310), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-21 01:47:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 354 transitions. [2023-12-21 01:47:51,901 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 354 transitions. Word has length 79 [2023-12-21 01:47:51,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:51,901 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 354 transitions. [2023-12-21 01:47:51,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2023-12-21 01:47:51,901 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 354 transitions. [2023-12-21 01:47:51,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-21 01:47:51,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:51,902 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:51,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-21 01:47:51,902 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:51,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash 847893285, now seen corresponding path program 1 times [2023-12-21 01:47:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:51,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118692606] [2023-12-21 01:47:51,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:52,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:52,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118692606] [2023-12-21 01:47:52,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118692606] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:52,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:52,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:52,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889343535] [2023-12-21 01:47:52,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:52,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:52,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:52,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:52,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:52,048 INFO L87 Difference]: Start difference. First operand 308 states and 354 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:52,110 INFO L93 Difference]: Finished difference Result 703 states and 808 transitions. [2023-12-21 01:47:52,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:47:52,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2023-12-21 01:47:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:52,111 INFO L225 Difference]: With dead ends: 703 [2023-12-21 01:47:52,111 INFO L226 Difference]: Without dead ends: 428 [2023-12-21 01:47:52,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:52,115 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 81 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:52,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 353 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:52,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-12-21 01:47:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 286. [2023-12-21 01:47:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 251 states have (on average 1.1235059760956174) internal successors, (282), 253 states have internal predecessors, (282), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-21 01:47:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 326 transitions. [2023-12-21 01:47:52,130 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 326 transitions. Word has length 81 [2023-12-21 01:47:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:52,130 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 326 transitions. [2023-12-21 01:47:52,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 326 transitions. [2023-12-21 01:47:52,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-21 01:47:52,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:52,131 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:52,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-21 01:47:52,131 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:52,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash 641241392, now seen corresponding path program 1 times [2023-12-21 01:47:52,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:52,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879194732] [2023-12-21 01:47:52,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:52,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:47:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:47:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-21 01:47:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-21 01:47:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-21 01:47:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-21 01:47:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-21 01:47:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-21 01:47:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:47:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-21 01:47:52,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:47:52,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879194732] [2023-12-21 01:47:52,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879194732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:47:52,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:47:52,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:47:52,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164506378] [2023-12-21 01:47:52,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:47:52,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:47:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:47:52,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:47:52,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:47:52,278 INFO L87 Difference]: Start difference. First operand 286 states and 326 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:47:52,347 INFO L93 Difference]: Finished difference Result 601 states and 686 transitions. [2023-12-21 01:47:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:47:52,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2023-12-21 01:47:52,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:47:52,349 INFO L225 Difference]: With dead ends: 601 [2023-12-21 01:47:52,349 INFO L226 Difference]: Without dead ends: 348 [2023-12-21 01:47:52,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:47:52,353 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 53 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:47:52,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 343 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:47:52,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-12-21 01:47:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 286. [2023-12-21 01:47:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 251 states have (on average 1.1075697211155378) internal successors, (278), 253 states have internal predecessors, (278), 22 states have call successors, (22), 12 states have call predecessors, (22), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-21 01:47:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 322 transitions. [2023-12-21 01:47:52,368 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 322 transitions. Word has length 81 [2023-12-21 01:47:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:47:52,368 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 322 transitions. [2023-12-21 01:47:52,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 01:47:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 322 transitions. [2023-12-21 01:47:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-21 01:47:52,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:47:52,369 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:47:52,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-21 01:47:52,369 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:47:52,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:47:52,369 INFO L85 PathProgramCache]: Analyzing trace with hash -10337099, now seen corresponding path program 1 times [2023-12-21 01:47:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:47:52,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544827003] [2023-12-21 01:47:52,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:47:52,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:47:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-21 02:02:00,374 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,416 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 02:02:00,457 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,472 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,488 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,504 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,519 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,533 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,547 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,562 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,576 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,596 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,603 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,604 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,610 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,611 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,611 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,611 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,611 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,611 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,611 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,611 WARN L250 erpolLogProxyWrapper]: Unable to check validity of interpolant: cancelled [2023-12-21 02:02:00,614 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:02:00,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-21 02:02:00,614 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 84 with TraceHistMax 8,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 82 interpolants. [2023-12-21 02:02:00,617 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:02:00,619 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:02:00,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:02:00 BoogieIcfgContainer [2023-12-21 02:02:00,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:02:00,620 INFO L158 Benchmark]: Toolchain (without parser) took 861367.60ms. Allocated memory was 291.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 242.2MB in the beginning and 451.5MB in the end (delta: -209.2MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2023-12-21 02:02:00,620 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:02:00,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.31ms. Allocated memory is still 291.5MB. Free memory was 241.7MB in the beginning and 228.0MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-21 02:02:00,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.50ms. Allocated memory is still 291.5MB. Free memory was 228.0MB in the beginning and 224.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 02:02:00,621 INFO L158 Benchmark]: Boogie Preprocessor took 65.04ms. Allocated memory is still 291.5MB. Free memory was 224.9MB in the beginning and 221.2MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 02:02:00,621 INFO L158 Benchmark]: RCFGBuilder took 391.72ms. Allocated memory is still 291.5MB. Free memory was 221.2MB in the beginning and 195.5MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-21 02:02:00,621 INFO L158 Benchmark]: TraceAbstraction took 860624.47ms. Allocated memory was 291.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 195.0MB in the beginning and 451.5MB in the end (delta: -256.4MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-12-21 02:02:00,622 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.31ms. Allocated memory is still 291.5MB. Free memory was 241.7MB in the beginning and 228.0MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.50ms. Allocated memory is still 291.5MB. Free memory was 228.0MB in the beginning and 224.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.04ms. Allocated memory is still 291.5MB. Free memory was 224.9MB in the beginning and 221.2MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 391.72ms. Allocated memory is still 291.5MB. Free memory was 221.2MB in the beginning and 195.5MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 860624.47ms. Allocated memory was 291.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 195.0MB in the beginning and 451.5MB in the end (delta: -256.4MB). Peak memory consumption was 1.6GB. 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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 84 with TraceHistMax 8,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while NestedInterpolantsBuilder was constructing predicates for 82 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 860.6s, OverallIterations: 27, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2303 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2292 mSDsluCounter, 10198 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7682 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2760 IncrementalHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 2516 mSDtfsCounter, 2760 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1206 GetRequests, 981 SyntacticMatches, 3 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=22, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 1460 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2228 NumberOfCodeBlocks, 2228 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2420 ConstructedInterpolants, 0 QuantifiedInterpolants, 9180 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1166 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 33 InterpolantComputations, 25 PerfectInterpolantSequences, 3600/3696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown