./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 07:02:24,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 07:02:24,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 07:02:24,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 07:02:24,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 07:02:24,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 07:02:24,715 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 07:02:24,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 07:02:24,716 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 07:02:24,717 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 07:02:24,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 07:02:24,718 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 07:02:24,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 07:02:24,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 07:02:24,719 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 07:02:24,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 07:02:24,720 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 07:02:24,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 07:02:24,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 07:02:24,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 07:02:24,724 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 07:02:24,724 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 07:02:24,724 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 07:02:24,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 07:02:24,725 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 07:02:24,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 07:02:24,725 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 07:02:24,725 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 07:02:24,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 07:02:24,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 07:02:24,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 07:02:24,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 07:02:24,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 07:02:24,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:02:24,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 07:02:24,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 07:02:24,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 07:02:24,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 07:02:24,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 07:02:24,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 07:02:24,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 07:02:24,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 07:02:24,729 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2024-11-19 07:02:25,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 07:02:25,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 07:02:25,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 07:02:25,051 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 07:02:25,052 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 07:02:25,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2024-11-19 07:02:26,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 07:02:26,906 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 07:02:26,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2024-11-19 07:02:26,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf4f7982/2d7ddb619f4148289c50351ba910993e/FLAG50bd7c19c [2024-11-19 07:02:27,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf4f7982/2d7ddb619f4148289c50351ba910993e [2024-11-19 07:02:27,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 07:02:27,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 07:02:27,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 07:02:27,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 07:02:27,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 07:02:27,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f5be5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27, skipping insertion in model container [2024-11-19 07:02:27,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 07:02:27,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:02:27,691 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 07:02:27,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:02:27,780 INFO L204 MainTranslator]: Completed translation [2024-11-19 07:02:27,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27 WrapperNode [2024-11-19 07:02:27,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 07:02:27,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 07:02:27,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 07:02:27,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 07:02:27,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,839 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 140 [2024-11-19 07:02:27,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 07:02:27,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 07:02:27,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 07:02:27,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 07:02:27,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,896 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-19 07:02:27,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 07:02:27,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 07:02:27,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 07:02:27,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 07:02:27,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27" (1/1) ... [2024-11-19 07:02:27,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:02:27,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:27,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 07:02:27,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 07:02:28,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 07:02:28,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 07:02:28,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 07:02:28,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 07:02:28,031 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-19 07:02:28,031 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-19 07:02:28,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 07:02:28,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 07:02:28,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 07:02:28,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 07:02:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 07:02:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 07:02:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 07:02:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 07:02:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 07:02:28,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 07:02:28,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 07:02:28,170 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 07:02:28,173 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 07:02:28,521 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-11-19 07:02:28,521 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 07:02:28,534 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 07:02:28,534 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 07:02:28,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:02:28 BoogieIcfgContainer [2024-11-19 07:02:28,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 07:02:28,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 07:02:28,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 07:02:28,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 07:02:28,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:02:27" (1/3) ... [2024-11-19 07:02:28,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1542c2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:02:28, skipping insertion in model container [2024-11-19 07:02:28,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:02:27" (2/3) ... [2024-11-19 07:02:28,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1542c2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:02:28, skipping insertion in model container [2024-11-19 07:02:28,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:02:28" (3/3) ... [2024-11-19 07:02:28,547 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2024-11-19 07:02:28,563 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 07:02:28,563 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2024-11-19 07:02:28,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 07:02:28,610 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@3ad1258a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 07:02:28,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-11-19 07:02:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 82 states have internal predecessors, (98), 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) [2024-11-19 07:02:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 07:02:28,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:28,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 07:02:28,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:28,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash 894752021, now seen corresponding path program 1 times [2024-11-19 07:02:28,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:28,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474964470] [2024-11-19 07:02:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:28,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:28,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:28,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474964470] [2024-11-19 07:02:28,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474964470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:28,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:28,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:02:28,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893704363] [2024-11-19 07:02:28,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:28,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:02:28,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:28,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:02:28,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:02:28,995 INFO L87 Difference]: Start difference. First operand has 86 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 82 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:02:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:29,088 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2024-11-19 07:02:29,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:02:29,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 07:02:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:29,097 INFO L225 Difference]: With dead ends: 83 [2024-11-19 07:02:29,097 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 07:02:29,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:02:29,102 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:29,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 143 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 07:02:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 07:02:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 76 states have internal predecessors, (83), 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) [2024-11-19 07:02:29,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2024-11-19 07:02:29,135 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 6 [2024-11-19 07:02:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:29,135 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2024-11-19 07:02:29,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:02:29,136 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2024-11-19 07:02:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 07:02:29,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:29,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 07:02:29,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 07:02:29,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:29,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash 894752022, now seen corresponding path program 1 times [2024-11-19 07:02:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715217600] [2024-11-19 07:02:29,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:29,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:29,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715217600] [2024-11-19 07:02:29,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715217600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:29,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:29,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:02:29,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540578860] [2024-11-19 07:02:29,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:29,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:02:29,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:29,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:02:29,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:02:29,301 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:02:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:29,359 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-19 07:02:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:02:29,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-19 07:02:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:29,361 INFO L225 Difference]: With dead ends: 78 [2024-11-19 07:02:29,361 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 07:02:29,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:02:29,363 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:29,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 144 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 07:02:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-19 07:02:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.588235294117647) internal successors, (81), 74 states have internal predecessors, (81), 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) [2024-11-19 07:02:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-11-19 07:02:29,373 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2024-11-19 07:02:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:29,374 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-11-19 07:02:29,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:02:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-19 07:02:29,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 07:02:29,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:29,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:29,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 07:02:29,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:29,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:29,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1374205737, now seen corresponding path program 1 times [2024-11-19 07:02:29,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:29,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207657175] [2024-11-19 07:02:29,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:29,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:29,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:29,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207657175] [2024-11-19 07:02:29,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207657175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:29,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:29,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:02:29,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723210275] [2024-11-19 07:02:29,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:29,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:02:29,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:29,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:02:29,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:02:29,488 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 07:02:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:29,508 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-11-19 07:02:29,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:02:29,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-19 07:02:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:29,511 INFO L225 Difference]: With dead ends: 85 [2024-11-19 07:02:29,512 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 07:02:29,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:02:29,515 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 5 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:29,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 07:02:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2024-11-19 07:02:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 75 states have internal predecessors, (82), 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) [2024-11-19 07:02:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-11-19 07:02:29,530 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 13 [2024-11-19 07:02:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-11-19 07:02:29,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 07:02:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-19 07:02:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:02:29,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:29,532 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:29,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 07:02:29,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:29,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash -469621220, now seen corresponding path program 1 times [2024-11-19 07:02:29,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:29,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249270790] [2024-11-19 07:02:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:29,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 07:02:29,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:29,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249270790] [2024-11-19 07:02:29,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249270790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:29,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:29,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:02:29,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564991912] [2024-11-19 07:02:29,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:29,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:02:29,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:29,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:02:29,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:29,689 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:29,826 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-19 07:02:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:02:29,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-19 07:02:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:29,828 INFO L225 Difference]: With dead ends: 78 [2024-11-19 07:02:29,829 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 07:02:29,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:29,830 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:29,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 281 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 07:02:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-19 07:02:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 74 states have internal predecessors, (81), 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) [2024-11-19 07:02:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-11-19 07:02:29,841 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 22 [2024-11-19 07:02:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:29,842 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-11-19 07:02:29,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-19 07:02:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:02:29,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:29,843 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:29,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 07:02:29,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:29,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash -469621219, now seen corresponding path program 1 times [2024-11-19 07:02:29,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:29,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111343882] [2024-11-19 07:02:29,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:29,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:30,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:30,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111343882] [2024-11-19 07:02:30,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111343882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:30,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:30,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:02:30,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332990750] [2024-11-19 07:02:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:30,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:02:30,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:30,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:02:30,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:30,142 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:30,250 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2024-11-19 07:02:30,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:02:30,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-19 07:02:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:30,251 INFO L225 Difference]: With dead ends: 77 [2024-11-19 07:02:30,251 INFO L226 Difference]: Without dead ends: 77 [2024-11-19 07:02:30,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:30,252 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:30,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 303 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-19 07:02:30,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-19 07:02:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 73 states have internal predecessors, (80), 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) [2024-11-19 07:02:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2024-11-19 07:02:30,267 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 22 [2024-11-19 07:02:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:30,268 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2024-11-19 07:02:30,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-11-19 07:02:30,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:02:30,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:30,269 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:30,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 07:02:30,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:30,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:30,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1777293115, now seen corresponding path program 1 times [2024-11-19 07:02:30,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:30,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592705756] [2024-11-19 07:02:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:30,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:30,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:30,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592705756] [2024-11-19 07:02:30,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592705756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:30,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212021984] [2024-11-19 07:02:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:30,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:30,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:30,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:30,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 07:02:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:30,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 07:02:30,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:30,766 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 [2024-11-19 07:02:30,804 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2024-11-19 07:02:30,840 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 07:02:30,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-19 07:02:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-19 07:02:30,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:31,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212021984] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:31,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:31,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2024-11-19 07:02:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244851105] [2024-11-19 07:02:31,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:31,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 07:02:31,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:31,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 07:02:31,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-19 07:02:31,115 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:31,299 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2024-11-19 07:02:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:02:31,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2024-11-19 07:02:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:31,301 INFO L225 Difference]: With dead ends: 76 [2024-11-19 07:02:31,303 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 07:02:31,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2024-11-19 07:02:31,304 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:31,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 76 Unchecked, 0.1s Time] [2024-11-19 07:02:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 07:02:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-19 07:02:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 72 states have internal predecessors, (79), 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) [2024-11-19 07:02:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2024-11-19 07:02:31,314 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 25 [2024-11-19 07:02:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:31,315 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2024-11-19 07:02:31,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2024-11-19 07:02:31,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 07:02:31,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:31,316 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:31,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 07:02:31,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 07:02:31,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:31,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:31,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1777293114, now seen corresponding path program 1 times [2024-11-19 07:02:31,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:31,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392228] [2024-11-19 07:02:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:31,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:31,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392228] [2024-11-19 07:02:31,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:31,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143155161] [2024-11-19 07:02:31,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:31,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:31,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:31,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:31,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 07:02:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:32,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 07:02:32,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:32,101 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 8 treesize of output 1 [2024-11-19 07:02:32,106 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 [2024-11-19 07:02:32,279 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2024-11-19 07:02:32,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:32,324 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 14 treesize of output 9 [2024-11-19 07:02:32,335 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:32,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:02:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-19 07:02:32,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:32,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143155161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:32,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:32,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-19 07:02:32,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195813143] [2024-11-19 07:02:32,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:32,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 07:02:32,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:32,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 07:02:32,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2024-11-19 07:02:32,504 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 17 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:02:32,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:32,776 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2024-11-19 07:02:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 07:02:32,777 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2024-11-19 07:02:32,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:32,779 INFO L225 Difference]: With dead ends: 83 [2024-11-19 07:02:32,779 INFO L226 Difference]: Without dead ends: 83 [2024-11-19 07:02:32,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=319, Unknown=1, NotChecked=36, Total=420 [2024-11-19 07:02:32,780 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:32,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 482 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 255 Invalid, 0 Unknown, 87 Unchecked, 0.2s Time] [2024-11-19 07:02:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-19 07:02:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-11-19 07:02:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 77 states have internal predecessors, (85), 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) [2024-11-19 07:02:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2024-11-19 07:02:32,786 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 25 [2024-11-19 07:02:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:32,786 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2024-11-19 07:02:32,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:02:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2024-11-19 07:02:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:02:32,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:32,788 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:32,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:32,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-19 07:02:32,993 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:32,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1307976759, now seen corresponding path program 1 times [2024-11-19 07:02:32,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:32,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645311464] [2024-11-19 07:02:32,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:32,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 07:02:33,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:33,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645311464] [2024-11-19 07:02:33,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645311464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:33,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:33,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:02:33,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037756850] [2024-11-19 07:02:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:33,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:02:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:33,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:02:33,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:33,180 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:33,379 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2024-11-19 07:02:33,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:02:33,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-19 07:02:33,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:33,380 INFO L225 Difference]: With dead ends: 85 [2024-11-19 07:02:33,380 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 07:02:33,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:33,381 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 43 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:33,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 402 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 07:02:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 07:02:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-19 07:02:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 80 states have internal predecessors, (91), 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) [2024-11-19 07:02:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2024-11-19 07:02:33,386 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 30 [2024-11-19 07:02:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:33,387 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2024-11-19 07:02:33,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2024-11-19 07:02:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:02:33,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:33,388 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:33,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 07:02:33,388 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:33,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:33,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1307976758, now seen corresponding path program 1 times [2024-11-19 07:02:33,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:33,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99203135] [2024-11-19 07:02:33,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:33,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:33,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 07:02:33,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:33,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99203135] [2024-11-19 07:02:33,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99203135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:33,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361413559] [2024-11-19 07:02:33,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:33,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:33,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:33,520 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:33,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 07:02:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:33,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:02:33,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:33,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:02:33,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361413559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:33,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:02:33,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-19 07:02:33,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090591366] [2024-11-19 07:02:33,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:33,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:02:33,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:33,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:02:33,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:33,681 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-11-19 07:02:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:33,735 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2024-11-19 07:02:33,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:02:33,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 30 [2024-11-19 07:02:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:33,737 INFO L225 Difference]: With dead ends: 115 [2024-11-19 07:02:33,737 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 07:02:33,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:02:33,737 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 129 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:33,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 224 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 07:02:33,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2024-11-19 07:02:33,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.492063492063492) internal successors, (94), 83 states have internal predecessors, (94), 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) [2024-11-19 07:02:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2024-11-19 07:02:33,749 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 30 [2024-11-19 07:02:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:33,750 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2024-11-19 07:02:33,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-11-19 07:02:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2024-11-19 07:02:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:02:33,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:33,752 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:33,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 07:02:33,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:33,953 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:33,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:33,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1307976703, now seen corresponding path program 1 times [2024-11-19 07:02:33,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:33,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638700714] [2024-11-19 07:02:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:33,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 07:02:34,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638700714] [2024-11-19 07:02:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638700714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:34,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:34,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:02:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587877220] [2024-11-19 07:02:34,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:34,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:02:34,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:34,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:02:34,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:34,252 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:34,450 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-11-19 07:02:34,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:02:34,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-19 07:02:34,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:34,452 INFO L225 Difference]: With dead ends: 88 [2024-11-19 07:02:34,452 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 07:02:34,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:34,452 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 38 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:34,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 458 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 07:02:34,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 07:02:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-19 07:02:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 83 states have internal predecessors, (92), 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) [2024-11-19 07:02:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2024-11-19 07:02:34,464 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 30 [2024-11-19 07:02:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:34,464 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-11-19 07:02:34,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2024-11-19 07:02:34,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:02:34,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:34,465 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:34,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 07:02:34,466 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:34,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:34,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1990660867, now seen corresponding path program 1 times [2024-11-19 07:02:34,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:34,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998274884] [2024-11-19 07:02:34,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:34,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:34,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:34,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998274884] [2024-11-19 07:02:34,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998274884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:34,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812944166] [2024-11-19 07:02:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:34,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:34,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:34,993 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:34,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 07:02:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:35,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 07:02:35,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:35,133 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 [2024-11-19 07:02:35,191 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:35,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:02:35,208 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 [2024-11-19 07:02:35,234 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:35,235 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 34 treesize of output 33 [2024-11-19 07:02:35,366 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 25 treesize of output 13 [2024-11-19 07:02:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:35,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:35,403 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-19 07:02:35,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 07:02:35,409 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2024-11-19 07:02:35,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:35,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-19 07:02:35,472 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 30 treesize of output 22 [2024-11-19 07:02:35,480 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 [2024-11-19 07:02:35,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812944166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:35,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:35,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 22 [2024-11-19 07:02:35,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129498114] [2024-11-19 07:02:35,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:35,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 07:02:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 07:02:35,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=537, Unknown=12, NotChecked=46, Total=650 [2024-11-19 07:02:35,543 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 20 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 07:02:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:36,032 INFO L93 Difference]: Finished difference Result 106 states and 121 transitions. [2024-11-19 07:02:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 07:02:36,033 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 20 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-19 07:02:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:36,034 INFO L225 Difference]: With dead ends: 106 [2024-11-19 07:02:36,035 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 07:02:36,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=783, Unknown=12, NotChecked=56, Total=930 [2024-11-19 07:02:36,036 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 19 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:36,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1068 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 07:02:36,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 07:02:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2024-11-19 07:02:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 92 states have internal predecessors, (104), 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) [2024-11-19 07:02:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2024-11-19 07:02:36,046 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 33 [2024-11-19 07:02:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:36,046 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2024-11-19 07:02:36,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 20 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 07:02:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2024-11-19 07:02:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:02:36,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:36,047 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:36,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 07:02:36,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:36,255 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:36,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:36,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1990660866, now seen corresponding path program 1 times [2024-11-19 07:02:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:36,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218723158] [2024-11-19 07:02:36,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:36,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:37,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:37,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218723158] [2024-11-19 07:02:37,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218723158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:37,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599594558] [2024-11-19 07:02:37,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:37,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:37,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:37,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:37,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 07:02:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:37,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-19 07:02:37,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:37,258 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 8 treesize of output 1 [2024-11-19 07:02:37,265 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 [2024-11-19 07:02:37,397 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:37,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:02:37,425 WARN L851 $PredicateComparison]: unable to prove that (and (or (< 7 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 8 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse0) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-11-19 07:02:37,429 WARN L873 $PredicateComparison]: unable to prove that (and (or (< 7 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 8 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse0) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2024-11-19 07:02:37,454 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 [2024-11-19 07:02:37,463 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 [2024-11-19 07:02:37,508 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:37,508 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 [2024-11-19 07:02:37,515 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 [2024-11-19 07:02:37,674 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 25 treesize of output 13 [2024-11-19 07:02:37,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 07:02:37,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:37,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:37,915 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_551 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)))) is different from false [2024-11-19 07:02:37,932 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_551 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))) (forall ((v_ArrVal_551 (Array Int Int)) (v_ArrVal_550 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_551) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2024-11-19 07:02:37,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:37,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2024-11-19 07:02:37,944 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 34 treesize of output 26 [2024-11-19 07:02:37,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:37,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2024-11-19 07:02:37,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:37,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-11-19 07:02:37,965 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:37,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-19 07:02:37,970 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:37,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-19 07:02:38,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599594558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:38,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:38,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 24 [2024-11-19 07:02:38,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473444509] [2024-11-19 07:02:38,161 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:38,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 07:02:38,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:38,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 07:02:38,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=974, Unknown=4, NotChecked=192, Total=1260 [2024-11-19 07:02:38,163 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 21 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:38,359 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (and (or (< 7 .cse0) (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 8 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse1) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse1 (select |c_#length| .cse1))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (<= 8 .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from false [2024-11-19 07:02:38,362 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (and (or (< 7 .cse0) (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 8 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse1) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse1 (select |c_#length| .cse1))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (<= 8 .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from true [2024-11-19 07:02:38,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:38,749 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2024-11-19 07:02:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 07:02:38,750 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 21 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-19 07:02:38,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:38,750 INFO L225 Difference]: With dead ends: 106 [2024-11-19 07:02:38,750 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 07:02:38,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=1293, Unknown=6, NotChecked=300, Total=1722 [2024-11-19 07:02:38,752 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 18 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:38,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 907 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 633 Invalid, 0 Unknown, 133 Unchecked, 0.4s Time] [2024-11-19 07:02:38,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 07:02:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2024-11-19 07:02:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 89 states have internal predecessors, (98), 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) [2024-11-19 07:02:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2024-11-19 07:02:38,757 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 33 [2024-11-19 07:02:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:38,757 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2024-11-19 07:02:38,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 21 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2024-11-19 07:02:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 07:02:38,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:38,758 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:38,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:38,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 07:02:38,963 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:38,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1132191561, now seen corresponding path program 2 times [2024-11-19 07:02:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:38,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524226088] [2024-11-19 07:02:38,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:02:38,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:38,985 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:02:38,985 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:39,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:39,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524226088] [2024-11-19 07:02:39,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524226088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:39,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:39,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 07:02:39,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481599894] [2024-11-19 07:02:39,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:39,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:02:39,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:39,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:02:39,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:39,080 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2024-11-19 07:02:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:39,124 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2024-11-19 07:02:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:02:39,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 36 [2024-11-19 07:02:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:39,125 INFO L225 Difference]: With dead ends: 120 [2024-11-19 07:02:39,126 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 07:02:39,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-19 07:02:39,126 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 113 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:39,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 294 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 07:02:39,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 98. [2024-11-19 07:02:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 93 states have internal predecessors, (102), 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) [2024-11-19 07:02:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2024-11-19 07:02:39,131 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 36 [2024-11-19 07:02:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:39,131 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2024-11-19 07:02:39,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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) [2024-11-19 07:02:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2024-11-19 07:02:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 07:02:39,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:39,132 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:39,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 07:02:39,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:39,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:39,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1379691596, now seen corresponding path program 2 times [2024-11-19 07:02:39,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:39,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349496750] [2024-11-19 07:02:39,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:02:39,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:39,156 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:02:39,156 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:02:39,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:39,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349496750] [2024-11-19 07:02:39,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349496750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:39,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602767270] [2024-11-19 07:02:39,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:02:39,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:39,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:39,216 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:39,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 07:02:39,351 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:02:39,352 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:39,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:02:39,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:39,376 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 07:02:39,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:02:39,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602767270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:39,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:02:39,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-19 07:02:39,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022913525] [2024-11-19 07:02:39,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:39,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 07:02:39,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:39,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 07:02:39,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:02:39,378 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:39,391 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2024-11-19 07:02:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:02:39,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-11-19 07:02:39,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:39,393 INFO L225 Difference]: With dead ends: 84 [2024-11-19 07:02:39,393 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 07:02:39,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:02:39,394 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:39,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:39,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 07:02:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 07:02:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 80 states have internal predecessors, (87), 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) [2024-11-19 07:02:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2024-11-19 07:02:39,397 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 37 [2024-11-19 07:02:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:39,397 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2024-11-19 07:02:39,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-11-19 07:02:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 07:02:39,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:39,398 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:39,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 07:02:39,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:39,599 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:39,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:39,600 INFO L85 PathProgramCache]: Analyzing trace with hash -929319762, now seen corresponding path program 1 times [2024-11-19 07:02:39,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:39,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011254978] [2024-11-19 07:02:39,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:39,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 07:02:39,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:39,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011254978] [2024-11-19 07:02:39,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011254978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:39,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:39,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:02:39,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433119364] [2024-11-19 07:02:39,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:39,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:02:39,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:39,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:02:39,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:39,751 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:39,935 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2024-11-19 07:02:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:02:39,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2024-11-19 07:02:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:39,936 INFO L225 Difference]: With dead ends: 87 [2024-11-19 07:02:39,936 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 07:02:39,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:39,937 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 31 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:39,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 384 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 07:02:39,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 07:02:39,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-19 07:02:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.453125) internal successors, (93), 83 states have internal predecessors, (93), 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) [2024-11-19 07:02:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-11-19 07:02:39,942 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 40 [2024-11-19 07:02:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:39,943 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-11-19 07:02:39,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2024-11-19 07:02:39,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 07:02:39,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:39,945 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:39,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 07:02:39,945 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:39,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash -929319761, now seen corresponding path program 1 times [2024-11-19 07:02:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027115601] [2024-11-19 07:02:39,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:39,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:40,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:40,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:40,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027115601] [2024-11-19 07:02:40,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027115601] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:40,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393039862] [2024-11-19 07:02:40,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:40,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:40,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:40,034 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:40,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 07:02:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:40,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 07:02:40,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:40,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:02:40,216 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:02:40,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393039862] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:40,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:40,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-11-19 07:02:40,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017849159] [2024-11-19 07:02:40,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:40,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:02:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:40,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:02:40,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:40,259 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:40,314 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2024-11-19 07:02:40,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:02:40,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-11-19 07:02:40,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:40,316 INFO L225 Difference]: With dead ends: 111 [2024-11-19 07:02:40,316 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 07:02:40,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:40,316 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 155 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:40,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 210 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 07:02:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2024-11-19 07:02:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.475) internal successors, (118), 99 states have internal predecessors, (118), 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) [2024-11-19 07:02:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2024-11-19 07:02:40,322 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 40 [2024-11-19 07:02:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:40,322 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2024-11-19 07:02:40,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2024-11-19 07:02:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 07:02:40,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:40,324 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:40,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 07:02:40,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:40,525 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:40,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:40,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1295717653, now seen corresponding path program 1 times [2024-11-19 07:02:40,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:40,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466409953] [2024-11-19 07:02:40,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:40,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 07:02:40,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:40,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466409953] [2024-11-19 07:02:40,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466409953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:40,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346065475] [2024-11-19 07:02:40,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:40,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:40,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:40,656 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:40,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 07:02:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:40,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 07:02:40,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:02:40,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 07:02:40,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346065475] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:40,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:40,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2024-11-19 07:02:40,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249645716] [2024-11-19 07:02:40,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:40,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 07:02:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:40,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 07:02:40,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:02:40,883 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:40,947 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2024-11-19 07:02:40,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:02:40,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-11-19 07:02:40,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:40,948 INFO L225 Difference]: With dead ends: 102 [2024-11-19 07:02:40,948 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 07:02:40,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:40,949 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 95 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:40,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 309 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 07:02:40,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2024-11-19 07:02:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 90 states have internal predecessors, (107), 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) [2024-11-19 07:02:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2024-11-19 07:02:40,954 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 41 [2024-11-19 07:02:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:40,954 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2024-11-19 07:02:40,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2024-11-19 07:02:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 07:02:40,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:40,955 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:40,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 07:02:41,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 07:02:41,156 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:41,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash -789371781, now seen corresponding path program 2 times [2024-11-19 07:02:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:41,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343387728] [2024-11-19 07:02:41,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:02:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:41,177 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 07:02:41,177 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 07:02:41,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:41,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343387728] [2024-11-19 07:02:41,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343387728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:41,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:41,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:02:41,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529370681] [2024-11-19 07:02:41,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:41,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:02:41,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:41,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:02:41,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:41,363 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:41,505 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2024-11-19 07:02:41,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:02:41,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-19 07:02:41,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:41,506 INFO L225 Difference]: With dead ends: 94 [2024-11-19 07:02:41,506 INFO L226 Difference]: Without dead ends: 94 [2024-11-19 07:02:41,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:41,507 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:41,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 425 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-19 07:02:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-19 07:02:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 90 states have internal predecessors, (103), 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) [2024-11-19 07:02:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2024-11-19 07:02:41,510 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 45 [2024-11-19 07:02:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:41,510 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2024-11-19 07:02:41,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2024-11-19 07:02:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 07:02:41,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:41,511 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:41,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 07:02:41,512 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:41,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:41,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1228758467, now seen corresponding path program 1 times [2024-11-19 07:02:41,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:41,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158776366] [2024-11-19 07:02:41,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:41,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 07:02:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158776366] [2024-11-19 07:02:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158776366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:41,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:41,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 07:02:41,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217435988] [2024-11-19 07:02:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:41,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:02:41,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:41,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:02:41,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:41,597 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (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) [2024-11-19 07:02:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:41,635 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2024-11-19 07:02:41,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:02:41,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (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 48 [2024-11-19 07:02:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:41,636 INFO L225 Difference]: With dead ends: 90 [2024-11-19 07:02:41,637 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 07:02:41,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-19 07:02:41,637 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 66 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:41,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 171 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 07:02:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-19 07:02:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 86 states have internal predecessors, (95), 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) [2024-11-19 07:02:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2024-11-19 07:02:41,640 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 48 [2024-11-19 07:02:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:41,640 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2024-11-19 07:02:41,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (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) [2024-11-19 07:02:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2024-11-19 07:02:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 07:02:41,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:41,641 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:41,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 07:02:41,641 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:41,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:41,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1228758522, now seen corresponding path program 1 times [2024-11-19 07:02:41,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:41,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876967317] [2024-11-19 07:02:41,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:41,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:42,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:42,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876967317] [2024-11-19 07:02:42,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876967317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:42,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510414732] [2024-11-19 07:02:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:42,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:42,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:42,510 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:42,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 07:02:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:42,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-19 07:02:42,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:42,695 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 [2024-11-19 07:02:42,784 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:42,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:02:42,853 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 [2024-11-19 07:02:42,933 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:42,934 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 34 treesize of output 33 [2024-11-19 07:02:43,185 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:43,185 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 34 treesize of output 33 [2024-11-19 07:02:43,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:43,264 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 37 treesize of output 17 [2024-11-19 07:02:43,323 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 25 treesize of output 13 [2024-11-19 07:02:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 07:02:43,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:43,364 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1145 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1145) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1145 .cse0))) v_ArrVal_1145)))) is different from false [2024-11-19 07:02:43,478 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1144) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2024-11-19 07:02:43,615 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1)) is different from false [2024-11-19 07:02:43,620 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1144) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)) is different from false [2024-11-19 07:02:43,629 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-19 07:02:43,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-19 07:02:43,638 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1143))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1144)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2024-11-19 07:02:43,647 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1143))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1144)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2024-11-19 07:02:43,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:43,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2024-11-19 07:02:43,657 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 136 treesize of output 112 [2024-11-19 07:02:43,663 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 52 treesize of output 48 [2024-11-19 07:02:43,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2024-11-19 07:02:43,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510414732] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:43,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:43,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 38 [2024-11-19 07:02:43,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611429115] [2024-11-19 07:02:43,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:43,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-19 07:02:43,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:43,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-19 07:02:43,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1639, Unknown=53, NotChecked=522, Total=2352 [2024-11-19 07:02:43,739 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 39 states, 38 states have (on average 2.0) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:44,396 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2024-11-19 07:02:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 07:02:44,397 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.0) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2024-11-19 07:02:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:44,398 INFO L225 Difference]: With dead ends: 89 [2024-11-19 07:02:44,398 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 07:02:44,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=2316, Unknown=54, NotChecked=618, Total=3192 [2024-11-19 07:02:44,399 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 52 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:44,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1203 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 07:02:44,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 07:02:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-19 07:02:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.273972602739726) internal successors, (93), 85 states have internal predecessors, (93), 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) [2024-11-19 07:02:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2024-11-19 07:02:44,403 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 48 [2024-11-19 07:02:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:44,403 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2024-11-19 07:02:44,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.0) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2024-11-19 07:02:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 07:02:44,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:44,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:44,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 07:02:44,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:44,609 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:44,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:44,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1228758521, now seen corresponding path program 1 times [2024-11-19 07:02:44,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:44,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652758701] [2024-11-19 07:02:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:44,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:45,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:45,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652758701] [2024-11-19 07:02:45,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652758701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:45,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640341461] [2024-11-19 07:02:45,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:45,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:45,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:45,964 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:45,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 07:02:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:46,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-19 07:02:46,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:46,147 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 [2024-11-19 07:02:46,152 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 8 treesize of output 1 [2024-11-19 07:02:46,286 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:46,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:02:46,296 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 14 treesize of output 9 [2024-11-19 07:02:46,372 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 [2024-11-19 07:02:46,378 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 [2024-11-19 07:02:46,459 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:46,459 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 [2024-11-19 07:02:46,464 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 [2024-11-19 07:02:46,708 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:46,709 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 [2024-11-19 07:02:46,713 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 [2024-11-19 07:02:46,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:46,792 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 37 treesize of output 17 [2024-11-19 07:02:46,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:46,800 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 27 treesize of output 11 [2024-11-19 07:02:46,868 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 25 treesize of output 13 [2024-11-19 07:02:46,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 07:02:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 07:02:46,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:47,110 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_1260 (Array Int Int))) (or (not (= v_ArrVal_1260 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1260 .cse0)))) (forall ((v_ArrVal_1261 (Array Int Int))) (or (< (+ 7 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1260) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= v_ArrVal_1261 (store .cse1 .cse0 (select v_ArrVal_1261 .cse0)))))))) (forall ((v_ArrVal_1261 (Array Int Int))) (or (not (= v_ArrVal_1261 (store .cse1 .cse0 (select v_ArrVal_1261 .cse0)))) (< 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1261) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2024-11-19 07:02:47,238 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1258 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1258) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1258 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1258) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1259) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2024-11-19 07:02:47,256 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1258 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1258) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1258 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1258) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1259) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2024-11-19 07:02:47,267 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1258 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1258) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1258 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1258) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1259) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2024-11-19 07:02:47,291 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_1258 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1258) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1258 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1258) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1259) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2024-11-19 07:02:47,406 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1258 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1258) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1258 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1258) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1259) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2024-11-19 07:02:47,416 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1256 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1256) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1257) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1258) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1256 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1257))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1256) .cse0 v_ArrVal_1258) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1259) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2024-11-19 07:02:47,432 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1256 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1256) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1257) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1258) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))) (forall ((v_ArrVal_1259 (Array Int Int)) (v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 (Array Int Int)) (v_ArrVal_1256 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1257))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1256) .cse0 v_ArrVal_1258) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1259) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2024-11-19 07:02:47,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:47,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-19 07:02:47,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:47,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-19 07:02:47,451 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 334 treesize of output 290 [2024-11-19 07:02:47,464 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 698 treesize of output 662 [2024-11-19 07:02:47,471 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 74 treesize of output 70 [2024-11-19 07:02:47,474 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 70 treesize of output 66 [2024-11-19 07:02:47,479 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 36 treesize of output 30 [2024-11-19 07:02:47,484 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 30 treesize of output 28 [2024-11-19 07:02:47,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:47,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-19 07:02:47,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:47,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-19 07:02:47,516 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:47,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-19 07:02:47,522 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:47,522 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:02:47,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2024-11-19 07:02:47,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640341461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:47,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:02:47,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 39 [2024-11-19 07:02:47,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443127578] [2024-11-19 07:02:47,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:47,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-19 07:02:47,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:47,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-19 07:02:47,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2098, Unknown=22, NotChecked=792, Total=3080 [2024-11-19 07:02:47,723 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 36 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:48,478 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2024-11-19 07:02:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 07:02:48,479 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 36 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2024-11-19 07:02:48,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:48,481 INFO L225 Difference]: With dead ends: 88 [2024-11-19 07:02:48,482 INFO L226 Difference]: Without dead ends: 88 [2024-11-19 07:02:48,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=236, Invalid=2854, Unknown=22, NotChecked=920, Total=4032 [2024-11-19 07:02:48,484 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 68 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:48,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1256 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 07:02:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-19 07:02:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-11-19 07:02:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 82 states have internal predecessors, (89), 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) [2024-11-19 07:02:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2024-11-19 07:02:48,491 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 48 [2024-11-19 07:02:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:48,491 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2024-11-19 07:02:48,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 36 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 07:02:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2024-11-19 07:02:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-19 07:02:48,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:48,492 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:48,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:48,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-19 07:02:48,692 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:48,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1292317738, now seen corresponding path program 1 times [2024-11-19 07:02:48,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:48,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309029297] [2024-11-19 07:02:48,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:48,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 07:02:48,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:48,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309029297] [2024-11-19 07:02:48,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309029297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:48,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544462237] [2024-11-19 07:02:48,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:48,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:48,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:48,868 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:48,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 07:02:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:49,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:02:49,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 07:02:49,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:02:49,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544462237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:49,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:02:49,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-19 07:02:49,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498634691] [2024-11-19 07:02:49,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:49,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:02:49,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:49,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:02:49,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:02:49,124 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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) [2024-11-19 07:02:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:49,170 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-19 07:02:49,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:02:49,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 51 [2024-11-19 07:02:49,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:49,172 INFO L225 Difference]: With dead ends: 90 [2024-11-19 07:02:49,172 INFO L226 Difference]: Without dead ends: 90 [2024-11-19 07:02:49,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:02:49,172 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 80 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:49,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 196 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-19 07:02:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-11-19 07:02:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 82 states have internal predecessors, (88), 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) [2024-11-19 07:02:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2024-11-19 07:02:49,178 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 51 [2024-11-19 07:02:49,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:49,178 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2024-11-19 07:02:49,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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) [2024-11-19 07:02:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2024-11-19 07:02:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 07:02:49,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:49,179 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:49,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:49,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-19 07:02:49,380 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:49,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2010491737, now seen corresponding path program 1 times [2024-11-19 07:02:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:49,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928985058] [2024-11-19 07:02:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:49,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:02:51,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:51,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928985058] [2024-11-19 07:02:51,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928985058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:51,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986593275] [2024-11-19 07:02:51,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:51,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:51,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:51,356 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:51,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 07:02:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:51,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-19 07:02:51,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:51,568 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 [2024-11-19 07:02:51,786 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:02:51,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:02:51,853 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 [2024-11-19 07:02:51,958 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:51,958 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 25 treesize of output 26 [2024-11-19 07:02:52,392 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:02:52,392 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 59 [2024-11-19 07:02:52,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-19 07:02:52,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2024-11-19 07:02:52,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:52,546 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 45 treesize of output 25 [2024-11-19 07:02:52,550 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 26 treesize of output 21 [2024-11-19 07:02:52,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:02:52,560 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 37 treesize of output 21 [2024-11-19 07:02:52,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-11-19 07:02:52,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-19 07:02:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 07:02:52,931 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:53,146 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (or (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1480 .cse0)) v_ArrVal_1480)) (not (= (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1481 .cse0)) v_ArrVal_1481)) (= (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1482) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1481) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))))) is different from false [2024-11-19 07:02:53,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:53,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2024-11-19 07:02:53,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:53,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 78 [2024-11-19 07:02:53,365 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 29 treesize of output 18 [2024-11-19 07:02:53,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:53,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2024-11-19 07:02:53,594 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 13 treesize of output 11 [2024-11-19 07:02:53,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1475 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1475) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-19 07:02:53,774 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1475 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1475) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-11-19 07:02:53,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:02:53,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-19 07:02:53,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-19 07:02:53,783 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 6 treesize of output 4 [2024-11-19 07:02:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-19 07:02:54,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986593275] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:54,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:54,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29, 30] total 81 [2024-11-19 07:02:54,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125507605] [2024-11-19 07:02:54,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:54,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2024-11-19 07:02:54,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:54,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2024-11-19 07:02:54,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=5700, Unknown=34, NotChecked=462, Total=6480 [2024-11-19 07:02:54,136 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 81 states, 79 states have (on average 1.6708860759493671) internal successors, (132), 73 states have internal predecessors, (132), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 07:02:56,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:56,013 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-11-19 07:02:56,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 07:02:56,014 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 79 states have (on average 1.6708860759493671) internal successors, (132), 73 states have internal predecessors, (132), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2024-11-19 07:02:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:56,014 INFO L225 Difference]: With dead ends: 86 [2024-11-19 07:02:56,014 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 07:02:56,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2437 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=499, Invalid=8599, Unknown=34, NotChecked=570, Total=9702 [2024-11-19 07:02:56,017 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 149 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:56,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1923 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1813 Invalid, 0 Unknown, 248 Unchecked, 0.9s Time] [2024-11-19 07:02:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 07:02:56,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-19 07:02:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 82 states have internal predecessors, (87), 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) [2024-11-19 07:02:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-19 07:02:56,020 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 54 [2024-11-19 07:02:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:56,020 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-19 07:02:56,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 79 states have (on average 1.6708860759493671) internal successors, (132), 73 states have internal predecessors, (132), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 07:02:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-19 07:02:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 07:02:56,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:56,022 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:56,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:56,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-19 07:02:56,226 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:56,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:56,226 INFO L85 PathProgramCache]: Analyzing trace with hash 756204572, now seen corresponding path program 1 times [2024-11-19 07:02:56,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:56,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384673505] [2024-11-19 07:02:56,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:56,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-19 07:02:57,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:57,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384673505] [2024-11-19 07:02:57,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384673505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:57,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958786251] [2024-11-19 07:02:57,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:57,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:57,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:57,127 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:57,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 07:02:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:57,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-19 07:02:57,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:57,421 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 17 treesize of output 13 [2024-11-19 07:02:57,591 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 30 treesize of output 12 [2024-11-19 07:02:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 07:02:57,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:57,779 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 38 treesize of output 32 [2024-11-19 07:02:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 07:02:57,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958786251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:57,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:57,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 12] total 32 [2024-11-19 07:02:57,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478665701] [2024-11-19 07:02:57,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:57,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 07:02:57,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:57,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 07:02:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=918, Unknown=0, NotChecked=0, Total=992 [2024-11-19 07:02:57,818 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 32 states, 32 states have (on average 3.53125) internal successors, (113), 31 states have internal predecessors, (113), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:58,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:58,457 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-19 07:02:58,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 07:02:58,457 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.53125) internal successors, (113), 31 states have internal predecessors, (113), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2024-11-19 07:02:58,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:58,458 INFO L225 Difference]: With dead ends: 92 [2024-11-19 07:02:58,458 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 07:02:58,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=1685, Unknown=0, NotChecked=0, Total=1892 [2024-11-19 07:02:58,459 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 163 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:58,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1304 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 07:02:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 07:02:58,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-11-19 07:02:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 86 states have internal predecessors, (91), 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) [2024-11-19 07:02:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-19 07:02:58,464 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 61 [2024-11-19 07:02:58,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:58,465 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-19 07:02:58,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.53125) internal successors, (113), 31 states have internal predecessors, (113), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:58,465 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-19 07:02:58,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 07:02:58,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:58,467 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:58,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-19 07:02:58,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 07:02:58,668 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:58,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:58,668 INFO L85 PathProgramCache]: Analyzing trace with hash 876365713, now seen corresponding path program 1 times [2024-11-19 07:02:58,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:58,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414368154] [2024-11-19 07:02:58,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:58,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 07:02:58,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:58,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414368154] [2024-11-19 07:02:58,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414368154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:58,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:58,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:02:58,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827290972] [2024-11-19 07:02:58,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:58,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:02:58,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:58,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:02:58,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:58,841 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:58,976 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2024-11-19 07:02:58,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:02:58,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2024-11-19 07:02:58,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:58,977 INFO L225 Difference]: With dead ends: 104 [2024-11-19 07:02:58,977 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 07:02:58,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:58,977 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 21 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:58,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 298 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 07:02:58,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2024-11-19 07:02:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 89 states have internal predecessors, (97), 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) [2024-11-19 07:02:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2024-11-19 07:02:58,980 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 63 [2024-11-19 07:02:58,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:58,980 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2024-11-19 07:02:58,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2024-11-19 07:02:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 07:02:58,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:58,981 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:58,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 07:02:58,981 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:58,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash 876365714, now seen corresponding path program 1 times [2024-11-19 07:02:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:58,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852144876] [2024-11-19 07:02:58,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:02:58,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:02:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:02:59,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:59,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852144876] [2024-11-19 07:02:59,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852144876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:02:59,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:02:59,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:02:59,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595492057] [2024-11-19 07:02:59,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:02:59,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:02:59,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:59,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:02:59,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:59,287 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:59,400 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-11-19 07:02:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:02:59,401 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2024-11-19 07:02:59,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:59,402 INFO L225 Difference]: With dead ends: 91 [2024-11-19 07:02:59,402 INFO L226 Difference]: Without dead ends: 91 [2024-11-19 07:02:59,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:02:59,403 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 20 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:59,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 335 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:02:59,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-19 07:02:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-19 07:02:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 87 states have internal predecessors, (94), 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) [2024-11-19 07:02:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2024-11-19 07:02:59,406 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 63 [2024-11-19 07:02:59,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:59,406 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2024-11-19 07:02:59,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:02:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2024-11-19 07:02:59,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 07:02:59,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:59,407 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:59,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 07:02:59,407 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:02:59,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:02:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1946647213, now seen corresponding path program 2 times [2024-11-19 07:02:59,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:02:59,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831924970] [2024-11-19 07:02:59,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:02:59,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:02:59,430 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:02:59,431 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 07:02:59,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:02:59,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831924970] [2024-11-19 07:02:59,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831924970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:02:59,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883976955] [2024-11-19 07:02:59,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 07:02:59,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:02:59,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:02:59,521 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:02:59,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 07:02:59,753 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 07:02:59,753 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 07:02:59,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 07:02:59,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:02:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 07:02:59,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:02:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 07:02:59,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883976955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:02:59,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:02:59,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-19 07:02:59,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491089373] [2024-11-19 07:02:59,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:02:59,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 07:02:59,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:02:59,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 07:02:59,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 07:02:59,876 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:02:59,922 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2024-11-19 07:02:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 07:02:59,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2024-11-19 07:02:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:02:59,923 INFO L225 Difference]: With dead ends: 80 [2024-11-19 07:02:59,923 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 07:02:59,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:02:59,924 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 84 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:02:59,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 273 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:02:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 07:02:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 07:02:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 76 states have internal predecessors, (82), 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) [2024-11-19 07:02:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-19 07:02:59,928 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 64 [2024-11-19 07:02:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:02:59,928 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-19 07:02:59,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:02:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-19 07:02:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 07:02:59,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:02:59,929 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:02:59,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-19 07:03:00,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:00,130 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:03:00,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:00,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1397567211, now seen corresponding path program 1 times [2024-11-19 07:03:00,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:00,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512368655] [2024-11-19 07:03:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:00,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:03:00,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:00,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512368655] [2024-11-19 07:03:00,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512368655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:00,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:00,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:03:00,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383101338] [2024-11-19 07:03:00,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:00,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:03:00,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:00,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:03:00,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:00,273 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:03:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:00,365 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2024-11-19 07:03:00,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:03:00,365 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2024-11-19 07:03:00,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:00,366 INFO L225 Difference]: With dead ends: 80 [2024-11-19 07:03:00,366 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 07:03:00,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:00,367 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 17 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:00,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 354 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 07:03:00,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 07:03:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.173913043478261) internal successors, (81), 76 states have internal predecessors, (81), 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) [2024-11-19 07:03:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-11-19 07:03:00,369 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 64 [2024-11-19 07:03:00,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:00,370 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-11-19 07:03:00,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:03:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-19 07:03:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 07:03:00,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:00,370 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:00,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 07:03:00,372 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:03:00,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1295155679, now seen corresponding path program 1 times [2024-11-19 07:03:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:00,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319773231] [2024-11-19 07:03:00,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:00,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 07:03:00,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:00,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319773231] [2024-11-19 07:03:00,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319773231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:00,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975627144] [2024-11-19 07:03:00,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:00,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:00,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:00,539 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:00,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-19 07:03:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:00,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-19 07:03:00,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:00,783 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 [2024-11-19 07:03:00,886 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:00,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:03:00,933 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 [2024-11-19 07:03:00,978 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:03:00,979 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 34 treesize of output 33 [2024-11-19 07:03:01,169 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:03:01,169 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 34 treesize of output 33 [2024-11-19 07:03:01,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:01,217 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 37 treesize of output 17 [2024-11-19 07:03:01,308 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 25 treesize of output 13 [2024-11-19 07:03:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 07:03:01,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:01,352 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1958 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1958) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= v_ArrVal_1958 (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1958 .cse0))))))) is different from false [2024-11-19 07:03:01,380 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1957 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1957) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-19 07:03:01,385 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1957 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1957) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2024-11-19 07:03:01,472 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1957 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1957) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1)) is different from false [2024-11-19 07:03:01,476 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1957 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1957) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)) is different from false [2024-11-19 07:03:01,483 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-19 07:03:01,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-19 07:03:01,487 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1956))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1957)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2024-11-19 07:03:01,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:01,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2024-11-19 07:03:01,535 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 236 treesize of output 200 [2024-11-19 07:03:01,539 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 155 treesize of output 147 [2024-11-19 07:03:01,546 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 147 treesize of output 135 [2024-11-19 07:03:01,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975627144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:01,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:03:01,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 22] total 27 [2024-11-19 07:03:01,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888973304] [2024-11-19 07:03:01,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:01,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 07:03:01,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:01,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 07:03:01,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=875, Unknown=49, NotChecked=390, Total=1406 [2024-11-19 07:03:01,626 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:03:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:02,082 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-11-19 07:03:02,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 07:03:02,082 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 66 [2024-11-19 07:03:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:02,083 INFO L225 Difference]: With dead ends: 87 [2024-11-19 07:03:02,083 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 07:03:02,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=1325, Unknown=53, NotChecked=474, Total=1980 [2024-11-19 07:03:02,084 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:02,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 655 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 07:03:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 07:03:02,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2024-11-19 07:03:02,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 76 states have internal predecessors, (82), 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) [2024-11-19 07:03:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-19 07:03:02,087 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 66 [2024-11-19 07:03:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:02,087 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-19 07:03:02,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 25 states have internal predecessors, (95), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 07:03:02,087 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-19 07:03:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 07:03:02,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:02,088 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:02,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-19 07:03:02,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-19 07:03:02,293 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:03:02,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:02,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1295155678, now seen corresponding path program 1 times [2024-11-19 07:03:02,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:02,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112286419] [2024-11-19 07:03:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:02,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 07:03:03,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:03,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112286419] [2024-11-19 07:03:03,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112286419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:03,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909005312] [2024-11-19 07:03:03,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:03,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:03,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:03,524 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:03,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-19 07:03:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:03,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-11-19 07:03:03,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:03,767 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 [2024-11-19 07:03:03,873 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:03,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:03:03,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 [2024-11-19 07:03:03,969 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 [2024-11-19 07:03:04,083 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:03:04,084 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 [2024-11-19 07:03:04,087 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 [2024-11-19 07:03:04,407 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:03:04,407 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 [2024-11-19 07:03:04,414 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 [2024-11-19 07:03:04,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:04,518 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 27 treesize of output 11 [2024-11-19 07:03:04,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:04,524 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 37 treesize of output 17 [2024-11-19 07:03:04,737 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 25 treesize of output 13 [2024-11-19 07:03:04,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 07:03:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 07:03:04,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:05,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:05,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2024-11-19 07:03:05,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:05,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2024-11-19 07:03:05,784 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 136 treesize of output 112 [2024-11-19 07:03:05,788 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 28 treesize of output 22 [2024-11-19 07:03:05,791 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 46 treesize of output 42 [2024-11-19 07:03:05,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:05,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-19 07:03:05,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:05,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-19 07:03:05,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:05,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-19 07:03:05,817 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:05,818 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:05,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 07:03:05,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:05,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-19 07:03:05,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:05,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-19 07:03:05,836 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:05,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-19 07:03:05,841 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:05,841 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:03:05,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 07:03:06,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909005312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:06,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:03:06,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22] total 42 [2024-11-19 07:03:06,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015546848] [2024-11-19 07:03:06,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:06,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-19 07:03:06,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:06,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-19 07:03:06,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3211, Unknown=9, NotChecked=0, Total=3422 [2024-11-19 07:03:06,020 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 39 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:03:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:06,601 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-11-19 07:03:06,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 07:03:06,601 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 39 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 66 [2024-11-19 07:03:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:06,602 INFO L225 Difference]: With dead ends: 82 [2024-11-19 07:03:06,602 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 07:03:06,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=255, Invalid=4026, Unknown=9, NotChecked=0, Total=4290 [2024-11-19 07:03:06,603 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 40 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:06,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 854 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 07:03:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 07:03:06,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 07:03:06,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 78 states have internal predecessors, (83), 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) [2024-11-19 07:03:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-11-19 07:03:06,606 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 66 [2024-11-19 07:03:06,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:06,606 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-11-19 07:03:06,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 39 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 07:03:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-11-19 07:03:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 07:03:06,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:06,607 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:06,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-19 07:03:06,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:06,807 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:03:06,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:06,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1495121768, now seen corresponding path program 1 times [2024-11-19 07:03:06,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:06,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293596952] [2024-11-19 07:03:06,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:06,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 07:03:06,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:06,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293596952] [2024-11-19 07:03:06,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293596952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:06,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:06,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 07:03:06,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786187537] [2024-11-19 07:03:06,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:06,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:03:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:06,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:03:06,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:06,968 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:03:07,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:07,088 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-11-19 07:03:07,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 07:03:07,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2024-11-19 07:03:07,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:07,089 INFO L225 Difference]: With dead ends: 81 [2024-11-19 07:03:07,089 INFO L226 Difference]: Without dead ends: 81 [2024-11-19 07:03:07,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:07,089 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 11 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:07,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 300 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-19 07:03:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-19 07:03:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.125) internal successors, (81), 77 states have internal predecessors, (81), 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) [2024-11-19 07:03:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-19 07:03:07,093 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 67 [2024-11-19 07:03:07,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:07,094 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-19 07:03:07,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 07:03:07,094 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-19 07:03:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 07:03:07,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:07,095 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:07,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 07:03:07,095 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:03:07,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2003447581, now seen corresponding path program 1 times [2024-11-19 07:03:07,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:07,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400628727] [2024-11-19 07:03:07,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:07,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:03:08,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:08,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400628727] [2024-11-19 07:03:08,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400628727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:08,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810667434] [2024-11-19 07:03:08,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:08,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:08,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:08,028 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:08,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-19 07:03:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:08,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-19 07:03:08,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:08,249 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 [2024-11-19 07:03:08,387 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 [2024-11-19 07:03:08,459 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:08,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:03:08,552 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 [2024-11-19 07:03:08,565 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 15 treesize of output 1 [2024-11-19 07:03:08,685 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-19 07:03:08,686 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 53 treesize of output 35 [2024-11-19 07:03:08,702 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 [2024-11-19 07:03:08,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 07:03:09,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:09,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:09,022 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 07:03:09,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 45 [2024-11-19 07:03:09,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:09,156 INFO L349 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2024-11-19 07:03:09,156 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 48 treesize of output 30 [2024-11-19 07:03:09,344 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-19 07:03:09,344 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 36 treesize of output 19 [2024-11-19 07:03:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 07:03:09,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:10,549 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-19 07:03:10,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 153 treesize of output 107 [2024-11-19 07:03:10,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:10,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 125 [2024-11-19 07:03:10,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:10,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-19 07:03:10,591 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 29 treesize of output 21 [2024-11-19 07:03:10,607 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 11 treesize of output 9 [2024-11-19 07:03:10,633 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 6 treesize of output 4 [2024-11-19 07:03:10,677 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-19 07:03:10,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2024-11-19 07:03:10,722 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 13 treesize of output 1 [2024-11-19 07:03:10,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2024-11-19 07:03:10,771 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-19 07:03:10,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-19 07:03:10,875 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-19 07:03:10,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:10,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 236 [2024-11-19 07:03:11,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810667434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:11,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 07:03:11,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 45 [2024-11-19 07:03:11,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466367061] [2024-11-19 07:03:11,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:11,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-19 07:03:11,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:11,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-19 07:03:11,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3329, Unknown=7, NotChecked=0, Total=3540 [2024-11-19 07:03:11,381 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 46 states, 45 states have (on average 2.422222222222222) internal successors, (109), 41 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:03:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:12,416 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2024-11-19 07:03:12,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 07:03:12,417 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.422222222222222) internal successors, (109), 41 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 69 [2024-11-19 07:03:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:12,417 INFO L225 Difference]: With dead ends: 82 [2024-11-19 07:03:12,417 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 07:03:12,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=322, Invalid=5221, Unknown=7, NotChecked=0, Total=5550 [2024-11-19 07:03:12,419 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 76 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:12,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 863 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 07:03:12,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 07:03:12,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 07:03:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 78 states have internal predecessors, (82), 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) [2024-11-19 07:03:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-11-19 07:03:12,422 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 69 [2024-11-19 07:03:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:12,422 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-11-19 07:03:12,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.422222222222222) internal successors, (109), 41 states have internal predecessors, (109), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 07:03:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-11-19 07:03:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-19 07:03:12,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:12,423 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:12,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-19 07:03:12,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:12,623 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:03:12,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1933404287, now seen corresponding path program 1 times [2024-11-19 07:03:12,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:12,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809385230] [2024-11-19 07:03:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:12,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:03:13,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:13,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809385230] [2024-11-19 07:03:13,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809385230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:13,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523838844] [2024-11-19 07:03:13,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:13,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:13,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:13,426 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:13,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-19 07:03:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:13,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-19 07:03:13,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:13,665 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 [2024-11-19 07:03:13,721 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:13,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:03:13,771 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 [2024-11-19 07:03:13,832 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:03:13,832 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 25 treesize of output 26 [2024-11-19 07:03:13,937 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:03:13,937 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 25 treesize of output 26 [2024-11-19 07:03:13,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:13,985 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 28 treesize of output 12 [2024-11-19 07:03:14,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:14,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2024-11-19 07:03:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:03:14,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:14,280 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2347 (Array Int Int))) (or (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_2347 .cse0))) v_ArrVal_2347)) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2347) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2024-11-19 07:03:14,352 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2346 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| Int) (v_DerPreprocessor_21 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2346) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| 4) v_DerPreprocessor_21) 0) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2024-11-19 07:03:14,364 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2346 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| Int) (v_DerPreprocessor_21 Int)) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2346) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| 4) v_DerPreprocessor_21) 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-19 07:03:14,371 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2346 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| Int) (v_DerPreprocessor_21 Int)) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2346) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| 4) v_DerPreprocessor_21) 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2024-11-19 07:03:18,605 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2346 (Array Int Int)) (v_ArrVal_2345 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| Int) (v_DerPreprocessor_21 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2345))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2346)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| 4) v_DerPreprocessor_21) 0))))) is different from false [2024-11-19 07:03:18,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:18,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2024-11-19 07:03:18,706 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 285 treesize of output 267 [2024-11-19 07:03:18,711 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 223 treesize of output 217 [2024-11-19 07:03:18,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:18,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 240 [2024-11-19 07:03:18,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:18,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 251 treesize of output 247 [2024-11-19 07:03:19,224 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 5 not checked. [2024-11-19 07:03:19,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523838844] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:19,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:19,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 26] total 57 [2024-11-19 07:03:19,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143912675] [2024-11-19 07:03:19,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:19,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-19 07:03:19,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:19,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-19 07:03:19,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2430, Unknown=60, NotChecked=520, Total=3192 [2024-11-19 07:03:19,227 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 57 states, 57 states have (on average 2.3333333333333335) internal successors, (133), 51 states have internal predecessors, (133), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 07:03:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:20,126 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2024-11-19 07:03:20,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 07:03:20,126 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.3333333333333335) internal successors, (133), 51 states have internal predecessors, (133), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 70 [2024-11-19 07:03:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:20,127 INFO L225 Difference]: With dead ends: 80 [2024-11-19 07:03:20,127 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 07:03:20,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=226, Invalid=3156, Unknown=60, NotChecked=590, Total=4032 [2024-11-19 07:03:20,128 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 83 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:20,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 979 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1145 Invalid, 0 Unknown, 316 Unchecked, 0.6s Time] [2024-11-19 07:03:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 07:03:20,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-11-19 07:03:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 75 states have internal predecessors, (78), 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) [2024-11-19 07:03:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-11-19 07:03:20,130 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 70 [2024-11-19 07:03:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:20,131 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-11-19 07:03:20,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.3333333333333335) internal successors, (133), 51 states have internal predecessors, (133), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 07:03:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-11-19 07:03:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-19 07:03:20,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:20,132 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:20,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-19 07:03:20,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:20,333 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2024-11-19 07:03:20,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1841498918, now seen corresponding path program 1 times [2024-11-19 07:03:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:20,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787780164] [2024-11-19 07:03:20,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:20,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:21,842 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 07:03:21,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:21,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787780164] [2024-11-19 07:03:21,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787780164] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:21,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999908945] [2024-11-19 07:03:21,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:21,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:21,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:21,844 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 07:03:21,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-19 07:03:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:22,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-19 07:03:22,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:22,081 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 [2024-11-19 07:03:22,188 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:03:22,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:03:22,262 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 15 treesize of output 1 [2024-11-19 07:03:22,264 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 [2024-11-19 07:03:22,366 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-19 07:03:22,366 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 47 treesize of output 33 [2024-11-19 07:03:22,369 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 27 treesize of output 22 [2024-11-19 07:03:22,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:22,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:22,715 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 07:03:22,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 66 [2024-11-19 07:03:22,725 INFO L349 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2024-11-19 07:03:22,725 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 1 case distinctions, treesize of input 57 treesize of output 28 [2024-11-19 07:03:22,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:03:22,839 INFO L349 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2024-11-19 07:03:22,840 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 50 treesize of output 32 [2024-11-19 07:03:22,843 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 27 treesize of output 20 [2024-11-19 07:03:22,846 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 [2024-11-19 07:03:23,161 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-19 07:03:23,162 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 36 [2024-11-19 07:03:23,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:23,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-19 07:03:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 07:03:23,373 INFO L311 TraceCheckSpWp]: Computing backward predicates...