./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.i --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 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 ../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 23:39:11,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 23:39:11,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 23:39:11,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 23:39:11,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 23:39:11,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 23:39:11,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 23:39:11,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 23:39:11,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 23:39:11,595 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 23:39:11,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 23:39:11,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 23:39:11,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 23:39:11,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 23:39:11,597 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 23:39:11,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 23:39:11,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 23:39:11,598 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 23:39:11,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 23:39:11,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 23:39:11,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 23:39:11,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 23:39:11,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 23:39:11,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 23:39:11,600 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 23:39:11,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 23:39:11,600 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 23:39:11,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 23:39:11,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 23:39:11,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 23:39:11,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 23:39:11,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:39:11,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 23:39:11,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 23:39:11,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 23:39:11,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 23:39:11,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 23:39:11,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 23:39:11,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 23:39:11,603 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 23:39:11,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 23:39:11,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 23:39:11,604 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 23:39:11,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 23:39:11,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 23:39:11,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 23:39:11,858 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 23:39:11,858 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 23:39:11,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.i [2023-11-22 23:39:12,942 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 23:39:13,145 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 23:39:13,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_equal.i [2023-11-22 23:39:13,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/965b9d285/9ffaf00b400e42d59e2b2d543b5d8d7e/FLAG455da2a35 [2023-11-22 23:39:13,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/965b9d285/9ffaf00b400e42d59e2b2d543b5d8d7e [2023-11-22 23:39:13,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 23:39:13,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 23:39:13,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 23:39:13,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 23:39:13,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 23:39:13,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:39:13" (1/1) ... [2023-11-22 23:39:13,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20c6ae03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13, skipping insertion in model container [2023-11-22 23:39:13,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:39:13" (1/1) ... [2023-11-22 23:39:13,239 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 23:39:13,464 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_equal.i[24877,24890] [2023-11-22 23:39:13,471 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:39:13,481 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 23:39:13,538 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_equal.i[24877,24890] [2023-11-22 23:39:13,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 23:39:13,557 INFO L206 MainTranslator]: Completed translation [2023-11-22 23:39:13,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13 WrapperNode [2023-11-22 23:39:13,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 23:39:13,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 23:39:13,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 23:39:13,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 23:39:13,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13" (1/1) ... [2023-11-22 23:39:13,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13" (1/1) ... [2023-11-22 23:39:13,600 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 156 [2023-11-22 23:39:13,602 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 23:39:13,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 23:39:13,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 23:39:13,603 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 23:39:13,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13" (1/1) ... [2023-11-22 23:39:13,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13" (1/1) ... [2023-11-22 23:39:13,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13" (1/1) ... [2023-11-22 23:39:13,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13" (1/1) ... [2023-11-22 23:39:13,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13" (1/1) ... [2023-11-22 23:39:13,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13" (1/1) ... [2023-11-22 23:39:13,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13" (1/1) ... [2023-11-22 23:39:13,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13" (1/1) ... [2023-11-22 23:39:13,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 23:39:13,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 23:39:13,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 23:39:13,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 23:39:13,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13" (1/1) ... [2023-11-22 23:39:13,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 23:39:13,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:39:13,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 23:39:13,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 23:39:13,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 23:39:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 23:39:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-22 23:39:13,691 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-22 23:39:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 23:39:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 23:39:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 23:39:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-22 23:39:13,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-22 23:39:13,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 23:39:13,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-22 23:39:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 23:39:13,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 23:39:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 23:39:13,796 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 23:39:13,798 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 23:39:14,044 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 23:39:14,077 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 23:39:14,077 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-22 23:39:14,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:39:14 BoogieIcfgContainer [2023-11-22 23:39:14,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 23:39:14,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 23:39:14,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 23:39:14,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 23:39:14,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:39:13" (1/3) ... [2023-11-22 23:39:14,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e59cad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:39:14, skipping insertion in model container [2023-11-22 23:39:14,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:39:13" (2/3) ... [2023-11-22 23:39:14,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e59cad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:39:14, skipping insertion in model container [2023-11-22 23:39:14,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:39:14" (3/3) ... [2023-11-22 23:39:14,084 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2023-11-22 23:39:14,097 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 23:39:14,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 23:39:14,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 23:39:14,133 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@40627d0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 23:39:14,134 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 23:39:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 23:39:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 23:39:14,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:14,142 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:39:14,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:14,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:14,146 INFO L85 PathProgramCache]: Analyzing trace with hash -680816188, now seen corresponding path program 1 times [2023-11-22 23:39:14,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:14,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129122346] [2023-11-22 23:39:14,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:14,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:14,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:14,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 23:39:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 23:39:14,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:14,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129122346] [2023-11-22 23:39:14,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129122346] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:39:14,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:39:14,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 23:39:14,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153393085] [2023-11-22 23:39:14,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:39:14,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 23:39:14,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:14,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 23:39:14,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 23:39:14,530 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:39:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:14,633 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2023-11-22 23:39:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 23:39:14,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-22 23:39:14,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:14,640 INFO L225 Difference]: With dead ends: 56 [2023-11-22 23:39:14,640 INFO L226 Difference]: Without dead ends: 25 [2023-11-22 23:39:14,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 23:39:14,647 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:14,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:39:14,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-22 23:39:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-22 23:39:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 23:39:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2023-11-22 23:39:14,676 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 19 [2023-11-22 23:39:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:14,677 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2023-11-22 23:39:14,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:39:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2023-11-22 23:39:14,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 23:39:14,679 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:14,679 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:39:14,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 23:39:14,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:14,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:14,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1161558312, now seen corresponding path program 1 times [2023-11-22 23:39:14,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:14,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085343966] [2023-11-22 23:39:14,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:14,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:14,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:14,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 23:39:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 23:39:14,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:14,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085343966] [2023-11-22 23:39:14,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085343966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:39:14,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:39:14,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 23:39:14,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322247741] [2023-11-22 23:39:14,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:39:14,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:39:14,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:14,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:39:14,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:39:14,859 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 23:39:14,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:14,922 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2023-11-22 23:39:14,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 23:39:14,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-11-22 23:39:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:14,923 INFO L225 Difference]: With dead ends: 35 [2023-11-22 23:39:14,923 INFO L226 Difference]: Without dead ends: 28 [2023-11-22 23:39:14,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:39:14,928 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:14,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 23:39:14,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-22 23:39:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-11-22 23:39:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 23:39:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-11-22 23:39:14,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 19 [2023-11-22 23:39:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:14,938 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-11-22 23:39:14,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-22 23:39:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-11-22 23:39:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 23:39:14,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:14,940 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:39:14,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 23:39:14,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:14,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:14,945 INFO L85 PathProgramCache]: Analyzing trace with hash -112877035, now seen corresponding path program 1 times [2023-11-22 23:39:14,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:14,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328380192] [2023-11-22 23:39:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:14,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-22 23:39:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 23:39:15,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:15,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328380192] [2023-11-22 23:39:15,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328380192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:39:15,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:39:15,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 23:39:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926264147] [2023-11-22 23:39:15,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:39:15,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 23:39:15,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:15,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 23:39:15,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:39:15,092 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:39:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:15,145 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2023-11-22 23:39:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 23:39:15,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-11-22 23:39:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:15,147 INFO L225 Difference]: With dead ends: 47 [2023-11-22 23:39:15,148 INFO L226 Difference]: Without dead ends: 28 [2023-11-22 23:39:15,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 23:39:15,149 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:15,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 57 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:39:15,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-22 23:39:15,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-22 23:39:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-22 23:39:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2023-11-22 23:39:15,153 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 20 [2023-11-22 23:39:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:15,153 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2023-11-22 23:39:15,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 23:39:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2023-11-22 23:39:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 23:39:15,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:15,154 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:39:15,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 23:39:15,154 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:15,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:15,155 INFO L85 PathProgramCache]: Analyzing trace with hash 935091600, now seen corresponding path program 1 times [2023-11-22 23:39:15,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:15,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915009777] [2023-11-22 23:39:15,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:15,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:17,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:17,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 23:39:17,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:17,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915009777] [2023-11-22 23:39:17,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915009777] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:17,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236907443] [2023-11-22 23:39:17,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:17,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:17,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:39:17,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:39:17,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 23:39:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:18,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 143 conjunts are in the unsatisfiable core [2023-11-22 23:39:18,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:39:18,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 23:39:18,381 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 5 treesize of output 3 [2023-11-22 23:39:18,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:18,508 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 12 treesize of output 14 [2023-11-22 23:39:18,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:18,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 23:39:18,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 23:39:18,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:18,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:18,809 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 23:39:18,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-11-22 23:39:18,902 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 11 treesize of output 7 [2023-11-22 23:39:18,917 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 23 treesize of output 11 [2023-11-22 23:39:19,014 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 23:39:19,015 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 66 treesize of output 57 [2023-11-22 23:39:19,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-22 23:39:19,299 INFO L349 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2023-11-22 23:39:19,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 196 treesize of output 170 [2023-11-22 23:39:19,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:19,314 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 44 treesize of output 33 [2023-11-22 23:39:19,328 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 117 treesize of output 88 [2023-11-22 23:39:19,351 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 26 treesize of output 15 [2023-11-22 23:39:19,513 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-22 23:39:19,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 193 treesize of output 113 [2023-11-22 23:39:19,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:19,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:19,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2023-11-22 23:39:19,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-22 23:39:19,528 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 16 treesize of output 12 [2023-11-22 23:39:19,531 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 9 treesize of output 3 [2023-11-22 23:39:19,533 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 7 treesize of output 5 [2023-11-22 23:39:19,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:19,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:39:19,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:19,711 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-11-22 23:39:19,712 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 201 treesize of output 128 [2023-11-22 23:39:19,728 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-22 23:39:19,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-22 23:39:19,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:19,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:19,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:19,753 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-22 23:39:19,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-22 23:39:20,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:20,127 INFO L349 Elim1Store]: treesize reduction 106, result has 4.5 percent of original size [2023-11-22 23:39:20,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 222 treesize of output 140 [2023-11-22 23:39:20,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:20,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:20,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:20,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2023-11-22 23:39:20,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 26 [2023-11-22 23:39:20,146 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 26 treesize of output 15 [2023-11-22 23:39:20,149 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 18 treesize of output 14 [2023-11-22 23:39:20,203 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 28 treesize of output 16 [2023-11-22 23:39:20,206 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 7 treesize of output 3 [2023-11-22 23:39:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 23:39:20,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 23:39:20,338 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (or (not (= v_ArrVal_569 (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_569 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_569) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_567) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_563) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_568) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_565) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_570) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_571) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-11-22 23:39:20,356 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_569) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_567) .cse0 v_ArrVal_563) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_568) .cse0 v_ArrVal_565) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_570) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_571) .cse0 v_ArrVal_566) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= v_ArrVal_569 (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (select v_ArrVal_569 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))))) is different from false [2023-11-22 23:39:20,372 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse2))) (select (select (store (store (store |c_#memory_int| .cse0 v_ArrVal_569) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_567) .cse1 v_ArrVal_563) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_564) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_568) .cse1 v_ArrVal_565) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_570) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_571) .cse1 v_ArrVal_566) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= v_ArrVal_569 (store (select |c_#memory_int| .cse0) .cse2 (select v_ArrVal_569 .cse2))))))) is different from false [2023-11-22 23:39:20,471 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_580 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| Int) (v_ArrVal_582 (Array Int Int)) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_570 (Array Int Int)) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int)) (v_ArrVal_568 (Array Int Int)) (v_ArrVal_567 (Array Int Int)) (v_ArrVal_569 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_582))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse3 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_581) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select .cse2 .cse0) .cse3))) (select (select (store (store (store |c_#memory_int| .cse0 v_ArrVal_569) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_567) .cse1 v_ArrVal_563) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_564) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_568) .cse1 v_ArrVal_565) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_570) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_571) .cse1 v_ArrVal_566) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= v_ArrVal_569 (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| v_ArrVal_580) .cse0) .cse3 (select v_ArrVal_569 .cse3)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_12| 1)))))) is different from false [2023-11-22 23:39:20,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236907443] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:20,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 23:39:20,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 44 [2023-11-22 23:39:20,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879556722] [2023-11-22 23:39:20,475 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 23:39:20,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-22 23:39:20,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:20,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-22 23:39:20,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1939, Unknown=4, NotChecked=364, Total=2450 [2023-11-22 23:39:20,477 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 45 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 23:39:24,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:24,321 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2023-11-22 23:39:24,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-22 23:39:24,321 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2023-11-22 23:39:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:24,325 INFO L225 Difference]: With dead ends: 90 [2023-11-22 23:39:24,325 INFO L226 Difference]: Without dead ends: 88 [2023-11-22 23:39:24,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=337, Invalid=4367, Unknown=4, NotChecked=548, Total=5256 [2023-11-22 23:39:24,329 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 99 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:24,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 362 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1213 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2023-11-22 23:39:24,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-22 23:39:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 47. [2023-11-22 23:39:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 23:39:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2023-11-22 23:39:24,355 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 28 [2023-11-22 23:39:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:24,356 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2023-11-22 23:39:24,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 23:39:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2023-11-22 23:39:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 23:39:24,357 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:24,357 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:39:24,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 23:39:24,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:24,572 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:24,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash 158692931, now seen corresponding path program 1 times [2023-11-22 23:39:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:24,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691112958] [2023-11-22 23:39:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:24,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:24,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:24,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-22 23:39:24,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:24,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691112958] [2023-11-22 23:39:24,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691112958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:39:24,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:39:24,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 23:39:24,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849612869] [2023-11-22 23:39:24,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:39:24,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 23:39:24,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:24,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 23:39:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 23:39:24,714 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 23:39:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:24,763 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2023-11-22 23:39:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 23:39:24,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-22 23:39:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:24,766 INFO L225 Difference]: With dead ends: 56 [2023-11-22 23:39:24,766 INFO L226 Difference]: Without dead ends: 46 [2023-11-22 23:39:24,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 23:39:24,766 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:24,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 64 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:39:24,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-22 23:39:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-22 23:39:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 23:39:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2023-11-22 23:39:24,776 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 29 [2023-11-22 23:39:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:24,777 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2023-11-22 23:39:24,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 23:39:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2023-11-22 23:39:24,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 23:39:24,778 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:24,778 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:39:24,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 23:39:24,778 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:24,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:24,779 INFO L85 PathProgramCache]: Analyzing trace with hash 458760797, now seen corresponding path program 2 times [2023-11-22 23:39:24,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:24,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715405720] [2023-11-22 23:39:24,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:24,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:24,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:24,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:24,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-22 23:39:24,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:24,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715405720] [2023-11-22 23:39:24,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715405720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 23:39:24,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 23:39:24,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 23:39:24,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138311981] [2023-11-22 23:39:24,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 23:39:24,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 23:39:24,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 23:39:24,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 23:39:24,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 23:39:24,919 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 23:39:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 23:39:24,972 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2023-11-22 23:39:24,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 23:39:24,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-11-22 23:39:24,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 23:39:24,977 INFO L225 Difference]: With dead ends: 57 [2023-11-22 23:39:24,978 INFO L226 Difference]: Without dead ends: 46 [2023-11-22 23:39:24,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-22 23:39:24,979 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 23:39:24,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 75 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 23:39:24,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-22 23:39:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-22 23:39:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-22 23:39:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2023-11-22 23:39:24,986 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 29 [2023-11-22 23:39:24,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 23:39:24,987 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2023-11-22 23:39:24,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-22 23:39:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2023-11-22 23:39:24,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 23:39:24,992 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 23:39:24,992 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 23:39:24,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 23:39:24,993 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 23:39:24,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 23:39:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash 976741128, now seen corresponding path program 1 times [2023-11-22 23:39:24,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 23:39:24,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550863248] [2023-11-22 23:39:24,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:24,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 23:39:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:26,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 23:39:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:26,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 23:39:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:26,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 23:39:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 23:39:26,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 23:39:26,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550863248] [2023-11-22 23:39:26,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550863248] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 23:39:26,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735075148] [2023-11-22 23:39:26,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 23:39:26,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 23:39:26,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 23:39:26,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 23:39:26,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 23:39:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 23:39:26,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-22 23:39:26,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 23:39:26,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-22 23:39:26,649 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 5 treesize of output 3 [2023-11-22 23:39:26,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:26,710 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 12 treesize of output 14 [2023-11-22 23:39:26,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:26,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 23:39:26,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:26,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:26,884 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-22 23:39:26,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-11-22 23:39:26,964 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 11 treesize of output 7 [2023-11-22 23:39:27,045 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-22 23:39:27,045 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 50 treesize of output 45 [2023-11-22 23:39:27,250 INFO L349 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2023-11-22 23:39:27,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 147 treesize of output 133 [2023-11-22 23:39:27,256 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 105 treesize of output 80 [2023-11-22 23:39:27,264 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 91 treesize of output 38 [2023-11-22 23:39:27,336 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-22 23:39:27,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 28 [2023-11-22 23:39:27,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:27,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:27,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-22 23:39:27,347 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 7 treesize of output 3 [2023-11-22 23:39:27,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:27,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-22 23:39:27,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:27,448 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-22 23:39:27,449 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 52 [2023-11-22 23:39:27,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:27,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:27,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 23:39:27,466 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-22 23:39:27,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-22 23:39:27,802 INFO L349 Elim1Store]: treesize reduction 205, result has 20.2 percent of original size [2023-11-22 23:39:27,803 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 497 treesize of output 328 [2023-11-22 23:39:27,883 INFO L349 Elim1Store]: treesize reduction 232, result has 16.2 percent of original size [2023-11-22 23:39:27,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 340 treesize of output 192 [2023-11-22 23:39:28,082 INFO L349 Elim1Store]: treesize reduction 193, result has 21.2 percent of original size [2023-11-22 23:39:28,082 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 516 treesize of output 343 [2023-11-22 23:39:28,176 INFO L349 Elim1Store]: treesize reduction 342, result has 12.5 percent of original size [2023-11-22 23:39:28,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 355 treesize of output 193 [2023-11-22 23:39:28,438 INFO L349 Elim1Store]: treesize reduction 449, result has 15.1 percent of original size [2023-11-22 23:39:28,438 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 660 treesize of output 432 [2023-11-22 23:39:28,630 INFO L349 Elim1Store]: treesize reduction 522, result has 24.5 percent of original size [2023-11-22 23:39:28,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 473 treesize of output 378 Killed by 15