./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:45:52,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:45:52,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:45:52,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:45:52,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:45:52,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:45:52,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:45:52,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:45:52,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:45:52,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:45:52,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:45:52,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:45:52,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:45:52,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:45:52,621 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:45:52,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:45:52,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:45:52,625 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:45:52,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:45:52,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:45:52,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:45:52,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:45:52,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:45:52,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:45:52,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:45:52,630 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:45:52,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:45:52,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:45:52,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:45:52,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:45:52,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:45:52,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:45:52,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:45:52,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:45:52,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:45:52,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:45:52,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:45:52,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:45:52,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:45:52,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:45:52,636 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:45:52,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:45:52,637 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2024-10-14 01:45:52,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:45:52,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:45:52,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:45:52,930 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:45:52,931 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:45:52,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2024-10-14 01:45:54,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:45:54,652 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:45:54,653 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2024-10-14 01:45:54,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d3218fc/91cdd085cff947ddbaf14856d3a860dc/FLAG68f819a74 [2024-10-14 01:45:54,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d3218fc/91cdd085cff947ddbaf14856d3a860dc [2024-10-14 01:45:54,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:45:54,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:45:54,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:45:54,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:45:54,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:45:54,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:45:54" (1/1) ... [2024-10-14 01:45:54,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29df4727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:54, skipping insertion in model container [2024-10-14 01:45:54,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:45:54" (1/1) ... [2024-10-14 01:45:55,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:45:55,307 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2024-10-14 01:45:55,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:45:55,333 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:45:55,388 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2024-10-14 01:45:55,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:45:55,420 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:45:55,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55 WrapperNode [2024-10-14 01:45:55,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:45:55,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:45:55,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:45:55,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:45:55,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55" (1/1) ... [2024-10-14 01:45:55,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55" (1/1) ... [2024-10-14 01:45:55,462 INFO L138 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2024-10-14 01:45:55,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:45:55,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:45:55,464 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:45:55,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:45:55,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55" (1/1) ... [2024-10-14 01:45:55,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55" (1/1) ... [2024-10-14 01:45:55,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55" (1/1) ... [2024-10-14 01:45:55,491 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]. [2024-10-14 01:45:55,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55" (1/1) ... [2024-10-14 01:45:55,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55" (1/1) ... [2024-10-14 01:45:55,498 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55" (1/1) ... [2024-10-14 01:45:55,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55" (1/1) ... [2024-10-14 01:45:55,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55" (1/1) ... [2024-10-14 01:45:55,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55" (1/1) ... [2024-10-14 01:45:55,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:45:55,511 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:45:55,511 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:45:55,512 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:45:55,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55" (1/1) ... [2024-10-14 01:45:55,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:45:55,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:45:55,553 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) [2024-10-14 01:45:55,555 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 [2024-10-14 01:45:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 01:45:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 01:45:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 01:45:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 01:45:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:45:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:45:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 01:45:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 01:45:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 01:45:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 01:45:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:45:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:45:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:45:55,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:45:55,698 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:45:55,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:45:55,864 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 01:45:55,864 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:45:55,894 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:45:55,894 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 01:45:55,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:45:55 BoogieIcfgContainer [2024-10-14 01:45:55,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:45:55,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:45:55,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:45:55,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:45:55,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:45:54" (1/3) ... [2024-10-14 01:45:55,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37509a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:45:55, skipping insertion in model container [2024-10-14 01:45:55,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:45:55" (2/3) ... [2024-10-14 01:45:55,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37509a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:45:55, skipping insertion in model container [2024-10-14 01:45:55,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:45:55" (3/3) ... [2024-10-14 01:45:55,908 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2024-10-14 01:45:55,928 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:45:55,928 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:45:55,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:45:56,006 INFO L333 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, 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;@74a0aea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:45:56,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:45:56,012 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) [2024-10-14 01:45:56,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 01:45:56,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:45:56,020 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:45:56,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:45:56,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:45:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1630425053, now seen corresponding path program 1 times [2024-10-14 01:45:56,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:45:56,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749002568] [2024-10-14 01:45:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:45:56,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:45:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:45:56,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:45:56,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749002568] [2024-10-14 01:45:56,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749002568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:45:56,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:45:56,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 01:45:56,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480790941] [2024-10-14 01:45:56,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:45:56,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 01:45:56,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:45:56,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 01:45:56,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 01:45:56,353 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) [2024-10-14 01:45:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:45:56,379 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2024-10-14 01:45:56,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 01:45:56,383 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 [2024-10-14 01:45:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:45:56,391 INFO L225 Difference]: With dead ends: 25 [2024-10-14 01:45:56,391 INFO L226 Difference]: Without dead ends: 13 [2024-10-14 01:45:56,394 INFO L431 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 [2024-10-14 01:45:56,397 INFO L432 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 [2024-10-14 01:45:56,399 INFO L433 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] [2024-10-14 01:45:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-14 01:45:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-14 01:45:56,428 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) [2024-10-14 01:45:56,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2024-10-14 01:45:56,429 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 9 [2024-10-14 01:45:56,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:45:56,430 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-14 01:45:56,430 INFO L472 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) [2024-10-14 01:45:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2024-10-14 01:45:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 01:45:56,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:45:56,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:45:56,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:45:56,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:45:56,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:45:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash -137983455, now seen corresponding path program 1 times [2024-10-14 01:45:56,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:45:56,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230831206] [2024-10-14 01:45:56,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:45:56,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:45:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:45:57,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:45:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230831206] [2024-10-14 01:45:57,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230831206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:45:57,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:45:57,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 01:45:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240901622] [2024-10-14 01:45:57,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:45:57,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 01:45:57,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:45:57,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 01:45:57,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 01:45:57,326 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) [2024-10-14 01:45:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:45:57,484 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2024-10-14 01:45:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:45:57,484 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 [2024-10-14 01:45:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:45:57,487 INFO L225 Difference]: With dead ends: 30 [2024-10-14 01:45:57,488 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 01:45:57,489 INFO L431 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 [2024-10-14 01:45:57,492 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:45:57,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 50 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:45:57,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 01:45:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2024-10-14 01:45:57,500 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) [2024-10-14 01:45:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-10-14 01:45:57,501 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 10 [2024-10-14 01:45:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:45:57,502 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-10-14 01:45:57,502 INFO L472 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) [2024-10-14 01:45:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-10-14 01:45:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 01:45:57,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:45:57,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:45:57,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:45:57,504 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:45:57,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:45:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash -137981533, now seen corresponding path program 1 times [2024-10-14 01:45:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:45:57,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336443923] [2024-10-14 01:45:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:45:57,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:45:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:45:57,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:45:57,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336443923] [2024-10-14 01:45:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336443923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:45:57,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:45:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 01:45:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373090360] [2024-10-14 01:45:57,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:45:57,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 01:45:57,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:45:57,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 01:45:57,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:45:57,920 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) [2024-10-14 01:45:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:45:58,033 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2024-10-14 01:45:58,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 01:45:58,033 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 [2024-10-14 01:45:58,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:45:58,034 INFO L225 Difference]: With dead ends: 35 [2024-10-14 01:45:58,034 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 01:45:58,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 01:45:58,035 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:45:58,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 43 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:45:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 01:45:58,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-10-14 01:45:58,042 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) [2024-10-14 01:45:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-10-14 01:45:58,044 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 10 [2024-10-14 01:45:58,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:45:58,044 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-10-14 01:45:58,045 INFO L472 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) [2024-10-14 01:45:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-10-14 01:45:58,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 01:45:58,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:45:58,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:45:58,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 01:45:58,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:45:58,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:45:58,050 INFO L85 PathProgramCache]: Analyzing trace with hash -136134491, now seen corresponding path program 1 times [2024-10-14 01:45:58,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:45:58,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137033829] [2024-10-14 01:45:58,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:45:58,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:45:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:45:58,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:45:58,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137033829] [2024-10-14 01:45:58,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137033829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:45:58,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:45:58,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 01:45:58,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415991830] [2024-10-14 01:45:58,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:45:58,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 01:45:58,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:45:58,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 01:45:58,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:45:58,482 INFO L87 Difference]: Start difference. First operand 25 states and 33 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) [2024-10-14 01:45:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:45:58,592 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2024-10-14 01:45:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 01:45:58,592 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 [2024-10-14 01:45:58,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:45:58,593 INFO L225 Difference]: With dead ends: 34 [2024-10-14 01:45:58,593 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 01:45:58,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 01:45:58,595 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:45:58,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 33 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:45:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 01:45:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-10-14 01:45:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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) [2024-10-14 01:45:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-10-14 01:45:58,599 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 10 [2024-10-14 01:45:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:45:58,600 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-14 01:45:58,600 INFO L472 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) [2024-10-14 01:45:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-10-14 01:45:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 01:45:58,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:45:58,600 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:45:58,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 01:45:58,601 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:45:58,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:45:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash 984642488, now seen corresponding path program 1 times [2024-10-14 01:45:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:45:58,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155154444] [2024-10-14 01:45:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:45:58,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:45:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:45:59,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:45:59,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155154444] [2024-10-14 01:45:59,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155154444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:45:59,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072595835] [2024-10-14 01:45:59,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:45:59,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:45:59,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:45:59,267 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) [2024-10-14 01:45:59,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 01:45:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:45:59,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-14 01:45:59,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:45:59,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2024-10-14 01:45:59,559 INFO L349 Elim1Store]: treesize reduction 78, result has 27.1 percent of original size [2024-10-14 01:45:59,560 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 1 case distinctions, treesize of input 33 treesize of output 40 [2024-10-14 01:45:59,632 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 01:45:59,632 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 [2024-10-14 01:45:59,657 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 [2024-10-14 01:45:59,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 37 treesize of output 36 [2024-10-14 01:45:59,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:59,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:59,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:59,826 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 37 treesize of output 37 [2024-10-14 01:45:59,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:59,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:59,840 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 30 treesize of output 27 [2024-10-14 01:45:59,859 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-14 01:45:59,859 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 [2024-10-14 01:45:59,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:59,876 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 22 treesize of output 11 [2024-10-14 01:45:59,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:45:59,885 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 22 treesize of output 11 [2024-10-14 01:46:00,170 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 63 treesize of output 35 [2024-10-14 01:46:00,196 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2024-10-14 01:46:00,197 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 2 case distinctions, treesize of input 43 treesize of output 42 [2024-10-14 01:46:00,268 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 22 treesize of output 10 [2024-10-14 01:46:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:46:00,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:46:00,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:46:00,551 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 155 treesize of output 131 [2024-10-14 01:46:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:46:00,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072595835] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:46:00,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:46:00,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2024-10-14 01:46:00,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114446658] [2024-10-14 01:46:00,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:46:00,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 01:46:00,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:46:00,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 01:46:00,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-10-14 01:46:00,758 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 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) [2024-10-14 01:46:01,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:46:01,318 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-10-14 01:46:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 01:46:01,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 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 [2024-10-14 01:46:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:46:01,320 INFO L225 Difference]: With dead ends: 38 [2024-10-14 01:46:01,320 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 01:46:01,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2024-10-14 01:46:01,322 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 01:46:01,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 62 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 01:46:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 01:46:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2024-10-14 01:46:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 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) [2024-10-14 01:46:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2024-10-14 01:46:01,332 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 14 [2024-10-14 01:46:01,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:46:01,333 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2024-10-14 01:46:01,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 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) [2024-10-14 01:46:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2024-10-14 01:46:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 01:46:01,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:46:01,334 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:46:01,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 01:46:01,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:46:01,539 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:46:01,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:46:01,541 INFO L85 PathProgramCache]: Analyzing trace with hash 984644410, now seen corresponding path program 1 times [2024-10-14 01:46:01,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:46:01,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744391581] [2024-10-14 01:46:01,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:46:01,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:46:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:46:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:46:02,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:46:02,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744391581] [2024-10-14 01:46:02,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744391581] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:46:02,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914014743] [2024-10-14 01:46:02,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:46:02,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:46:02,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:46:02,060 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) [2024-10-14 01:46:02,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 01:46:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:46:02,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-14 01:46:02,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:46:02,199 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 01:46:02,199 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 [2024-10-14 01:46:02,211 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 [2024-10-14 01:46:02,235 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 53 treesize of output 1 [2024-10-14 01:46:02,242 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 [2024-10-14 01:46:02,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:02,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:02,398 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 37 treesize of output 37 [2024-10-14 01:46:02,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:02,413 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 26 treesize of output 16 [2024-10-14 01:46:02,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:02,422 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 30 treesize of output 27 [2024-10-14 01:46:02,433 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:46:02,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2024-10-14 01:46:02,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:02,443 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 22 treesize of output 11 [2024-10-14 01:46:02,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:02,451 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 16 treesize of output 20 [2024-10-14 01:46:02,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:02,462 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 22 treesize of output 11 [2024-10-14 01:46:02,716 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 60 treesize of output 36 [2024-10-14 01:46:02,721 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 [2024-10-14 01:46:02,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:02,729 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 17 treesize of output 7 [2024-10-14 01:46:02,772 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:46:02,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2024-10-14 01:46:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:46:02,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:46:07,281 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem11#1_17| Int) (|v_ULTIMATE.start_main_#t~mem12#1_17| Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (let ((.cse0 (select |c_#memory_int#1| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse3))) (or (< |v_ULTIMATE.start_main_#t~mem12#1_17| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< |v_ULTIMATE.start_main_#t~mem11#1_17| (select .cse0 .cse1)) (< 90 (select (select (store |c_#memory_int#1| .cse2 (store .cse0 .cse1 (+ |v_ULTIMATE.start_main_#t~mem11#1_17| |v_ULTIMATE.start_main_#t~mem12#1_17|))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))) is different from false [2024-10-14 01:46:11,395 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem11#1_17| Int) (|v_ULTIMATE.start_main_#t~mem12#1_17| Int)) (let ((.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (let ((.cse0 (select |c_#memory_int#1| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (< |v_ULTIMATE.start_main_#t~mem11#1_17| (select .cse0 .cse1)) (< |v_ULTIMATE.start_main_#t~mem12#1_17| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (< 90 (select (select (store |c_#memory_int#1| .cse2 (store .cse0 .cse1 (+ |v_ULTIMATE.start_main_#t~mem11#1_17| |v_ULTIMATE.start_main_#t~mem12#1_17|))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))) is different from false [2024-10-14 01:46:11,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:46:11,532 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 165 treesize of output 165 [2024-10-14 01:46:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 01:46:29,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914014743] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:46:29,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:46:29,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2024-10-14 01:46:29,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223993775] [2024-10-14 01:46:29,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:46:29,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 01:46:29,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:46:29,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 01:46:29,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=136, Unknown=4, NotChecked=50, Total=240 [2024-10-14 01:46:29,682 INFO L87 Difference]: Start difference. First operand 27 states and 36 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) [2024-10-14 01:46:34,157 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~m~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse8 (select .cse4 |c_ULTIMATE.start_main_~head~0#1.offset|))) (and (<= 0 |c_ULTIMATE.start_main_~list~0#1.offset|) (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= 100 (select .cse0 0)) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~m~0#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) 4)) (<= 1 (select .cse1 0)) (= (select .cse2 4) 0) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~m~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= (select .cse1 |c_ULTIMATE.start_main_~list~0#1.offset|) 1) (= (select .cse0 |c_ULTIMATE.start_main_~m~0#1.offset|) 100) (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (= |c_ULTIMATE.start_main_~m~0#1.base| (select .cse3 4)) (<= 1 (select .cse4 0)) (exists ((|ULTIMATE.start_main_~list~0#1.offset| Int)) (and (= 0 (select .cse2 (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (<= 0 |ULTIMATE.start_main_~list~0#1.offset|))) (= (select .cse5 4) 0) (= |c_ULTIMATE.start_main_~m~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_#t~mem11#1_17| Int) (|v_ULTIMATE.start_main_#t~mem12#1_17| Int)) (let ((.cse10 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse9 (select .cse3 .cse10))) (let ((.cse6 (select |c_#memory_int#1| .cse9)) (.cse7 (select .cse2 .cse10))) (or (< |v_ULTIMATE.start_main_#t~mem11#1_17| (select .cse6 .cse7)) (< |v_ULTIMATE.start_main_#t~mem12#1_17| .cse8) (< 90 (select (select (store |c_#memory_int#1| .cse9 (store .cse6 .cse7 (+ |v_ULTIMATE.start_main_#t~mem11#1_17| |v_ULTIMATE.start_main_#t~mem12#1_17|))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))) (exists ((|v_ULTIMATE.start_main_~list~0#1.offset_18| Int)) (and (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_18|) (= (select .cse5 (+ 8 |v_ULTIMATE.start_main_~list~0#1.offset_18|)) 0))) (= .cse8 1)))) is different from false [2024-10-14 01:46:38,216 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~m~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse6 (select .cse3 |c_ULTIMATE.start_main_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (<= 100 (select .cse0 0)) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select .cse1 4) 0) (= (select .cse0 |c_ULTIMATE.start_main_~m~0#1.offset|) 100) (= |c_ULTIMATE.start_main_~m~0#1.base| (select .cse2 4)) (<= 1 (select .cse3 0)) (exists ((|ULTIMATE.start_main_~list~0#1.offset| Int)) (and (= 0 (select .cse1 (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (<= 0 |ULTIMATE.start_main_~list~0#1.offset|))) (= |c_ULTIMATE.start_main_~m~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_#t~mem11#1_17| Int) (|v_ULTIMATE.start_main_#t~mem12#1_17| Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse7 (select .cse2 .cse8))) (let ((.cse4 (select |c_#memory_int#1| .cse7)) (.cse5 (select .cse1 .cse8))) (or (< |v_ULTIMATE.start_main_#t~mem11#1_17| (select .cse4 .cse5)) (< |v_ULTIMATE.start_main_#t~mem12#1_17| .cse6) (< 90 (select (select (store |c_#memory_int#1| .cse7 (store .cse4 .cse5 (+ |v_ULTIMATE.start_main_#t~mem11#1_17| |v_ULTIMATE.start_main_#t~mem12#1_17|))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))) (= .cse6 1)))) is different from false [2024-10-14 01:46:42,731 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~m~0#1.base|)) (.cse3 (select .cse2 |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= 100 (select .cse0 0)) (= |c_ULTIMATE.start_main_~m~0#1.base| (select .cse1 4)) (<= 1 (select .cse2 0)) (= .cse3 1) (= (select .cse0 |c_ULTIMATE.start_main_~m~0#1.offset|) 100) (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select .cse4 4) 0) (= |c_ULTIMATE.start_main_~m~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_#t~mem11#1_17| Int) (|v_ULTIMATE.start_main_#t~mem12#1_17| Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse7 (select .cse1 .cse8))) (let ((.cse5 (select |c_#memory_int#1| .cse7)) (.cse6 (select .cse4 .cse8))) (or (< |v_ULTIMATE.start_main_#t~mem12#1_17| .cse3) (< |v_ULTIMATE.start_main_#t~mem11#1_17| (select .cse5 .cse6)) (< 90 (select (select (store |c_#memory_int#1| .cse7 (store .cse5 .cse6 (+ |v_ULTIMATE.start_main_#t~mem11#1_17| |v_ULTIMATE.start_main_#t~mem12#1_17|))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))) (exists ((|v_ULTIMATE.start_main_~list~0#1.offset_18| Int)) (and (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_18|) (= (select .cse4 (+ 8 |v_ULTIMATE.start_main_~list~0#1.offset_18|)) 0)))))) is different from false [2024-10-14 01:46:46,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~m~0#1.base|)) (.cse3 (select .cse2 |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse4 (select .cse1 .cse8)) (.cse5 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (<= 100 (select .cse0 0)) (= |c_ULTIMATE.start_main_~m~0#1.base| (select .cse1 4)) (<= 1 (select .cse2 0)) (or (= .cse3 1) (not (= |c_ULTIMATE.start_main_~m~0#1.base| .cse4))) (= (select .cse0 |c_ULTIMATE.start_main_~m~0#1.offset|) 100) (not (= |c_ULTIMATE.start_main_~m~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select .cse5 4) 0) (= |c_ULTIMATE.start_main_~m~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_#t~mem11#1_17| Int) (|v_ULTIMATE.start_main_#t~mem12#1_17| Int)) (let ((.cse6 (select |c_#memory_int#1| .cse4)) (.cse7 (select .cse5 .cse8))) (or (< |v_ULTIMATE.start_main_#t~mem12#1_17| .cse3) (< |v_ULTIMATE.start_main_#t~mem11#1_17| (select .cse6 .cse7)) (< 90 (select (select (store |c_#memory_int#1| .cse4 (store .cse6 .cse7 (+ |v_ULTIMATE.start_main_#t~mem11#1_17| |v_ULTIMATE.start_main_#t~mem12#1_17|))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))) (exists ((|v_ULTIMATE.start_main_~list~0#1.offset_18| Int)) (and (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_18|) (= (select .cse5 (+ 8 |v_ULTIMATE.start_main_~list~0#1.offset_18|)) 0)))))) is different from false [2024-10-14 01:46:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:46:46,993 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2024-10-14 01:46:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 01:46:46,994 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 [2024-10-14 01:46:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:46:46,995 INFO L225 Difference]: With dead ends: 50 [2024-10-14 01:46:46,995 INFO L226 Difference]: Without dead ends: 43 [2024-10-14 01:46:46,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 43.3s TimeCoverageRelationStatistics Valid=95, Invalid=263, Unknown=8, NotChecked=234, Total=600 [2024-10-14 01:46:46,996 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 42 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 01:46:46,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 79 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 163 Unchecked, 0.5s Time] [2024-10-14 01:46:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-14 01:46:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2024-10-14 01:46:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 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) [2024-10-14 01:46:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-10-14 01:46:47,012 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 14 [2024-10-14 01:46:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:46:47,012 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-10-14 01:46:47,012 INFO L472 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) [2024-10-14 01:46:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2024-10-14 01:46:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 01:46:47,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:46:47,013 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:46:47,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 01:46:47,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 01:46:47,216 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:46:47,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:46:47,216 INFO L85 PathProgramCache]: Analyzing trace with hash 986491452, now seen corresponding path program 1 times [2024-10-14 01:46:47,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:46:47,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960324281] [2024-10-14 01:46:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:46:47,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:46:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:46:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:46:47,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:46:47,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960324281] [2024-10-14 01:46:47,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960324281] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:46:47,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236911638] [2024-10-14 01:46:47,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:46:47,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:46:47,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:46:47,935 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) [2024-10-14 01:46:47,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 01:46:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:46:48,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-14 01:46:48,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:46:48,151 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 29 treesize of output 1 [2024-10-14 01:46:48,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:48,349 INFO L349 Elim1Store]: treesize reduction 70, result has 1.4 percent of original size [2024-10-14 01:46:48,349 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 1 case distinctions, treesize of input 53 treesize of output 1 [2024-10-14 01:46:48,433 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 29 treesize of output 1 [2024-10-14 01:46:48,507 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 29 treesize of output 1 [2024-10-14 01:46:48,602 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 01:46:48,602 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 [2024-10-14 01:46:48,689 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 [2024-10-14 01:46:48,724 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 [2024-10-14 01:46:49,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:49,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:49,236 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 36 treesize of output 33 [2024-10-14 01:46:49,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:49,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:49,273 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 42 treesize of output 39 [2024-10-14 01:46:49,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:49,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:49,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:49,313 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 43 treesize of output 43 [2024-10-14 01:46:49,345 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 27 treesize of output 13 [2024-10-14 01:46:49,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 13 [2024-10-14 01:46:49,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:49,413 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 22 treesize of output 11 [2024-10-14 01:46:49,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:49,472 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 16 treesize of output 20 [2024-10-14 01:46:49,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:49,501 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 22 treesize of output 11 [2024-10-14 01:46:49,605 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-14 01:46:49,605 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 22 treesize of output 30 [2024-10-14 01:46:50,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:50,686 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 01:46:50,687 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 122 treesize of output 73 [2024-10-14 01:46:50,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:46:50,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 42 [2024-10-14 01:46:50,722 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 [2024-10-14 01:46:50,861 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 [2024-10-14 01:46:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:46:50,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:46:59,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:46:59,629 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 263 treesize of output 239 [2024-10-14 01:46:59,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:46:59,690 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 227 treesize of output 215 [2024-10-14 01:47:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:47:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236911638] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:47:00,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:47:00,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-14 01:47:00,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265822273] [2024-10-14 01:47:00,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:47:00,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 01:47:00,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:47:00,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 01:47:00,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=165, Unknown=2, NotChecked=0, Total=210 [2024-10-14 01:47:00,182 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 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) [2024-10-14 01:47:04,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-14 01:47:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:47:04,963 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2024-10-14 01:47:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 01:47:04,964 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 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 [2024-10-14 01:47:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:47:04,964 INFO L225 Difference]: With dead ends: 52 [2024-10-14 01:47:04,964 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 01:47:04,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=99, Invalid=361, Unknown=2, NotChecked=0, Total=462 [2024-10-14 01:47:04,965 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 01:47:04,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 97 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 01:47:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 01:47:04,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-10-14 01:47:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 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) [2024-10-14 01:47:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-10-14 01:47:04,978 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 14 [2024-10-14 01:47:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:47:04,978 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-10-14 01:47:04,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 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) [2024-10-14 01:47:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2024-10-14 01:47:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 01:47:04,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:47:04,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:47:04,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 01:47:05,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:47:05,180 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:47:05,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:47:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1638252987, now seen corresponding path program 1 times [2024-10-14 01:47:05,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:47:05,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460525356] [2024-10-14 01:47:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:47:05,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:47:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:47:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:47:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:47:06,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460525356] [2024-10-14 01:47:06,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460525356] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:47:06,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068978585] [2024-10-14 01:47:06,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:47:06,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:47:06,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:47:06,204 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) [2024-10-14 01:47:06,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 01:47:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:47:06,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-14 01:47:06,312 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:47:06,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-10-14 01:47:06,365 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 [2024-10-14 01:47:06,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 42 [2024-10-14 01:47:06,603 INFO L349 Elim1Store]: treesize reduction 25, result has 54.5 percent of original size [2024-10-14 01:47:06,604 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 42 treesize of output 62 [2024-10-14 01:47:06,713 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 22 treesize of output 7 [2024-10-14 01:47:06,950 INFO L349 Elim1Store]: treesize reduction 90, result has 26.8 percent of original size [2024-10-14 01:47:06,951 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 1 case distinctions, treesize of input 32 treesize of output 44 [2024-10-14 01:47:07,054 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 26 treesize of output 24 [2024-10-14 01:47:07,575 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 01:47:07,575 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 127 treesize of output 110 [2024-10-14 01:47:07,604 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 87 treesize of output 31 [2024-10-14 01:47:07,617 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 39 treesize of output 24 [2024-10-14 01:47:08,076 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 [2024-10-14 01:47:08,092 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 [2024-10-14 01:47:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:47:08,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:47:12,618 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem12#1_22| Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1_22| Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (let ((.cse0 (select |c_#memory_int#1| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse8))) (or (< |v_ULTIMATE.start_main_#t~mem12#1_22| (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (< |v_ULTIMATE.start_main_#t~mem11#1_22| (select .cse0 .cse1)) (< 100 (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_604)) (.cse3 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_606)) (.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| .cse2 (store .cse0 .cse1 (+ |v_ULTIMATE.start_main_#t~mem11#1_22| |v_ULTIMATE.start_main_#t~mem12#1_22|))) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))))) is different from false [2024-10-14 01:47:16,871 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem12#1_22| Int) (v_ArrVal_604 (Array Int Int)) (v_ArrVal_606 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1_22| Int)) (let ((.cse8 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (let ((.cse0 (select |c_#memory_int#1| .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse8))) (or (< |v_ULTIMATE.start_main_#t~mem12#1_22| (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_22| (select .cse0 .cse1)) (< 100 (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_604)) (.cse3 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_606)) (.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| .cse2 (store .cse0 .cse1 (+ |v_ULTIMATE.start_main_#t~mem11#1_22| |v_ULTIMATE.start_main_#t~mem12#1_22|))) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))))))) is different from false [2024-10-14 01:47:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 01:47:16,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068978585] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:47:16,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:47:16,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 6] total 18 [2024-10-14 01:47:16,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315946073] [2024-10-14 01:47:16,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:47:16,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 01:47:16,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:47:16,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 01:47:16,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=226, Unknown=2, NotChecked=62, Total=342 [2024-10-14 01:47:16,974 INFO L87 Difference]: Start difference. First operand 38 states and 48 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) [2024-10-14 01:47:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:47:18,955 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2024-10-14 01:47:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 01:47:18,956 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 [2024-10-14 01:47:18,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:47:18,956 INFO L225 Difference]: With dead ends: 64 [2024-10-14 01:47:18,956 INFO L226 Difference]: Without dead ends: 57 [2024-10-14 01:47:18,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=141, Invalid=417, Unknown=2, NotChecked=90, Total=650 [2024-10-14 01:47:18,957 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 52 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 01:47:18,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 133 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 111 Invalid, 0 Unknown, 63 Unchecked, 0.7s Time] [2024-10-14 01:47:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-14 01:47:18,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2024-10-14 01:47:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 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) [2024-10-14 01:47:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2024-10-14 01:47:18,968 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 15 [2024-10-14 01:47:18,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:47:18,969 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2024-10-14 01:47:18,969 INFO L472 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) [2024-10-14 01:47:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-10-14 01:47:18,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 01:47:18,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:47:18,969 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:47:18,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 01:47:19,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:47:19,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:47:19,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:47:19,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1640101951, now seen corresponding path program 1 times [2024-10-14 01:47:19,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:47:19,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702178377] [2024-10-14 01:47:19,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:47:19,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:47:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:47:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:47:20,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:47:20,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702178377] [2024-10-14 01:47:20,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702178377] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:47:20,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482811592] [2024-10-14 01:47:20,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:47:20,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:47:20,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:47:20,575 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) [2024-10-14 01:47:20,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 01:47:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:47:20,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-14 01:47:20,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:47:20,706 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 [2024-10-14 01:47:20,762 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 [2024-10-14 01:47:20,791 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 [2024-10-14 01:47:20,848 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 16 treesize of output 16 [2024-10-14 01:47:20,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 01:47:21,544 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 01:47:21,545 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 115 treesize of output 100 [2024-10-14 01:47:21,558 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 28 [2024-10-14 01:47:21,576 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 52 treesize of output 35 [2024-10-14 01:47:22,195 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 104 treesize of output 72 [2024-10-14 01:47:22,213 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 80 treesize of output 52 [2024-10-14 01:47:22,230 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 46 treesize of output 22 [2024-10-14 01:47:22,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:47:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:47:22,367 INFO L311 TraceCheckSpWp]: Computing backward predicates...