/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/list-simple/sll2n_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:43:40,695 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:43:40,741 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-16 04:43:40,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:43:40,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:43:40,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:43:40,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:43:40,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:43:40,764 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:43:40,767 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:43:40,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:43:40,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:43:40,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:43:40,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:43:40,769 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:43:40,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:43:40,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:43:40,769 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:43:40,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:43:40,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:43:40,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:43:40,771 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:43:40,771 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:43:40,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:43:40,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:43:40,771 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:43:40,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:43:40,772 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:43:40,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:43:40,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:43:40,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:43:40,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:43:40,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:43:40,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:43:40,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:43:40,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:43:40,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:43:40,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:43:40,774 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:43:40,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:43:40,774 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:43:40,774 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:43:40,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:43:40,774 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-16 04:43:40,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:43:40,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:43:40,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:43:40,990 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:43:40,991 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:43:40,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_insert_equal.i [2023-12-16 04:43:41,988 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:43:42,168 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:43:42,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_equal.i [2023-12-16 04:43:42,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b716915/b8dd89f3daf847c68019da781cb9f422/FLAG606f2b8f6 [2023-12-16 04:43:42,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b716915/b8dd89f3daf847c68019da781cb9f422 [2023-12-16 04:43:42,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:43:42,195 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:43:42,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:43:42,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:43:42,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:43:42,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba12e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42, skipping insertion in model container [2023-12-16 04:43:42,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,230 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:43:42,458 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_equal.i[24301,24314] [2023-12-16 04:43:42,461 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:43:42,467 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:43:42,502 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_equal.i[24301,24314] [2023-12-16 04:43:42,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:43:42,521 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:43:42,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42 WrapperNode [2023-12-16 04:43:42,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:43:42,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:43:42,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:43:42,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:43:42,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,558 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2023-12-16 04:43:42,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:43:42,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:43:42,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:43:42,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:43:42,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,592 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2023-12-16 04:43:42,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:43:42,606 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:43:42,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:43:42,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:43:42,607 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42" (1/1) ... [2023-12-16 04:43:42,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:43:42,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:42,630 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-16 04:43:42,659 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-16 04:43:42,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:43:42,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:43:42,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:43:42,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:43:42,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:43:42,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:43:42,668 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-16 04:43:42,670 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-16 04:43:42,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 04:43:42,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:43:42,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 04:43:42,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 04:43:42,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 04:43:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-16 04:43:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 04:43:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 04:43:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-16 04:43:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 04:43:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 04:43:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 04:43:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-16 04:43:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:43:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:43:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:43:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:43:42,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:43:42,784 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:43:42,786 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:43:42,919 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:43:42,960 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:43:42,960 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-16 04:43:42,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:43:42 BoogieIcfgContainer [2023-12-16 04:43:42,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:43:42,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:43:42,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:43:42,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:43:42,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:43:42" (1/3) ... [2023-12-16 04:43:42,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70db3142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:43:42, skipping insertion in model container [2023-12-16 04:43:42,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:43:42" (2/3) ... [2023-12-16 04:43:42,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70db3142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:43:42, skipping insertion in model container [2023-12-16 04:43:42,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:43:42" (3/3) ... [2023-12-16 04:43:42,969 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2023-12-16 04:43:43,002 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:43:43,003 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:43:43,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:43:43,041 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;@67742879, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:43:43,041 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:43:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 04:43:43,048 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:43,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:43,049 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:43,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:43,053 INFO L85 PathProgramCache]: Analyzing trace with hash -245179890, now seen corresponding path program 1 times [2023-12-16 04:43:43,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:43,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953997880] [2023-12-16 04:43:43,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:43,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:43,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 04:43:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:43:43,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:43,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953997880] [2023-12-16 04:43:43,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953997880] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:43:43,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:43:43,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:43:43,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748109423] [2023-12-16 04:43:43,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:43:43,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:43:43,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:43,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:43:43,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:43:43,282 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 19 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:43:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:43,328 INFO L93 Difference]: Finished difference Result 42 states and 63 transitions. [2023-12-16 04:43:43,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:43:43,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-16 04:43:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:43,335 INFO L225 Difference]: With dead ends: 42 [2023-12-16 04:43:43,335 INFO L226 Difference]: Without dead ends: 18 [2023-12-16 04:43:43,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:43:43,340 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:43,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-16 04:43:43,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-16 04:43:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2023-12-16 04:43:43,365 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 14 [2023-12-16 04:43:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:43,365 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2023-12-16 04:43:43,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:43:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2023-12-16 04:43:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-16 04:43:43,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:43,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:43,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:43:43,368 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:43,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:43,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1987527562, now seen corresponding path program 1 times [2023-12-16 04:43:43,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:43,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487365849] [2023-12-16 04:43:43,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:43,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 04:43:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:43:43,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:43,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487365849] [2023-12-16 04:43:43,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487365849] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:43:43,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:43:43,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:43:43,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271202758] [2023-12-16 04:43:43,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:43:43,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:43:43,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:43,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:43:43,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:43:43,552 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:43:43,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:43,584 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2023-12-16 04:43:43,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:43:43,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-16 04:43:43,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:43,585 INFO L225 Difference]: With dead ends: 35 [2023-12-16 04:43:43,585 INFO L226 Difference]: Without dead ends: 21 [2023-12-16 04:43:43,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:43:43,586 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:43,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-16 04:43:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-12-16 04:43:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-12-16 04:43:43,590 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2023-12-16 04:43:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:43,591 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-12-16 04:43:43,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 04:43:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-12-16 04:43:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 04:43:43,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:43,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:43,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:43:43,592 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:43,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:43,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1535308516, now seen corresponding path program 1 times [2023-12-16 04:43:43,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:43,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662516406] [2023-12-16 04:43:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:43,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:43,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:43:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:43,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 04:43:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:43:43,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:43,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662516406] [2023-12-16 04:43:43,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662516406] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:43,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865437950] [2023-12-16 04:43:43,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:43,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:43,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:43,810 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-16 04:43:43,850 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-16 04:43:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:43,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 04:43:43,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:43:43,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:43,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:43:43,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865437950] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:43:43,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:43:43,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-12-16 04:43:43,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620482960] [2023-12-16 04:43:43,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:43,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:43:43,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:43,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:43:43,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:43:43,995 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 04:43:44,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:44,034 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2023-12-16 04:43:44,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:43:44,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2023-12-16 04:43:44,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:44,035 INFO L225 Difference]: With dead ends: 36 [2023-12-16 04:43:44,035 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 04:43:44,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:43:44,036 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:44,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 04:43:44,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-16 04:43:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:43:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-16 04:43:44,041 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 20 [2023-12-16 04:43:44,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:44,041 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-16 04:43:44,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 04:43:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-16 04:43:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 04:43:44,043 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:44,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:44,051 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-16 04:43:44,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:44,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:44,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:44,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1788207406, now seen corresponding path program 2 times [2023-12-16 04:43:44,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:44,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589179118] [2023-12-16 04:43:44,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:44,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:44,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:43:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:44,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:43:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:44,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 04:43:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 04:43:44,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:44,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589179118] [2023-12-16 04:43:44,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589179118] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:43:44,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:43:44,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:43:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296321811] [2023-12-16 04:43:44,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:43:44,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:43:44,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:44,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:43:44,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:43:44,364 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:44,395 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2023-12-16 04:43:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:43:44,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2023-12-16 04:43:44,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:44,397 INFO L225 Difference]: With dead ends: 31 [2023-12-16 04:43:44,397 INFO L226 Difference]: Without dead ends: 25 [2023-12-16 04:43:44,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:43:44,402 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 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-16 04:43:44,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:43:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-16 04:43:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-12-16 04:43:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:43:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-12-16 04:43:44,411 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 26 [2023-12-16 04:43:44,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:44,411 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-12-16 04:43:44,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 04:43:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-12-16 04:43:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 04:43:44,413 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:44,413 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:44,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:43:44,413 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:44,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1790054448, now seen corresponding path program 1 times [2023-12-16 04:43:44,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:44,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344734918] [2023-12-16 04:43:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:43:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:44,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:43:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:44,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 04:43:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 04:43:44,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:44,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344734918] [2023-12-16 04:43:44,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344734918] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:43:44,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:43:44,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:43:44,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553302137] [2023-12-16 04:43:44,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:43:44,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:43:44,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:44,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:43:44,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:43:44,767 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:44,863 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2023-12-16 04:43:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:43:44,865 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-12-16 04:43:44,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:44,866 INFO L225 Difference]: With dead ends: 37 [2023-12-16 04:43:44,866 INFO L226 Difference]: Without dead ends: 34 [2023-12-16 04:43:44,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:43:44,867 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:44,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 110 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:43:44,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-16 04:43:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2023-12-16 04:43:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:43:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-12-16 04:43:44,877 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 26 [2023-12-16 04:43:44,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:44,877 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-12-16 04:43:44,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:44,878 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-12-16 04:43:44,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-16 04:43:44,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:44,878 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:44,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:43:44,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:44,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:44,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1790056122, now seen corresponding path program 1 times [2023-12-16 04:43:44,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:44,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849710645] [2023-12-16 04:43:44,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:44,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:45,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:43:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:45,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:43:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:45,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 04:43:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 04:43:45,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:45,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849710645] [2023-12-16 04:43:45,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849710645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:43:45,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:43:45,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:43:45,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837216981] [2023-12-16 04:43:45,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:43:45,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:43:45,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:45,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:43:45,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:43:45,441 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:43:45,614 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2023-12-16 04:43:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:43:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-12-16 04:43:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:43:45,616 INFO L225 Difference]: With dead ends: 29 [2023-12-16 04:43:45,616 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 04:43:45,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-12-16 04:43:45,617 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:43:45,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 82 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:43:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 04:43:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-16 04:43:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:43:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-12-16 04:43:45,623 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 26 [2023-12-16 04:43:45,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:43:45,623 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-12-16 04:43:45,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:43:45,624 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-12-16 04:43:45,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 04:43:45,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:43:45,624 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:43:45,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:43:45,624 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:43:45,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:43:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1086442489, now seen corresponding path program 1 times [2023-12-16 04:43:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:43:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331705853] [2023-12-16 04:43:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:43:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:45,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:43:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:45,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:43:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:45,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 04:43:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 04:43:45,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:43:45,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331705853] [2023-12-16 04:43:45,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331705853] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:43:45,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265735821] [2023-12-16 04:43:45,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:43:45,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:43:45,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:43:45,819 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-16 04:43:45,838 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-16 04:43:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:43:45,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 04:43:45,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:43:46,032 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 16 treesize of output 8 [2023-12-16 04:43:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:43:46,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:43:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 04:43:46,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265735821] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:43:46,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 04:43:46,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 10 [2023-12-16 04:43:46,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617032586] [2023-12-16 04:43:46,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 04:43:46,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:43:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:43:46,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:43:46,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:43:46,067 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 04:43:50,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:43:54,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:43:58,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:44:02,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:44:06,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:44:10,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:44:14,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 04:44:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:44:14,226 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-12-16 04:44:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 04:44:14,227 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2023-12-16 04:44:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:44:14,227 INFO L225 Difference]: With dead ends: 42 [2023-12-16 04:44:14,227 INFO L226 Difference]: Without dead ends: 39 [2023-12-16 04:44:14,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-12-16 04:44:14,228 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:44:14,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 139 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 7 Unknown, 0 Unchecked, 28.1s Time] [2023-12-16 04:44:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-16 04:44:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2023-12-16 04:44:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:44:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-12-16 04:44:14,232 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 27 [2023-12-16 04:44:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:44:14,232 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-12-16 04:44:14,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 04:44:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-12-16 04:44:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 04:44:14,232 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:44:14,232 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:44:14,247 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-16 04:44:14,438 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,SelfDestructingSolverStorable6 [2023-12-16 04:44:14,438 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:44:14,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:44:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1086444163, now seen corresponding path program 1 times [2023-12-16 04:44:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:44:14,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812469924] [2023-12-16 04:44:14,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:44:14,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:44:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:15,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:44:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:15,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:44:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:15,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 04:44:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 04:44:15,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:44:15,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812469924] [2023-12-16 04:44:15,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812469924] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:44:15,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422999927] [2023-12-16 04:44:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:44:15,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:44:15,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:44:15,304 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-16 04:44:15,306 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-16 04:44:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:15,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 85 conjunts are in the unsatisfiable core [2023-12-16 04:44:15,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:44:15,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-16 04:44:15,600 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 11 treesize of output 7 [2023-12-16 04:44:15,647 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-16 04:44:15,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2023-12-16 04:44:15,743 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 11 treesize of output 3 [2023-12-16 04:44:15,895 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 04:44:15,895 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 1 case distinctions, treesize of input 20 treesize of output 23 [2023-12-16 04:44:15,926 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-16 04:44:15,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 15 [2023-12-16 04:44:16,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-12-16 04:44:16,198 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 27 treesize of output 15 [2023-12-16 04:44:16,205 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 16 treesize of output 11 [2023-12-16 04:44:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:44:16,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:44:16,282 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_810) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-12-16 04:44:16,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422999927] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:44:16,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:44:16,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2023-12-16 04:44:16,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197730118] [2023-12-16 04:44:16,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:44:16,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-16 04:44:16,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:44:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-16 04:44:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1005, Unknown=28, NotChecked=64, Total=1190 [2023-12-16 04:44:16,527 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 30 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 04:44:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:44:16,942 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-12-16 04:44:16,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 04:44:16,942 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2023-12-16 04:44:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:44:16,943 INFO L225 Difference]: With dead ends: 38 [2023-12-16 04:44:16,943 INFO L226 Difference]: Without dead ends: 36 [2023-12-16 04:44:16,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=1561, Unknown=28, NotChecked=80, Total=1806 [2023-12-16 04:44:16,944 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:44:16,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 208 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:44:16,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-16 04:44:16,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2023-12-16 04:44:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:44:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2023-12-16 04:44:16,948 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 27 [2023-12-16 04:44:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:44:16,948 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2023-12-16 04:44:16,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 04:44:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2023-12-16 04:44:16,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 04:44:16,948 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:44:16,948 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:44:16,957 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-16 04:44:17,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:44:17,155 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:44:17,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:44:17,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2037919669, now seen corresponding path program 1 times [2023-12-16 04:44:17,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:44:17,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729264619] [2023-12-16 04:44:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:44:17,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:44:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:17,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:44:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:17,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:44:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:17,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 04:44:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-16 04:44:17,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:44:17,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729264619] [2023-12-16 04:44:17,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729264619] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:44:17,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221612970] [2023-12-16 04:44:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:44:17,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:44:17,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:44:17,287 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-16 04:44:17,291 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-16 04:44:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:17,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 04:44:17,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:44:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 04:44:17,448 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:44:17,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221612970] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:44:17,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:44:17,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-12-16 04:44:17,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225083613] [2023-12-16 04:44:17,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:44:17,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:44:17,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:44:17,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:44:17,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:44:17,450 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:44:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:44:17,472 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2023-12-16 04:44:17,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:44:17,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-12-16 04:44:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:44:17,473 INFO L225 Difference]: With dead ends: 41 [2023-12-16 04:44:17,473 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 04:44:17,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:44:17,474 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:44:17,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 32 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:44:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 04:44:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-12-16 04:44:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:44:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-12-16 04:44:17,478 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 28 [2023-12-16 04:44:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:44:17,478 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-12-16 04:44:17,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:44:17,478 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-12-16 04:44:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 04:44:17,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:44:17,479 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:44:17,486 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-16 04:44:17,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:44:17,684 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:44:17,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:44:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash 806568216, now seen corresponding path program 2 times [2023-12-16 04:44:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:44:17,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558624064] [2023-12-16 04:44:17,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:44:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:44:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:17,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:44:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:17,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:44:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:17,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 04:44:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 04:44:17,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:44:17,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558624064] [2023-12-16 04:44:17,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558624064] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:44:17,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794220249] [2023-12-16 04:44:17,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:44:17,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:44:17,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:44:17,825 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:44:17,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 04:44:18,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:44:18,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:44:18,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 04:44:18,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:44:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 04:44:18,033 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:44:18,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794220249] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:44:18,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:44:18,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-12-16 04:44:18,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602995887] [2023-12-16 04:44:18,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:44:18,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:44:18,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:44:18,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:44:18,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:44:18,034 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:44:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:44:18,060 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2023-12-16 04:44:18,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:44:18,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-12-16 04:44:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:44:18,060 INFO L225 Difference]: With dead ends: 40 [2023-12-16 04:44:18,060 INFO L226 Difference]: Without dead ends: 28 [2023-12-16 04:44:18,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:44:18,061 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 41 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-16 04:44:18,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 41 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:44:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-16 04:44:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-16 04:44:18,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:44:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-12-16 04:44:18,065 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 28 [2023-12-16 04:44:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:44:18,065 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-12-16 04:44:18,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:44:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-12-16 04:44:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 04:44:18,066 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:44:18,066 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:44:18,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 04:44:18,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-16 04:44:18,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:44:18,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:44:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash 395820500, now seen corresponding path program 1 times [2023-12-16 04:44:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:44:18,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892904089] [2023-12-16 04:44:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:44:18,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:44:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:44:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:18,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:44:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:19,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 04:44:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:44:19,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:44:19,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892904089] [2023-12-16 04:44:19,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892904089] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:44:19,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799324326] [2023-12-16 04:44:19,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:44:19,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:44:19,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:44:19,116 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:44:19,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 04:44:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:19,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-16 04:44:19,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:44:19,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-16 04:44:19,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-16 04:44:19,396 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 18 treesize of output 4 [2023-12-16 04:44:19,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2023-12-16 04:44:19,453 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-16 04:44:19,454 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 1 case distinctions, treesize of input 27 treesize of output 30 [2023-12-16 04:44:19,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 4 [2023-12-16 04:44:19,488 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-16 04:44:19,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-16 04:44:19,653 INFO L349 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2023-12-16 04:44:19,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 55 [2023-12-16 04:44:19,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:44:19,711 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 86 treesize of output 70 [2023-12-16 04:44:19,730 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2023-12-16 04:44:19,730 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 61 [2023-12-16 04:44:19,735 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 22 treesize of output 14 [2023-12-16 04:44:19,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 9 [2023-12-16 04:44:19,753 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 20 treesize of output 8 [2023-12-16 04:44:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:44:19,758 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:44:20,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799324326] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:44:20,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:44:20,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2023-12-16 04:44:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574936439] [2023-12-16 04:44:20,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:44:20,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-16 04:44:20,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:44:20,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-16 04:44:20,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1150, Unknown=9, NotChecked=0, Total=1260 [2023-12-16 04:44:20,123 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 32 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-16 04:44:20,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:44:20,474 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2023-12-16 04:44:20,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 04:44:20,474 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-12-16 04:44:20,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:44:20,476 INFO L225 Difference]: With dead ends: 39 [2023-12-16 04:44:20,476 INFO L226 Difference]: Without dead ends: 36 [2023-12-16 04:44:20,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=150, Invalid=1647, Unknown=9, NotChecked=0, Total=1806 [2023-12-16 04:44:20,477 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:44:20,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 262 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:44:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-16 04:44:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2023-12-16 04:44:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 04:44:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-12-16 04:44:20,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 29 [2023-12-16 04:44:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:44:20,482 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-12-16 04:44:20,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-16 04:44:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-12-16 04:44:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 04:44:20,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:44:20,482 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:44:20,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 04:44:20,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:44:20,691 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:44:20,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:44:20,692 INFO L85 PathProgramCache]: Analyzing trace with hash 395822174, now seen corresponding path program 1 times [2023-12-16 04:44:20,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:44:20,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605503351] [2023-12-16 04:44:20,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:44:20,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:44:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:21,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:44:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:21,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:44:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:21,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 04:44:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-16 04:44:21,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:44:21,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605503351] [2023-12-16 04:44:21,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605503351] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:44:21,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532443072] [2023-12-16 04:44:21,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:44:21,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:44:21,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:44:21,467 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:44:21,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-16 04:44:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:44:21,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 95 conjunts are in the unsatisfiable core [2023-12-16 04:44:21,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:44:21,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-16 04:44:21,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2023-12-16 04:44:21,886 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 11 treesize of output 7 [2023-12-16 04:44:21,910 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-16 04:44:21,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 15 [2023-12-16 04:44:22,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-16 04:44:22,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-16 04:44:22,069 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 24 treesize of output 11 [2023-12-16 04:44:22,152 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 197 treesize of output 149 [2023-12-16 04:44:22,161 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-16 04:44:22,161 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 122 [2023-12-16 04:44:22,164 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 125 treesize of output 89 [2023-12-16 04:44:22,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 17 [2023-12-16 04:44:22,179 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 30 treesize of output 13 [2023-12-16 04:44:22,218 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 33 treesize of output 15 [2023-12-16 04:44:22,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2023-12-16 04:44:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 04:44:22,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:44:22,391 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1472 Int) (v_ArrVal_1470 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4) v_ArrVal_1472)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1469) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1470) .cse0) .cse1))))) is different from false [2023-12-16 04:44:22,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:44:22,400 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 78 [2023-12-16 04:44:22,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:44:22,408 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 150 treesize of output 149 [2023-12-16 04:44:22,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 66 treesize of output 58 [2023-12-16 04:44:22,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:44:22,422 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 108 [2023-12-16 04:44:22,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:44:22,433 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 200 treesize of output 185 [2023-12-16 04:44:22,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 39 treesize of output 31 [2023-12-16 04:44:23,120 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse4 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse15))) (let ((.cse1 (and (forall ((v_arrayElimCell_39 Int) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1472 Int)) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1467))) (let ((.cse17 (store (select .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1472))) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_38 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse16 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse17) v_arrayElimCell_38) v_arrayElimCell_41))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse17 v_arrayElimCell_39)))))) (or (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1472 Int) (v_arrayElimCell_39 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1467) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1472) v_arrayElimCell_39))) .cse4))) (.cse0 (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| .cse15)) (.cse2 (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse3 (and (or (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1472 Int) (v_arrayElimCell_36 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1467))) (store .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1472))) v_arrayElimCell_36) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) .cse4) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1472 Int) (v_arrayElimCell_36 Int)) (let ((.cse10 (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1467))) (store .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1472))))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse10 v_arrayElimCell_36) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_38 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse10 v_arrayElimCell_38) v_arrayElimCell_41)))))) (forall ((v_arrayElimCell_39 Int) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1472 Int) (v_arrayElimCell_36 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1467))) (store .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1472))))) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_38 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_38) v_arrayElimCell_41))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse12 v_arrayElimCell_36) v_arrayElimCell_39))))) (or (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1472 Int) (v_arrayElimCell_39 Int) (v_arrayElimCell_36 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1467))) (store .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1472))) v_arrayElimCell_36) v_arrayElimCell_39))) .cse4)))) (and (or .cse0 .cse1) (or .cse2 .cse1) (or .cse0 .cse3) (or .cse4 (forall ((v_ArrVal_1467 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1467) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)))) (or (forall ((v_arrayElimCell_41 Int) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1472 Int) (v_arrayElimCell_38 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1467))) (store .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse6 v_ArrVal_1472))) v_arrayElimCell_38) v_arrayElimCell_41))) (not .cse4)) (or .cse2 .cse3) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1472 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1467))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_38 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store .cse7 .cse6 v_ArrVal_1472)) v_arrayElimCell_38) v_arrayElimCell_41))))))))))) is different from false [2023-12-16 04:44:28,774 INFO L349 Elim1Store]: treesize reduction 228, result has 87.4 percent of original size [2023-12-16 04:44:28,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 17 new quantified variables, introduced 137 case distinctions, treesize of input 2825 treesize of output 3876 [2023-12-16 04:44:29,314 INFO L224 Elim1Store]: Index analysis took 171 ms [2023-12-16 04:44:30,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:44:30,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 2488 treesize of output 3466 [2023-12-16 04:44:31,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:44:31,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2175 treesize of output 2172 [2023-12-16 04:44:32,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2163 treesize of output 2157 [2023-12-16 04:44:32,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2177 treesize of output 2171 [2023-12-16 04:44:33,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:44:33,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2191 treesize of output 2188 [2023-12-16 04:44:33,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2179 treesize of output 2177 [2023-12-16 04:44:34,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:44:34,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2207 treesize of output 2208 [2023-12-16 04:44:35,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2219 treesize of output 2213 [2023-12-16 04:44:35,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2223 treesize of output 2221 [2023-12-16 04:44:36,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:44:36,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2261 treesize of output 2258 [2023-12-16 04:44:37,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:44:37,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2279 treesize of output 2280 [2023-12-16 04:44:37,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2281 treesize of output 2279 [2023-12-16 04:44:38,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:44:38,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2299 treesize of output 2300 [2023-12-16 04:44:39,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2291 treesize of output 2285 [2023-12-16 04:44:39,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:44:39,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2305 treesize of output 2302 [2023-12-16 04:44:40,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2313 treesize of output 2307 Received shutdown request... [2023-12-16 04:44:50,211 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:44:50,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-16 04:44:50,222 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 04:44:50,222 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-16 04:44:50,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:44:50,420 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-300-3-2-4-3-3-2-2-2-1 context. [2023-12-16 04:44:50,424 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:44:50,425 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:44:50,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:44:50 BoogieIcfgContainer [2023-12-16 04:44:50,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:44:50,427 INFO L158 Benchmark]: Toolchain (without parser) took 68231.78ms. Allocated memory was 187.7MB in the beginning and 910.2MB in the end (delta: 722.5MB). Free memory was 136.3MB in the beginning and 561.8MB in the end (delta: -425.4MB). Peak memory consumption was 426.2MB. Max. memory is 8.0GB. [2023-12-16 04:44:50,427 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory was 138.8MB in the beginning and 138.7MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:44:50,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.67ms. Allocated memory is still 187.7MB. Free memory was 136.3MB in the beginning and 118.1MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 04:44:50,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.69ms. Allocated memory is still 187.7MB. Free memory was 118.1MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:44:50,428 INFO L158 Benchmark]: Boogie Preprocessor took 46.93ms. Allocated memory is still 187.7MB. Free memory was 116.0MB in the beginning and 112.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:44:50,428 INFO L158 Benchmark]: RCFGBuilder took 358.24ms. Allocated memory is still 187.7MB. Free memory was 112.9MB in the beginning and 94.4MB in the end (delta: 18.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 04:44:50,428 INFO L158 Benchmark]: TraceAbstraction took 67461.22ms. Allocated memory was 187.7MB in the beginning and 910.2MB in the end (delta: 722.5MB). Free memory was 93.7MB in the beginning and 561.8MB in the end (delta: -468.1MB). Peak memory consumption was 383.2MB. Max. memory is 8.0GB. [2023-12-16 04:44:50,429 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.09ms. Allocated memory is still 187.7MB. Free memory was 138.8MB in the beginning and 138.7MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 331.67ms. Allocated memory is still 187.7MB. Free memory was 136.3MB in the beginning and 118.1MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.69ms. Allocated memory is still 187.7MB. Free memory was 118.1MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.93ms. Allocated memory is still 187.7MB. Free memory was 116.0MB in the beginning and 112.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 358.24ms. Allocated memory is still 187.7MB. Free memory was 112.9MB in the beginning and 94.4MB in the end (delta: 18.5MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 67461.22ms. Allocated memory was 187.7MB in the beginning and 910.2MB in the end (delta: 722.5MB). Free memory was 93.7MB in the beginning and 561.8MB in the end (delta: -468.1MB). Peak memory consumption was 383.2MB. 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: 635]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 635). Cancelled while NwaCegarLoop was analyzing trace of length 30 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-300-3-2-4-3-3-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.4s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 29.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 28.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 1050 SdHoareTripleChecker+Invalid, 28.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 872 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1252 IncrementalHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 178 mSDtfsCounter, 1252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 233 SyntacticMatches, 4 SemanticMatches, 143 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=8, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 26 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 452 ConstructedInterpolants, 15 QuantifiedInterpolants, 2854 SizeOfPredicates, 57 NumberOfNonLiveVariables, 2002 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 180/225 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