/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/heap-data/shared_mem1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:56:12,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:56:12,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:56:12,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:56:12,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:56:12,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:56:12,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:56:12,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:56:12,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:56:12,918 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:56:12,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:56:12,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:56:12,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:56:12,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:56:12,920 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:56:12,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:56:12,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:56:12,921 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:56:12,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:56:12,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:56:12,922 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:56:12,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:56:12,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:56:12,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:56:12,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:56:12,922 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:56:12,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:56:12,923 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:56:12,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:56:12,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:56:12,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:56:12,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:56:12,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:56:12,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:56:12,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:56:12,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:56:12,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:56:12,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:56:12,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:56:12,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:56:12,925 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:56:12,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:56:12,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:56:12,925 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:56:13,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:56:13,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:56:13,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:56:13,119 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:56:13,119 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:56:13,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem1.i [2023-12-15 21:56:14,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:56:14,318 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:56:14,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem1.i [2023-12-15 21:56:14,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/217aeb91f/829cd1fb68bc41c0b24324885f2ee637/FLAG0fad6385f [2023-12-15 21:56:14,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/217aeb91f/829cd1fb68bc41c0b24324885f2ee637 [2023-12-15 21:56:14,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:56:14,345 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:56:14,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:56:14,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:56:14,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:56:14,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d0120f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14, skipping insertion in model container [2023-12-15 21:56:14,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,379 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:56:14,560 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem1.i[23879,23892] [2023-12-15 21:56:14,564 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:56:14,574 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:56:14,620 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem1.i[23879,23892] [2023-12-15 21:56:14,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:56:14,642 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:56:14,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14 WrapperNode [2023-12-15 21:56:14,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:56:14,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:56:14,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:56:14,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:56:14,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,675 INFO L138 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2023-12-15 21:56:14,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:56:14,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:56:14,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:56:14,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:56:14,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,708 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2023-12-15 21:56:14,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:56:14,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:56:14,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:56:14,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:56:14,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14" (1/1) ... [2023-12-15 21:56:14,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:56:14,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:56:14,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:56:14,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:56:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:56:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:56:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:56:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:56:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:56:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:56:14,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:56:14,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:56:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:56:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:56:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:56:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:56:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:56:14,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:56:14,848 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:56:14,849 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:56:14,951 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:56:14,968 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:56:14,968 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-15 21:56:14,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:56:14 BoogieIcfgContainer [2023-12-15 21:56:14,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:56:14,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:56:14,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:56:14,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:56:14,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:56:14" (1/3) ... [2023-12-15 21:56:14,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1946d221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:56:14, skipping insertion in model container [2023-12-15 21:56:14,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:56:14" (2/3) ... [2023-12-15 21:56:14,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1946d221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:56:14, skipping insertion in model container [2023-12-15 21:56:14,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:56:14" (3/3) ... [2023-12-15 21:56:14,974 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2023-12-15 21:56:14,985 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:56:14,985 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:56:15,013 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:56:15,017 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;@142c94ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:56:15,017 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:56:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:15,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-15 21:56:15,029 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:56:15,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:56:15,030 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:56:15,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:56:15,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1630425053, now seen corresponding path program 1 times [2023-12-15 21:56:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:56:15,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874519302] [2023-12-15 21:56:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:56:15,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:56:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:56:15,205 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-15 21:56:15,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:56:15,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874519302] [2023-12-15 21:56:15,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874519302] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:56:15,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:56:15,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:56:15,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307864048] [2023-12-15 21:56:15,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:56:15,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:56:15,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:56:15,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:56:15,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:56:15,229 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:56:15,257 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2023-12-15 21:56:15,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:56:15,259 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-15 21:56:15,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:56:15,264 INFO L225 Difference]: With dead ends: 25 [2023-12-15 21:56:15,265 INFO L226 Difference]: Without dead ends: 13 [2023-12-15 21:56:15,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:56:15,273 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:56:15,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:56:15,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-15 21:56:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-15 21:56:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2023-12-15 21:56:15,301 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 9 [2023-12-15 21:56:15,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:56:15,302 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2023-12-15 21:56:15,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2023-12-15 21:56:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-15 21:56:15,303 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:56:15,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:56:15,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:56:15,304 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:56:15,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:56:15,304 INFO L85 PathProgramCache]: Analyzing trace with hash -137983455, now seen corresponding path program 1 times [2023-12-15 21:56:15,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:56:15,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120040362] [2023-12-15 21:56:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:56:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:56:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:56:15,891 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-15 21:56:15,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:56:15,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120040362] [2023-12-15 21:56:15,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120040362] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:56:15,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:56:15,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:56:15,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341798979] [2023-12-15 21:56:15,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:56:15,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:56:15,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:56:15,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:56:15,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:56:15,898 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:56:15,996 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2023-12-15 21:56:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:56:15,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-15 21:56:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:56:15,998 INFO L225 Difference]: With dead ends: 30 [2023-12-15 21:56:15,998 INFO L226 Difference]: Without dead ends: 28 [2023-12-15 21:56:15,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:56:16,000 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 31 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:56:16,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 35 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:56:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-15 21:56:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2023-12-15 21:56:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2023-12-15 21:56:16,009 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 10 [2023-12-15 21:56:16,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:56:16,009 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2023-12-15 21:56:16,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2023-12-15 21:56:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-15 21:56:16,010 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:56:16,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:56:16,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:56:16,010 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:56:16,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:56:16,012 INFO L85 PathProgramCache]: Analyzing trace with hash -137981533, now seen corresponding path program 1 times [2023-12-15 21:56:16,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:56:16,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064934971] [2023-12-15 21:56:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:56:16,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:56:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:56:16,350 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-15 21:56:16,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:56:16,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064934971] [2023-12-15 21:56:16,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064934971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:56:16,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:56:16,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:56:16,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105417830] [2023-12-15 21:56:16,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:56:16,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:56:16,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:56:16,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:56:16,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:56:16,354 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:56:16,447 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2023-12-15 21:56:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:56:16,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-15 21:56:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:56:16,448 INFO L225 Difference]: With dead ends: 35 [2023-12-15 21:56:16,448 INFO L226 Difference]: Without dead ends: 28 [2023-12-15 21:56:16,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:56:16,449 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:56:16,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 52 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:56:16,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-15 21:56:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-12-15 21:56:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2023-12-15 21:56:16,452 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 10 [2023-12-15 21:56:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:56:16,452 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2023-12-15 21:56:16,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2023-12-15 21:56:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-15 21:56:16,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:56:16,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:56:16,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:56:16,453 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:56:16,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:56:16,453 INFO L85 PathProgramCache]: Analyzing trace with hash -136134491, now seen corresponding path program 1 times [2023-12-15 21:56:16,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:56:16,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866062696] [2023-12-15 21:56:16,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:56:16,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:56:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:56:16,650 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-15 21:56:16,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:56:16,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866062696] [2023-12-15 21:56:16,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866062696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:56:16,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:56:16,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:56:16,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962890729] [2023-12-15 21:56:16,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:56:16,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:56:16,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:56:16,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:56:16,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:56:16,652 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:16,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:56:16,721 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2023-12-15 21:56:16,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:56:16,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-15 21:56:16,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:56:16,723 INFO L225 Difference]: With dead ends: 38 [2023-12-15 21:56:16,723 INFO L226 Difference]: Without dead ends: 31 [2023-12-15 21:56:16,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:56:16,729 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:56:16,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:56:16,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-15 21:56:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-12-15 21:56:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2023-12-15 21:56:16,737 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 10 [2023-12-15 21:56:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:56:16,738 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2023-12-15 21:56:16,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2023-12-15 21:56:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-15 21:56:16,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:56:16,739 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:56:16,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:56:16,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:56:16,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:56:16,740 INFO L85 PathProgramCache]: Analyzing trace with hash 984642488, now seen corresponding path program 1 times [2023-12-15 21:56:16,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:56:16,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413907451] [2023-12-15 21:56:16,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:56:16,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:56:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:56:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:56:17,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:56:17,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413907451] [2023-12-15 21:56:17,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413907451] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:56:17,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381959657] [2023-12-15 21:56:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:56:17,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:56:17,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:56:17,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:56:17,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:56:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:56:17,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 53 conjunts are in the unsatisfiable core [2023-12-15 21:56:17,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:56:17,355 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 18 treesize of output 7 [2023-12-15 21:56:17,360 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 18 treesize of output 7 [2023-12-15 21:56:17,368 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-15 21:56:17,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 5 [2023-12-15 21:56:17,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:56:17,396 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 22 [2023-12-15 21:56:17,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-12-15 21:56:17,425 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:56:17,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2023-12-15 21:56:17,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-12-15 21:56:17,544 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2023-12-15 21:56:17,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 109 [2023-12-15 21:56:17,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 22 [2023-12-15 21:56:17,575 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:56:17,576 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 12 treesize of output 1 [2023-12-15 21:56:17,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2023-12-15 21:56:17,633 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2023-12-15 21:56:17,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 109 [2023-12-15 21:56:17,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 22 [2023-12-15 21:56:17,649 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:56:17,650 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 12 treesize of output 1 [2023-12-15 21:56:17,686 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:56:17,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 15 [2023-12-15 21:56:17,690 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 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-15 21:56:17,713 INFO L349 Elim1Store]: treesize reduction 50, result has 41.2 percent of original size [2023-12-15 21:56:17,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 109 [2023-12-15 21:56:17,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 22 [2023-12-15 21:56:17,739 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:56:17,739 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 12 treesize of output 1 [2023-12-15 21:56:17,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:56:17,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 20 [2023-12-15 21:56:17,796 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-15 21:56:17,796 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-15 21:56:17,988 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:56:17,989 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 137 [2023-12-15 21:56:17,994 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 0 case distinctions, treesize of input 83 treesize of output 67 [2023-12-15 21:56:17,998 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 67 treesize of output 43 [2023-12-15 21:56:18,020 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2023-12-15 21:56:18,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 43 [2023-12-15 21:56:18,206 INFO L349 Elim1Store]: treesize reduction 36, result has 61.3 percent of original size [2023-12-15 21:56:18,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 103 [2023-12-15 21:56:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:56:18,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:56:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:56:18,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381959657] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:56:18,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:56:18,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2023-12-15 21:56:18,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285763703] [2023-12-15 21:56:18,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:56:18,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-15 21:56:18,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:56:18,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-15 21:56:18,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2023-12-15 21:56:18,726 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:56:19,455 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2023-12-15 21:56:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:56:19,457 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-15 21:56:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:56:19,457 INFO L225 Difference]: With dead ends: 45 [2023-12-15 21:56:19,457 INFO L226 Difference]: Without dead ends: 43 [2023-12-15 21:56:19,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=436, Unknown=3, NotChecked=0, Total=600 [2023-12-15 21:56:19,458 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 64 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 23 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:56:19,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 67 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 90 Invalid, 14 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 21:56:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-15 21:56:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2023-12-15 21:56:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2023-12-15 21:56:19,463 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 14 [2023-12-15 21:56:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:56:19,463 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2023-12-15 21:56:19,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2023-12-15 21:56:19,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-15 21:56:19,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:56:19,464 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:56:19,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:56:19,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:56:19,665 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:56:19,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:56:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash 984644410, now seen corresponding path program 1 times [2023-12-15 21:56:19,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:56:19,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572843196] [2023-12-15 21:56:19,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:56:19,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:56:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:56:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:56:19,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:56:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572843196] [2023-12-15 21:56:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572843196] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:56:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995756049] [2023-12-15 21:56:19,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:56:19,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:56:19,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:56:19,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:56:19,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 21:56:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:56:20,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-15 21:56:20,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:56:20,073 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-15 21:56:20,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 18 [2023-12-15 21:56:20,082 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-12-15 21:56:20,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2023-12-15 21:56:20,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:56:20,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:56:20,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:56:20,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2023-12-15 21:56:20,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 11 [2023-12-15 21:56:20,146 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-15 21:56:20,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-15 21:56:20,194 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 65 treesize of output 45 [2023-12-15 21:56:20,196 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 45 treesize of output 29 [2023-12-15 21:56:20,232 INFO L349 Elim1Store]: treesize reduction 40, result has 57.9 percent of original size [2023-12-15 21:56:20,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 70 [2023-12-15 21:56:20,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:56:20,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 373 [2023-12-15 21:56:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:56:23,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:56:23,367 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 55 treesize of output 37 [2023-12-15 21:56:23,369 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 37 treesize of output 25 [2023-12-15 21:56:39,313 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_51 Int) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_370 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_16| Int) (|v_ULTIMATE.start_main_#t~mem11#1_9| Int) (|v_ULTIMATE.start_main_#t~mem12#1_9| Int)) (let ((.cse0 (store |c_#memory_int#1| |v_ULTIMATE.start_main_#t~malloc7#1.base_16| v_ArrVal_371))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_370))) (let ((.cse3 (select .cse2 v_arrayElimCell_50))) (or (not (= v_ArrVal_370 (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1 (select v_ArrVal_370 .cse1))))) (< |v_ULTIMATE.start_main_#t~mem12#1_9| (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (< 90 (select (select (store .cse2 v_arrayElimCell_50 (store .cse3 v_arrayElimCell_51 (+ |v_ULTIMATE.start_main_#t~mem11#1_9| |v_ULTIMATE.start_main_#t~mem12#1_9|))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< |v_ULTIMATE.start_main_#t~mem11#1_9| (select .cse3 v_arrayElimCell_51)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_16|) 0))))))) is different from false [2023-12-15 21:56:39,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-15 21:56:39,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995756049] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:56:39,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:56:39,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 15 [2023-12-15 21:56:39,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191786411] [2023-12-15 21:56:39,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:56:39,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 21:56:39,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:56:39,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 21:56:39,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=4, NotChecked=26, Total=240 [2023-12-15 21:56:39,375 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:47,749 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, 1] [2023-12-15 21:56:51,859 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, 1] [2023-12-15 21:56:55,918 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 [1] [2023-12-15 21:56:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:56:55,975 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2023-12-15 21:56:55,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:56:55,976 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-15 21:56:55,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:56:55,976 INFO L225 Difference]: With dead ends: 51 [2023-12-15 21:56:55,976 INFO L226 Difference]: Without dead ends: 44 [2023-12-15 21:56:55,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=119, Invalid=300, Unknown=5, NotChecked=38, Total=462 [2023-12-15 21:56:55,977 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:56:55,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 38 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 52 Invalid, 3 Unknown, 25 Unchecked, 12.3s Time] [2023-12-15 21:56:55,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-15 21:56:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2023-12-15 21:56:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:55,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2023-12-15 21:56:55,982 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 14 [2023-12-15 21:56:55,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:56:55,982 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2023-12-15 21:56:55,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2023-12-15 21:56:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-15 21:56:55,983 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:56:55,983 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:56:55,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-15 21:56:56,183 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,SelfDestructingSolverStorable5 [2023-12-15 21:56:56,183 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:56:56,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:56:56,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1638252987, now seen corresponding path program 1 times [2023-12-15 21:56:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:56:56,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600342334] [2023-12-15 21:56:56,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:56:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:56:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:56:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:56:56,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:56:56,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600342334] [2023-12-15 21:56:56,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600342334] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:56:56,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343157757] [2023-12-15 21:56:56,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:56:56,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:56:56,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:56:56,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:56:56,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 21:56:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:56:56,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-15 21:56:56,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:56:56,841 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 14 treesize of output 12 [2023-12-15 21:56:56,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 23 [2023-12-15 21:56:56,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-12-15 21:56:56,892 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 18 treesize of output 7 [2023-12-15 21:56:56,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-15 21:56:57,125 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:56:57,125 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 113 treesize of output 98 [2023-12-15 21:56:57,139 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 89 treesize of output 68 [2023-12-15 21:56:57,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 14 [2023-12-15 21:56:57,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 46 treesize of output 30 [2023-12-15 21:56:57,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 10 [2023-12-15 21:56:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:56:57,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:56:57,494 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_459 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1_11| Int) (|v_ULTIMATE.start_main_#t~mem11#1_11| Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse1 (select |c_#memory_int#1| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (or (< |v_ULTIMATE.start_main_#t~mem12#1_11| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< 100 (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_459)) (.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_457)) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7) 4))) (select (select (store |c_#memory_int#1| .cse0 (store .cse1 .cse2 (+ |v_ULTIMATE.start_main_#t~mem11#1_11| |v_ULTIMATE.start_main_#t~mem12#1_11|))) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (< |v_ULTIMATE.start_main_#t~mem11#1_11| (select .cse1 .cse2))))))) is different from false [2023-12-15 21:56:57,546 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_459 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1_11| Int) (|v_ULTIMATE.start_main_#t~mem11#1_11| Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (let ((.cse1 (select |c_#memory_int#1| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (or (< 100 (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_459)) (.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_457)) (.cse7 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7)) (.cse5 (+ (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) .cse7) 4))) (select (select (store |c_#memory_int#1| .cse0 (store .cse1 .cse2 (+ |v_ULTIMATE.start_main_#t~mem11#1_11| |v_ULTIMATE.start_main_#t~mem12#1_11|))) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5))))) (< |v_ULTIMATE.start_main_#t~mem12#1_11| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_#t~mem11#1_11| (select .cse1 .cse2))))))) is different from false [2023-12-15 21:56:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-15 21:56:57,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343157757] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:56:57,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:56:57,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 6] total 18 [2023-12-15 21:56:57,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148609288] [2023-12-15 21:56:57,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:56:57,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-15 21:56:57,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:56:57,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-15 21:56:57,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=227, Unknown=2, NotChecked=62, Total=342 [2023-12-15 21:56:57,589 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:56:58,685 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2023-12-15 21:56:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 21:56:58,686 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-15 21:56:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:56:58,689 INFO L225 Difference]: With dead ends: 59 [2023-12-15 21:56:58,689 INFO L226 Difference]: Without dead ends: 47 [2023-12-15 21:56:58,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=538, Unknown=2, NotChecked=102, Total=812 [2023-12-15 21:56:58,691 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 66 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:56:58,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 119 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 130 Invalid, 0 Unknown, 81 Unchecked, 0.3s Time] [2023-12-15 21:56:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-15 21:56:58,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2023-12-15 21:56:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2023-12-15 21:56:58,702 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 15 [2023-12-15 21:56:58,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:56:58,702 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2023-12-15 21:56:58,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:56:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2023-12-15 21:56:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-15 21:56:58,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:56:58,703 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:56:58,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 21:56:58,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:56:58,911 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:56:58,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:56:58,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1640101951, now seen corresponding path program 1 times [2023-12-15 21:56:58,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:56:58,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906031130] [2023-12-15 21:56:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:56:58,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:56:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:56:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:56:59,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:56:59,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906031130] [2023-12-15 21:56:59,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906031130] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:56:59,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767098064] [2023-12-15 21:56:59,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:56:59,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:56:59,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:56:59,404 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:56:59,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 21:56:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:56:59,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-15 21:56:59,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:56:59,506 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:56:59,509 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 27 treesize of output 26 [2023-12-15 21:56:59,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-12-15 21:56:59,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:56:59,555 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 34 treesize of output 26 [2023-12-15 21:56:59,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-12-15 21:56:59,589 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 14 treesize of output 15 [2023-12-15 21:56:59,610 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 10 treesize of output 8 [2023-12-15 21:56:59,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-15 21:56:59,904 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:56:59,904 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 54 [2023-12-15 21:56:59,915 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-15 21:56:59,929 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 31 treesize of output 16 [2023-12-15 21:57:00,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 66 [2023-12-15 21:57:00,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 46 [2023-12-15 21:57:00,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-12-15 21:57:00,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 12 [2023-12-15 21:57:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:57:00,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:57:00,554 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_546 Int) (v_ArrVal_543 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_544)) (.cse11 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_545))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse8 (+ .cse6 4))) (let ((.cse1 (store |c_#memory_int#1| .cse10 v_ArrVal_543)) (.cse2 (select (select .cse9 .cse5) .cse8))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select .cse7 .cse5) .cse8))) (let ((.cse0 (select .cse3 .cse4))) (or (< .cse0 101) (< 90 (select (select (store .cse1 .cse2 (store .cse3 .cse4 v_ArrVal_546)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< (+ v_ArrVal_546 (select (select .cse1 .cse5) .cse6)) .cse0)))))))))) is different from false [2023-12-15 21:57:00,615 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_546 Int) (v_ArrVal_543 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_544)) (.cse11 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_545))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse8 (+ .cse6 4))) (let ((.cse0 (store |c_#memory_int#1| .cse10 v_ArrVal_543)) (.cse1 (select (select .cse9 .cse5) .cse8))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse7 .cse5) .cse8))) (let ((.cse4 (select .cse2 .cse3))) (or (< 90 (select (select (store .cse0 .cse1 (store .cse2 .cse3 v_ArrVal_546)) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse4 101) (< (+ v_ArrVal_546 (select (select .cse0 .cse5) .cse6)) .cse4)))))))))) is different from false [2023-12-15 21:57:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-15 21:57:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767098064] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:57:00,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:57:00,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 8] total 18 [2023-12-15 21:57:00,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462381335] [2023-12-15 21:57:00,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:57:00,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-15 21:57:00,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:57:00,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-15 21:57:00,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=215, Unknown=2, NotChecked=62, Total=342 [2023-12-15 21:57:00,660 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:57:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:57:02,580 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2023-12-15 21:57:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:57:02,581 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-15 21:57:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:57:02,581 INFO L225 Difference]: With dead ends: 86 [2023-12-15 21:57:02,581 INFO L226 Difference]: Without dead ends: 73 [2023-12-15 21:57:02,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=261, Invalid=615, Unknown=2, NotChecked=114, Total=992 [2023-12-15 21:57:02,583 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 108 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-15 21:57:02,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 191 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 149 Invalid, 0 Unknown, 107 Unchecked, 0.5s Time] [2023-12-15 21:57:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-15 21:57:02,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 47. [2023-12-15 21:57:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:57:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2023-12-15 21:57:02,599 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 15 [2023-12-15 21:57:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:57:02,599 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2023-12-15 21:57:02,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:57:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2023-12-15 21:57:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-15 21:57:02,600 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:57:02,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:57:02,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 21:57:02,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:57:02,803 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:57:02,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:57:02,804 INFO L85 PathProgramCache]: Analyzing trace with hash 590429828, now seen corresponding path program 1 times [2023-12-15 21:57:02,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:57:02,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878031114] [2023-12-15 21:57:02,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:57:02,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:57:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:57:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:57:03,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:57:03,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878031114] [2023-12-15 21:57:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878031114] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:57:03,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858289438] [2023-12-15 21:57:03,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:57:03,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:57:03,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:57:03,674 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-15 21:57:03,675 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-15 21:57:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:57:03,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 71 conjunts are in the unsatisfiable core [2023-12-15 21:57:03,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:57:03,804 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-15 21:57:03,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 18 [2023-12-15 21:57:03,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-15 21:57:03,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 42 [2023-12-15 21:57:04,033 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-15 21:57:04,034 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 20 treesize of output 23 [2023-12-15 21:57:04,085 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-12-15 21:57:04,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2023-12-15 21:57:04,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 19 [2023-12-15 21:57:04,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2023-12-15 21:57:04,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:57:04,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2023-12-15 21:57:04,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-12-15 21:57:04,618 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-15 21:57:04,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 94 [2023-12-15 21:57:04,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2023-12-15 21:57:04,659 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 28 treesize of output 15 [2023-12-15 21:57:05,124 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:57:05,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 71 [2023-12-15 21:57:05,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-12-15 21:57:05,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-15 21:57:05,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 28 treesize of output 12 [2023-12-15 21:57:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:57:05,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:57:05,652 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1_13| Int) (v_ArrVal_690 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1_13| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_690)) (.cse11 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_688))) (let ((.cse4 (select (select .cse9 |c_ULTIMATE.start_main_~list~0#1.base|) .cse11)) (.cse8 (+ .cse5 4))) (let ((.cse0 (store |c_#memory_int#1| .cse10 v_ArrVal_689)) (.cse1 (select (select .cse9 .cse4) .cse8))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse7 .cse4) .cse8))) (let ((.cse6 (select .cse2 .cse3))) (or (< (select (select (store .cse0 .cse1 (store .cse2 .cse3 (+ |v_ULTIMATE.start_main_#t~mem11#1_13| |v_ULTIMATE.start_main_#t~mem12#1_13|))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< (select (select .cse0 .cse4) .cse5) |v_ULTIMATE.start_main_#t~mem12#1_13|) (< .cse6 |v_ULTIMATE.start_main_#t~mem11#1_13|) (< 100 .cse6)))))))))) is different from false [2023-12-15 21:57:05,717 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem12#1_13| Int) (v_ArrVal_690 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1_13| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse10 v_ArrVal_690)) (.cse11 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$#1.base| .cse10 v_ArrVal_688))) (let ((.cse2 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse8 (+ .cse3 4))) (let ((.cse1 (store |c_#memory_int#1| .cse10 v_ArrVal_689)) (.cse4 (select (select .cse9 .cse2) .cse8))) (let ((.cse5 (select .cse1 .cse4)) (.cse6 (select (select .cse7 .cse2) .cse8))) (let ((.cse0 (select .cse5 .cse6))) (or (< 100 .cse0) (< (select (select .cse1 .cse2) .cse3) |v_ULTIMATE.start_main_#t~mem12#1_13|) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1_13|) (< (select (select (store .cse1 .cse4 (store .cse5 .cse6 (+ |v_ULTIMATE.start_main_#t~mem11#1_13| |v_ULTIMATE.start_main_#t~mem12#1_13|))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110)))))))))) is different from false [2023-12-15 21:57:05,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:57:05,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1986 treesize of output 1518 [2023-12-15 21:57:05,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:57:05,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1506 treesize of output 1460 [2023-12-15 21:57:06,063 INFO L349 Elim1Store]: treesize reduction 32, result has 60.5 percent of original size [2023-12-15 21:57:06,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 1 new quantified variables, introduced 3 case distinctions, treesize of input 1436 treesize of output 1132 [2023-12-15 21:57:06,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:57:06,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44038 treesize of output 39890 [2023-12-15 21:57:06,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:57:06,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 26664 treesize of output 23971 [2023-12-15 21:57:07,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:57:07,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 23500 treesize of output 23062 [2023-12-15 21:57:07,358 INFO L224 Elim1Store]: Index analysis took 106 ms [2023-12-15 21:57:07,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:57:07,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 18630 treesize of output 18754 [2023-12-15 21:57:08,046 INFO L224 Elim1Store]: Index analysis took 109 ms [2023-12-15 21:57:08,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:57:08,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 18907 treesize of output 18967 Received shutdown request... [2023-12-15 21:57:23,234 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-15 21:57:23,234 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:57:23,260 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:57:23,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-15 21:57:23,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:57:23,466 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-60-5-6-6-5-5-4-4-3-4-3-3-2-2-2-2-1 context. [2023-12-15 21:57:23,469 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:57:23,471 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:57:23,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:57:23 BoogieIcfgContainer [2023-12-15 21:57:23,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:57:23,472 INFO L158 Benchmark]: Toolchain (without parser) took 69127.39ms. Allocated memory was 308.3MB in the beginning and 566.2MB in the end (delta: 257.9MB). Free memory was 263.5MB in the beginning and 278.0MB in the end (delta: -14.6MB). Peak memory consumption was 336.6MB. Max. memory is 8.0GB. [2023-12-15 21:57:23,472 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:57:23,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.24ms. Allocated memory is still 308.3MB. Free memory was 263.0MB in the beginning and 245.6MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-15 21:57:23,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.45ms. Allocated memory is still 308.3MB. Free memory was 245.6MB in the beginning and 243.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:57:23,473 INFO L158 Benchmark]: Boogie Preprocessor took 42.13ms. Allocated memory is still 308.3MB. Free memory was 243.6MB in the beginning and 241.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:57:23,473 INFO L158 Benchmark]: RCFGBuilder took 250.55ms. Allocated memory is still 308.3MB. Free memory was 241.5MB in the beginning and 226.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:57:23,473 INFO L158 Benchmark]: TraceAbstraction took 68501.76ms. Allocated memory was 308.3MB in the beginning and 566.2MB in the end (delta: 257.9MB). Free memory was 225.7MB in the beginning and 278.0MB in the end (delta: -52.3MB). Peak memory consumption was 298.9MB. Max. memory is 8.0GB. [2023-12-15 21:57:23,474 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 195.0MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.24ms. Allocated memory is still 308.3MB. Free memory was 263.0MB in the beginning and 245.6MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.45ms. Allocated memory is still 308.3MB. Free memory was 245.6MB in the beginning and 243.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.13ms. Allocated memory is still 308.3MB. Free memory was 243.6MB in the beginning and 241.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 250.55ms. Allocated memory is still 308.3MB. Free memory was 241.5MB in the beginning and 226.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 68501.76ms. Allocated memory was 308.3MB in the beginning and 566.2MB in the end (delta: 257.9MB). Free memory was 225.7MB in the beginning and 278.0MB in the end (delta: -52.3MB). Peak memory consumption was 298.9MB. 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: 602]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 602). Cancelled while NwaCegarLoop was analyzing trace of length 20 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-60-5-6-6-5-5-4-4-3-4-3-3-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17 mSolverCounterUnknown, 327 SdHoareTripleChecker+Valid, 13.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 327 mSDsluCounter, 560 SdHoareTripleChecker+Invalid, 13.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 213 IncrementalHoareTripleChecker+Unchecked, 467 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 556 IncrementalHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 93 mSDtfsCounter, 556 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 82 SyntacticMatches, 7 SemanticMatches, 121 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 24.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=8, InterpolantAutomatonStates: 64, 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, 8 MinimizatonAttempts, 71 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 25.4s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 197 ConstructedInterpolants, 43 QuantifiedInterpolants, 8934 SizeOfPredicates, 67 NumberOfNonLiveVariables, 722 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 11/42 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