./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.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-ext3-properties/dll_nondet_free_order-2.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 2f737570030041640fd86c7d2770b30b4e6ee4ac0d1c521887700aab87fb1426 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 07:03:49,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 07:03:49,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 07:03:49,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 07:03:49,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 07:03:49,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 07:03:49,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 07:03:49,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 07:03:49,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 07:03:49,461 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 07:03:49,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 07:03:49,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 07:03:49,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 07:03:49,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 07:03:49,463 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 07:03:49,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 07:03:49,464 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 07:03:49,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 07:03:49,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 07:03:49,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 07:03:49,465 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 07:03:49,466 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 07:03:49,466 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 07:03:49,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 07:03:49,467 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 07:03:49,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 07:03:49,467 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 07:03:49,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 07:03:49,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 07:03:49,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 07:03:49,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 07:03:49,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 07:03:49,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 07:03:49,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:03:49,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 07:03:49,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 07:03:49,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 07:03:49,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 07:03:49,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 07:03:49,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 07:03:49,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 07:03:49,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 07:03:49,476 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 -> 2f737570030041640fd86c7d2770b30b4e6ee4ac0d1c521887700aab87fb1426 [2024-11-19 07:03:49,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 07:03:49,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 07:03:49,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 07:03:49,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 07:03:49,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 07:03:49,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2024-11-19 07:03:51,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 07:03:51,618 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 07:03:51,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2024-11-19 07:03:51,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd164722/8cb9ccd92b1d404cb8e8fd3a6ef67e63/FLAG1ea32d491 [2024-11-19 07:03:51,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd164722/8cb9ccd92b1d404cb8e8fd3a6ef67e63 [2024-11-19 07:03:51,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 07:03:51,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 07:03:51,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 07:03:51,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 07:03:51,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 07:03:51,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:03:51" (1/1) ... [2024-11-19 07:03:51,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ba59cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:51, skipping insertion in model container [2024-11-19 07:03:51,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:03:51" (1/1) ... [2024-11-19 07:03:51,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 07:03:52,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:03:52,095 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 07:03:52,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 07:03:52,181 INFO L204 MainTranslator]: Completed translation [2024-11-19 07:03:52,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:52 WrapperNode [2024-11-19 07:03:52,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 07:03:52,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 07:03:52,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 07:03:52,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 07:03:52,191 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:03:52" (1/1) ... [2024-11-19 07:03:52,208 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:03:52" (1/1) ... [2024-11-19 07:03:52,234 INFO L138 Inliner]: procedures = 116, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 129 [2024-11-19 07:03:52,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 07:03:52,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 07:03:52,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 07:03:52,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 07:03:52,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:52" (1/1) ... [2024-11-19 07:03:52,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:52" (1/1) ... [2024-11-19 07:03:52,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:52" (1/1) ... [2024-11-19 07:03:52,283 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6]. [2024-11-19 07:03:52,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:52" (1/1) ... [2024-11-19 07:03:52,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:52" (1/1) ... [2024-11-19 07:03:52,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:52" (1/1) ... [2024-11-19 07:03:52,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:52" (1/1) ... [2024-11-19 07:03:52,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:52" (1/1) ... [2024-11-19 07:03:52,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:52" (1/1) ... [2024-11-19 07:03:52,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 07:03:52,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 07:03:52,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 07:03:52,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 07:03:52,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:52" (1/1) ... [2024-11-19 07:03:52,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 07:03:52,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:52,340 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:03:52,342 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:03:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-19 07:03:52,386 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-19 07:03:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 07:03:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 07:03:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 07:03:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 07:03:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 07:03:52,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 07:03:52,485 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 07:03:52,487 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 07:03:52,515 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-19 07:03:52,885 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-19 07:03:52,886 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 07:03:52,906 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 07:03:52,906 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 07:03:52,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:03:52 BoogieIcfgContainer [2024-11-19 07:03:52,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 07:03:52,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 07:03:52,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 07:03:52,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 07:03:52,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:03:51" (1/3) ... [2024-11-19 07:03:52,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7747c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:03:52, skipping insertion in model container [2024-11-19 07:03:52,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:03:52" (2/3) ... [2024-11-19 07:03:52,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7747c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:03:52, skipping insertion in model container [2024-11-19 07:03:52,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:03:52" (3/3) ... [2024-11-19 07:03:52,917 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2024-11-19 07:03:52,938 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 07:03:52,939 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-19 07:03:53,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 07:03:53,008 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;@3c96d294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 07:03:53,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-19 07:03:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 131 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 07:03:53,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:53,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 07:03:53,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:53,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:53,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-19 07:03:53,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:53,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40437622] [2024-11-19 07:03:53,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:53,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:53,337 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:03:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:53,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40437622] [2024-11-19 07:03:53,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40437622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:53,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:53,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:03:53,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691155529] [2024-11-19 07:03:53,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:53,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:03:53,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:03:53,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:53,389 INFO L87 Difference]: Start difference. First operand has 133 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 131 states have internal predecessors, (139), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:53,545 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2024-11-19 07:03:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:03:53,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 07:03:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:53,557 INFO L225 Difference]: With dead ends: 130 [2024-11-19 07:03:53,557 INFO L226 Difference]: Without dead ends: 124 [2024-11-19 07:03:53,559 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:03:53,562 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 17 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 196 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:53,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 196 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-19 07:03:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-19 07:03:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 123 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2024-11-19 07:03:53,611 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 4 [2024-11-19 07:03:53,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:53,611 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2024-11-19 07:03:53,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:53,612 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2024-11-19 07:03:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 07:03:53,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:53,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 07:03:53,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 07:03:53,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:53,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:53,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-19 07:03:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:53,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926478184] [2024-11-19 07:03:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:53,749 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:03:53,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:53,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926478184] [2024-11-19 07:03:53,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926478184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:53,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:53,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:03:53,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134541319] [2024-11-19 07:03:53,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:53,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:03:53,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:53,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:03:53,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:53,757 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:53,808 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2024-11-19 07:03:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:03:53,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 07:03:53,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:53,814 INFO L225 Difference]: With dead ends: 121 [2024-11-19 07:03:53,814 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 07:03:53,814 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:03:53,815 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 15 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:53,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 216 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 07:03:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-19 07:03:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 120 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2024-11-19 07:03:53,834 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 4 [2024-11-19 07:03:53,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:53,835 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2024-11-19 07:03:53,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:53,836 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2024-11-19 07:03:53,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 07:03:53,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:53,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:53,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 07:03:53,837 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:53,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:53,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2024-11-19 07:03:53,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:53,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438617234] [2024-11-19 07:03:53,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:53,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:53,969 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:03:53,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:53,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438617234] [2024-11-19 07:03:53,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438617234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:53,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:53,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 07:03:53,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599697919] [2024-11-19 07:03:53,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:53,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:03:53,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:53,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:03:53,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:53,973 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:54,000 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2024-11-19 07:03:54,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:03:54,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 07:03:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:54,003 INFO L225 Difference]: With dead ends: 130 [2024-11-19 07:03:54,003 INFO L226 Difference]: Without dead ends: 130 [2024-11-19 07:03:54,003 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:03:54,004 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 241 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:03:54,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 241 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:54,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-19 07:03:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2024-11-19 07:03:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 69 states have (on average 1.8405797101449275) internal successors, (127), 121 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2024-11-19 07:03:54,020 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 9 [2024-11-19 07:03:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:54,020 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2024-11-19 07:03:54,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2024-11-19 07:03:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 07:03:54,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:54,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:54,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 07:03:54,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:54,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2024-11-19 07:03:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:54,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004372348] [2024-11-19 07:03:54,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:54,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:54,099 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:03:54,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:54,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004372348] [2024-11-19 07:03:54,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004372348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:54,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:54,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:03:54,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248510602] [2024-11-19 07:03:54,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:54,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:03:54,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:54,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:03:54,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:54,102 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:54,170 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2024-11-19 07:03:54,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:03:54,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 07:03:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:54,173 INFO L225 Difference]: With dead ends: 121 [2024-11-19 07:03:54,173 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 07:03:54,174 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:03:54,175 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:54,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 195 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 07:03:54,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-19 07:03:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.826086956521739) internal successors, (126), 120 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2024-11-19 07:03:54,187 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 9 [2024-11-19 07:03:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:54,187 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2024-11-19 07:03:54,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2024-11-19 07:03:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 07:03:54,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:54,189 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:54,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 07:03:54,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:54,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:54,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2024-11-19 07:03:54,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:54,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970217370] [2024-11-19 07:03:54,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:54,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:54,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:54,294 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:03:54,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:54,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970217370] [2024-11-19 07:03:54,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970217370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:54,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:54,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 07:03:54,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633247016] [2024-11-19 07:03:54,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:54,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 07:03:54,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:54,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 07:03:54,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 07:03:54,299 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:54,331 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2024-11-19 07:03:54,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 07:03:54,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 07:03:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:54,332 INFO L225 Difference]: With dead ends: 120 [2024-11-19 07:03:54,333 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 07:03:54,333 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:03:54,336 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:54,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 225 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:54,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 07:03:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-19 07:03:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 69 states have (on average 1.8115942028985508) internal successors, (125), 119 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2024-11-19 07:03:54,344 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 9 [2024-11-19 07:03:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:54,344 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2024-11-19 07:03:54,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2024-11-19 07:03:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 07:03:54,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:54,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:54,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 07:03:54,346 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:54,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2024-11-19 07:03:54,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:54,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399772607] [2024-11-19 07:03:54,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:54,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:54,507 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:03:54,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:54,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399772607] [2024-11-19 07:03:54,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399772607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:54,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:54,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 07:03:54,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73992033] [2024-11-19 07:03:54,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:54,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:03:54,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:54,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:03:54,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:54,511 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:54,646 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2024-11-19 07:03:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:03:54,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-19 07:03:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:54,650 INFO L225 Difference]: With dead ends: 123 [2024-11-19 07:03:54,650 INFO L226 Difference]: Without dead ends: 123 [2024-11-19 07:03:54,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:54,651 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 16 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:54,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 327 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-19 07:03:54,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-19 07:03:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 122 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2024-11-19 07:03:54,661 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 10 [2024-11-19 07:03:54,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:54,662 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2024-11-19 07:03:54,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2024-11-19 07:03:54,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 07:03:54,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:54,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:54,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 07:03:54,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:54,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:54,663 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2024-11-19 07:03:54,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:54,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450582766] [2024-11-19 07:03:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:54,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:54,823 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:03:54,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:54,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450582766] [2024-11-19 07:03:54,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450582766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:54,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:54,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:03:54,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293504749] [2024-11-19 07:03:54,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:54,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:03:54,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:54,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:03:54,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:54,825 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:54,888 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2024-11-19 07:03:54,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:03:54,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-19 07:03:54,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:54,889 INFO L225 Difference]: With dead ends: 123 [2024-11-19 07:03:54,889 INFO L226 Difference]: Without dead ends: 123 [2024-11-19 07:03:54,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:03:54,890 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 31 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:54,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 316 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:54,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-19 07:03:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-19 07:03:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.7777777777777777) internal successors, (128), 122 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2024-11-19 07:03:54,895 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 10 [2024-11-19 07:03:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:54,895 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2024-11-19 07:03:54,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2024-11-19 07:03:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 07:03:54,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:54,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:54,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 07:03:54,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:54,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2024-11-19 07:03:54,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:54,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408443554] [2024-11-19 07:03:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:54,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:54,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408443554] [2024-11-19 07:03:54,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408443554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:54,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137757574] [2024-11-19 07:03:54,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:54,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:54,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:54,950 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:03:54,952 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:03:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:55,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 07:03:55,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:55,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:55,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137757574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:55,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:55,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-19 07:03:55,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31974915] [2024-11-19 07:03:55,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:55,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:03:55,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:55,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:03:55,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:55,142 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:55,154 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2024-11-19 07:03:55,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 07:03:55,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 07:03:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:55,156 INFO L225 Difference]: With dead ends: 125 [2024-11-19 07:03:55,156 INFO L226 Difference]: Without dead ends: 125 [2024-11-19 07:03:55,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:55,157 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:55,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 237 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 07:03:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-19 07:03:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-19 07:03:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 124 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2024-11-19 07:03:55,162 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 14 [2024-11-19 07:03:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:55,162 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2024-11-19 07:03:55,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2024-11-19 07:03:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 07:03:55,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:55,163 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:55,185 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:03:55,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:55,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:55,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:55,365 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2024-11-19 07:03:55,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:55,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959864318] [2024-11-19 07:03:55,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:55,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:55,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959864318] [2024-11-19 07:03:55,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959864318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:55,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394144150] [2024-11-19 07:03:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:55,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:55,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:55,475 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:03:55,481 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:03:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:55,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 07:03:55,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:55,602 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:55,634 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 07:03:55,634 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:03:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:55,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:55,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394144150] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:55,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:55,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-19 07:03:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624848300] [2024-11-19 07:03:55,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:55,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 07:03:55,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:55,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 07:03:55,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 07:03:55,685 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:55,793 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2024-11-19 07:03:55,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 07:03:55,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 07:03:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:55,794 INFO L225 Difference]: With dead ends: 123 [2024-11-19 07:03:55,794 INFO L226 Difference]: Without dead ends: 123 [2024-11-19 07:03:55,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:55,795 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 7 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:55,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 259 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:55,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-19 07:03:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-19 07:03:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.7297297297297298) internal successors, (128), 122 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2024-11-19 07:03:55,799 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 15 [2024-11-19 07:03:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:55,799 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2024-11-19 07:03:55,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2024-11-19 07:03:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 07:03:55,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:55,800 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:55,817 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:03:56,000 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,SelfDestructingSolverStorable8 [2024-11-19 07:03:56,001 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:56,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:56,002 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2024-11-19 07:03:56,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:56,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876304023] [2024-11-19 07:03:56,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:56,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:56,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:56,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876304023] [2024-11-19 07:03:56,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876304023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:56,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080060538] [2024-11-19 07:03:56,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:56,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:56,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:56,173 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:03:56,174 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:03:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:56,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 07:03:56,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:56,263 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:56,302 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 07:03:56,302 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:03:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:56,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:56,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080060538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:56,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:56,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 9 [2024-11-19 07:03:56,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231312072] [2024-11-19 07:03:56,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:56,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 07:03:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:56,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 07:03:56,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-19 07:03:56,447 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:56,601 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2024-11-19 07:03:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:03:56,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 07:03:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:56,603 INFO L225 Difference]: With dead ends: 121 [2024-11-19 07:03:56,603 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 07:03:56,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-19 07:03:56,604 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 18 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:56,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 585 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 07:03:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-19 07:03:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 74 states have (on average 1.7027027027027026) internal successors, (126), 120 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2024-11-19 07:03:56,607 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 15 [2024-11-19 07:03:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:56,607 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2024-11-19 07:03:56,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2024-11-19 07:03:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:03:56,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:56,608 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:56,625 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:03:56,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:56,809 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:56,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:56,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2024-11-19 07:03:56,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:56,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874134855] [2024-11-19 07:03:56,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:56,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:56,917 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:03:56,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:56,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874134855] [2024-11-19 07:03:56,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874134855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:56,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:56,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:03:56,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241200420] [2024-11-19 07:03:56,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:56,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:03:56,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:56,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:03:56,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:56,920 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:57,068 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2024-11-19 07:03:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:03:57,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 07:03:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:57,069 INFO L225 Difference]: With dead ends: 118 [2024-11-19 07:03:57,069 INFO L226 Difference]: Without dead ends: 118 [2024-11-19 07:03:57,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:03:57,070 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 24 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:57,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 351 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-19 07:03:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-19 07:03:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 74 states have (on average 1.662162162162162) internal successors, (123), 117 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2024-11-19 07:03:57,073 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 22 [2024-11-19 07:03:57,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:57,073 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2024-11-19 07:03:57,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2024-11-19 07:03:57,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 07:03:57,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:57,074 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 07:03:57,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 07:03:57,075 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:57,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:57,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2024-11-19 07:03:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:57,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164186258] [2024-11-19 07:03:57,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:57,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:57,233 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:03:57,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:57,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164186258] [2024-11-19 07:03:57,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164186258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:57,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:57,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:03:57,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408637910] [2024-11-19 07:03:57,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:57,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:03:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:57,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:03:57,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:57,235 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:57,331 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2024-11-19 07:03:57,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:03:57,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-19 07:03:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:57,334 INFO L225 Difference]: With dead ends: 111 [2024-11-19 07:03:57,334 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 07:03:57,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:03:57,335 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 32 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:57,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 409 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:57,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 07:03:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-19 07:03:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 110 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2024-11-19 07:03:57,337 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 22 [2024-11-19 07:03:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:57,338 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2024-11-19 07:03:57,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2024-11-19 07:03:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 07:03:57,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:57,340 INFO L215 NwaCegarLoop]: trace histogram [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:03:57,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 07:03:57,340 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:57,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:57,341 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2024-11-19 07:03:57,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:57,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750108357] [2024-11-19 07:03:57,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:57,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:57,469 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:03:57,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:57,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750108357] [2024-11-19 07:03:57,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750108357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:57,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:57,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 07:03:57,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957156661] [2024-11-19 07:03:57,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:57,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 07:03:57,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:57,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 07:03:57,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 07:03:57,472 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:57,628 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2024-11-19 07:03:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 07:03:57,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 07:03:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:57,629 INFO L225 Difference]: With dead ends: 106 [2024-11-19 07:03:57,629 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 07:03:57,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 07:03:57,630 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 37 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:57,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 285 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 07:03:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 07:03:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 74 states have (on average 1.5) internal successors, (111), 105 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:57,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2024-11-19 07:03:57,633 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 28 [2024-11-19 07:03:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:57,633 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2024-11-19 07:03:57,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2024-11-19 07:03:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 07:03:57,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:57,635 INFO L215 NwaCegarLoop]: trace histogram [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:03:57,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 07:03:57,636 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:57,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:57,637 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2024-11-19 07:03:57,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:57,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606384488] [2024-11-19 07:03:57,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:57,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:58,045 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:03:58,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:58,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606384488] [2024-11-19 07:03:58,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606384488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:03:58,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:03:58,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:03:58,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963188648] [2024-11-19 07:03:58,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:03:58,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:03:58,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:58,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:03:58,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:03:58,048 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:03:58,226 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-19 07:03:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 07:03:58,227 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 07:03:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:03:58,228 INFO L225 Difference]: With dead ends: 101 [2024-11-19 07:03:58,228 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 07:03:58,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-19 07:03:58,229 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 60 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 07:03:58,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 588 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 07:03:58,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 07:03:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-19 07:03:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2024-11-19 07:03:58,232 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 28 [2024-11-19 07:03:58,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:03:58,232 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2024-11-19 07:03:58,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:03:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2024-11-19 07:03:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-19 07:03:58,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:03:58,233 INFO L215 NwaCegarLoop]: trace histogram [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:03:58,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 07:03:58,233 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:03:58,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:03:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2024-11-19 07:03:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:03:58,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346065440] [2024-11-19 07:03:58,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:58,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:03:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:58,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:58,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:03:58,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346065440] [2024-11-19 07:03:58,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346065440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:03:58,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610379509] [2024-11-19 07:03:58,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:03:58,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:03:58,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:03:58,739 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:03:58,741 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:03:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:03:58,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-19 07:03:58,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:03:58,860 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:58,998 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-19 07:03:58,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 07:03:59,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:03:59,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:03:59,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:03:59,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-19 07:03:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:03:59,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:03:59,216 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) is different from false [2024-11-19 07:03:59,229 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2024-11-19 07:03:59,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:03:59,277 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 21 treesize of output 22 [2024-11-19 07:03:59,283 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 122 treesize of output 110 [2024-11-19 07:03:59,293 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 23 treesize of output 21 [2024-11-19 07:03:59,300 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 20 treesize of output 16 [2024-11-19 07:03:59,497 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 07:03:59,497 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 25 treesize of output 24 [2024-11-19 07:03:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-19 07:03:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610379509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:03:59,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:03:59,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 28 [2024-11-19 07:03:59,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019970428] [2024-11-19 07:03:59,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:03:59,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 07:03:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:03:59,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 07:03:59,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=606, Unknown=17, NotChecked=102, Total=812 [2024-11-19 07:03:59,506 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:00,151 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-19 07:04:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 07:04:00,152 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-19 07:04:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:00,153 INFO L225 Difference]: With dead ends: 101 [2024-11-19 07:04:00,154 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 07:04:00,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=1122, Unknown=20, NotChecked=142, Total=1482 [2024-11-19 07:04:00,155 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 73 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:00,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1042 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 676 Invalid, 0 Unknown, 146 Unchecked, 0.4s Time] [2024-11-19 07:04:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 07:04:00,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-19 07:04:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-11-19 07:04:00,160 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 28 [2024-11-19 07:04:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:00,161 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-11-19 07:04:00,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-11-19 07:04:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:04:00,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:00,162 INFO L215 NwaCegarLoop]: trace histogram [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:04:00,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 07:04:00,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 07:04:00,368 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:04:00,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:00,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2024-11-19 07:04:00,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:00,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702971005] [2024-11-19 07:04:00,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:00,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:00,746 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:04:00,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:00,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702971005] [2024-11-19 07:04:00,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702971005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:04:00,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:04:00,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:04:00,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813371128] [2024-11-19 07:04:00,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:04:00,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:04:00,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:00,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:04:00,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:04:00,750 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:01,030 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-19 07:04:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 07:04:01,031 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-19 07:04:01,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:01,031 INFO L225 Difference]: With dead ends: 92 [2024-11-19 07:04:01,031 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 07:04:01,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-19 07:04:01,032 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 65 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:01,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 306 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 07:04:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 07:04:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-19 07:04:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 91 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-19 07:04:01,034 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 29 [2024-11-19 07:04:01,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:01,035 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-19 07:04:01,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-19 07:04:01,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 07:04:01,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:01,035 INFO L215 NwaCegarLoop]: trace histogram [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:04:01,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 07:04:01,036 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:04:01,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:01,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2024-11-19 07:04:01,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:01,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895562333] [2024-11-19 07:04:01,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:01,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:01,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:01,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895562333] [2024-11-19 07:04:01,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895562333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:01,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784019666] [2024-11-19 07:04:01,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:01,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:01,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:01,491 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:04:01,493 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:04:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:01,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-19 07:04:01,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:01,631 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:04:01,694 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 07:04:01,695 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:04:01,776 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-19 07:04:01,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 07:04:01,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 07:04:01,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 07:04:02,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2024-11-19 07:04:02,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2024-11-19 07:04:02,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:02,263 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 53 treesize of output 31 [2024-11-19 07:04:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:02,278 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:02,385 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_585) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-19 07:04:02,394 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_585) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-19 07:04:02,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_584) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_585) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-19 07:04:02,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:02,423 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 21 treesize of output 22 [2024-11-19 07:04:02,426 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 121 treesize of output 109 [2024-11-19 07:04:02,436 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 27 treesize of output 25 [2024-11-19 07:04:02,459 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 24 treesize of output 20 [2024-11-19 07:04:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-19 07:04:02,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784019666] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:02,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:02,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 33 [2024-11-19 07:04:02,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530102047] [2024-11-19 07:04:02,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:02,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-19 07:04:02,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:02,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-19 07:04:02,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=832, Unknown=3, NotChecked=180, Total=1122 [2024-11-19 07:04:02,692 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:03,511 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-19 07:04:03,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 07:04:03,512 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-19 07:04:03,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:03,513 INFO L225 Difference]: With dead ends: 92 [2024-11-19 07:04:03,513 INFO L226 Difference]: Without dead ends: 92 [2024-11-19 07:04:03,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=202, Invalid=1289, Unknown=3, NotChecked=228, Total=1722 [2024-11-19 07:04:03,515 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 98 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:03,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 563 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 930 Invalid, 0 Unknown, 249 Unchecked, 0.5s Time] [2024-11-19 07:04:03,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-19 07:04:03,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-11-19 07:04:03,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-19 07:04:03,517 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 29 [2024-11-19 07:04:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:03,518 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-19 07:04:03,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-19 07:04:03,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:04:03,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:03,519 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 07:04:03,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 07:04:03,722 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,SelfDestructingSolverStorable16 [2024-11-19 07:04:03,723 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:04:03,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2024-11-19 07:04:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:03,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474124045] [2024-11-19 07:04:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:04,038 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:04:04,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:04,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474124045] [2024-11-19 07:04:04,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474124045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:04:04,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 07:04:04,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 07:04:04,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228600200] [2024-11-19 07:04:04,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:04:04,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 07:04:04,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:04,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 07:04:04,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 07:04:04,041 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:04,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:04,243 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-11-19 07:04:04,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 07:04:04,244 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 07:04:04,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:04,244 INFO L225 Difference]: With dead ends: 87 [2024-11-19 07:04:04,244 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 07:04:04,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-19 07:04:04,245 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 23 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:04,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 353 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 07:04:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 07:04:04,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-19 07:04:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 86 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-19 07:04:04,248 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 30 [2024-11-19 07:04:04,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:04,249 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-19 07:04:04,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-19 07:04:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 07:04:04,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:04,250 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 07:04:04,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 07:04:04,250 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:04:04,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2024-11-19 07:04:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:04,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145721564] [2024-11-19 07:04:04,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:04,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:04,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:04,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145721564] [2024-11-19 07:04:04,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145721564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:04,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496367891] [2024-11-19 07:04:04,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:04,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:04,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:04,733 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:04:04,735 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:04:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:04,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 07:04:04,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:04,883 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:04:04,916 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 07:04:04,916 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:04:04,977 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-19 07:04:04,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 07:04:05,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:04:05,048 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:04:05,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 07:04:05,115 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 19 [2024-11-19 07:04:05,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-19 07:04:05,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:05,243 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 35 treesize of output 17 [2024-11-19 07:04:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:05,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:05,275 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_706) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) is different from false [2024-11-19 07:04:05,283 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_706) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2024-11-19 07:04:05,294 INFO L349 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2024-11-19 07:04:05,294 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 22 treesize of output 21 [2024-11-19 07:04:13,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:13,361 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 21 treesize of output 22 [2024-11-19 07:04:13,364 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 122 treesize of output 110 [2024-11-19 07:04:13,368 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 24 treesize of output 20 [2024-11-19 07:04:13,375 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:04:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-19 07:04:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496367891] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:13,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:13,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 28 [2024-11-19 07:04:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801707668] [2024-11-19 07:04:13,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:13,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 07:04:13,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:13,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 07:04:13,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=616, Unknown=16, NotChecked=102, Total=812 [2024-11-19 07:04:13,419 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:18,004 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-11-19 07:04:18,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 07:04:18,005 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 07:04:18,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:18,005 INFO L225 Difference]: With dead ends: 86 [2024-11-19 07:04:18,005 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 07:04:18,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=180, Invalid=1071, Unknown=17, NotChecked=138, Total=1406 [2024-11-19 07:04:18,009 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 27 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:18,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 791 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 705 Invalid, 0 Unknown, 116 Unchecked, 0.4s Time] [2024-11-19 07:04:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 07:04:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-19 07:04:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-19 07:04:18,011 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 30 [2024-11-19 07:04:18,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:18,012 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-19 07:04:18,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-19 07:04:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:04:18,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:18,017 INFO L215 NwaCegarLoop]: trace histogram [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:04:18,032 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:04:18,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:18,217 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:04:18,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:18,218 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2024-11-19 07:04:18,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:18,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320026507] [2024-11-19 07:04:18,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:18,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:18,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:18,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320026507] [2024-11-19 07:04:18,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320026507] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:18,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44337114] [2024-11-19 07:04:18,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:18,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:18,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:18,647 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:04:18,648 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:04:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:18,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 07:04:18,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:18,804 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:04:18,804 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:04:18,895 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:04:18,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:18,968 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 27 treesize of output 21 [2024-11-19 07:04:19,191 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 07:04:19,192 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 18 treesize of output 13 [2024-11-19 07:04:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:19,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:19,362 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 13 treesize of output 11 [2024-11-19 07:04:19,366 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 20 treesize of output 18 [2024-11-19 07:04:19,375 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:04:19,427 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 07:04:19,427 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 13 treesize of output 12 [2024-11-19 07:04:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:19,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44337114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:19,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:19,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 28 [2024-11-19 07:04:19,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225252024] [2024-11-19 07:04:19,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:19,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-19 07:04:19,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:19,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 07:04:19,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2024-11-19 07:04:19,437 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:20,046 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-19 07:04:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 07:04:20,047 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 07:04:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:20,047 INFO L225 Difference]: With dead ends: 85 [2024-11-19 07:04:20,047 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 07:04:20,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 07:04:20,048 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 49 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:20,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 731 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 07:04:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 07:04:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-19 07:04:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-19 07:04:20,051 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 33 [2024-11-19 07:04:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:20,051 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-19 07:04:20,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-19 07:04:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 07:04:20,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:20,052 INFO L215 NwaCegarLoop]: trace histogram [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:04:20,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 07:04:20,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:20,257 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:04:20,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2024-11-19 07:04:20,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:20,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838733019] [2024-11-19 07:04:20,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:20,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:20,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:20,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838733019] [2024-11-19 07:04:20,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838733019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:20,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448439125] [2024-11-19 07:04:20,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:20,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:20,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:20,763 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:04:20,764 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:04:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:20,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 07:04:20,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:20,876 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:04:20,956 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-19 07:04:20,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 07:04:20,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:04:20,994 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:04:20,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 07:04:21,050 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 19 [2024-11-19 07:04:21,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-19 07:04:21,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:21,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2024-11-19 07:04:21,350 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:04:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:21,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:21,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:21,769 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 47 treesize of output 51 [2024-11-19 07:04:21,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:21,865 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 27 treesize of output 28 [2024-11-19 07:04:21,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 85 treesize of output 81 [2024-11-19 07:04:21,874 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 100 treesize of output 96 [2024-11-19 07:04:21,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:21,885 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 94 treesize of output 98 [2024-11-19 07:04:21,890 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 85 treesize of output 83 [2024-11-19 07:04:21,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:21,920 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 26 treesize of output 27 [2024-11-19 07:04:21,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 07:04:21,924 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 40 treesize of output 36 [2024-11-19 07:04:21,935 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 07:04:21,935 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 34 treesize of output 33 [2024-11-19 07:04:21,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:04:22,099 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 07:04:22,099 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 25 treesize of output 24 [2024-11-19 07:04:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:22,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448439125] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:22,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:22,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 36 [2024-11-19 07:04:22,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580319192] [2024-11-19 07:04:22,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:22,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-19 07:04:22,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:22,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-19 07:04:22,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1202, Unknown=27, NotChecked=0, Total=1332 [2024-11-19 07:04:22,106 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:22,997 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-19 07:04:22,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 07:04:22,997 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 07:04:22,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:22,998 INFO L225 Difference]: With dead ends: 84 [2024-11-19 07:04:22,998 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 07:04:22,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=237, Invalid=2184, Unknown=29, NotChecked=0, Total=2450 [2024-11-19 07:04:22,999 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 65 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:22,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 898 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 07:04:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 07:04:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 07:04:23,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-19 07:04:23,002 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 33 [2024-11-19 07:04:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:23,002 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-19 07:04:23,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-19 07:04:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:04:23,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:23,003 INFO L215 NwaCegarLoop]: trace histogram [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:04:23,018 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:04:23,204 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,SelfDestructingSolverStorable20 [2024-11-19 07:04:23,204 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:04:23,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:23,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2024-11-19 07:04:23,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:23,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639854315] [2024-11-19 07:04:23,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:23,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:23,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639854315] [2024-11-19 07:04:23,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639854315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:23,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887189817] [2024-11-19 07:04:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:23,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:23,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:23,647 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:04:23,649 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:04:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:23,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-19 07:04:23,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:23,772 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:04:23,799 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 07:04:23,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 07:04:23,820 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 07:04:23,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 07:04:23,883 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:04:23,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:23,951 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 27 treesize of output 21 [2024-11-19 07:04:24,205 INFO L349 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2024-11-19 07:04:24,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 64 [2024-11-19 07:04:24,388 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:04:24,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 07:04:24,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887189817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 07:04:24,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 07:04:24,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 24 [2024-11-19 07:04:24,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52159789] [2024-11-19 07:04:24,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 07:04:24,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 07:04:24,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:24,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 07:04:24,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2024-11-19 07:04:24,392 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:24,832 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-11-19 07:04:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 07:04:24,832 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-19 07:04:24,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:24,832 INFO L225 Difference]: With dead ends: 82 [2024-11-19 07:04:24,833 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 07:04:24,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-11-19 07:04:24,833 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:24,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 332 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 07:04:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 07:04:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-19 07:04:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-11-19 07:04:24,836 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 34 [2024-11-19 07:04:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:24,836 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-11-19 07:04:24,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-11-19 07:04:24,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:04:24,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:24,837 INFO L215 NwaCegarLoop]: trace histogram [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:04:24,852 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:04:25,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:25,038 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:04:25,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:25,038 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2024-11-19 07:04:25,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:25,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251573882] [2024-11-19 07:04:25,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:25,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:25,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251573882] [2024-11-19 07:04:25,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251573882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:25,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096177941] [2024-11-19 07:04:25,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:25,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:25,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:25,755 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:04:25,756 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:04:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:25,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-19 07:04:25,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:25,878 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:04:25,929 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:04:25,929 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:04:26,016 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 07:04:26,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 07:04:26,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:04:26,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:04:26,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2024-11-19 07:04:26,204 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-19 07:04:26,205 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 30 treesize of output 29 [2024-11-19 07:04:26,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:04:26,278 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-11-19 07:04:26,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 41 [2024-11-19 07:04:26,801 INFO L349 Elim1Store]: treesize reduction 18, result has 69.5 percent of original size [2024-11-19 07:04:26,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 78 [2024-11-19 07:04:26,884 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:04:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:26,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:27,239 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:04:27,298 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1043 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1043) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2024-11-19 07:04:27,359 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2024-11-19 07:04:27,359 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 37 treesize of output 30 [2024-11-19 07:04:27,368 INFO L349 Elim1Store]: treesize reduction 12, result has 7.7 percent of original size [2024-11-19 07:04:27,368 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 43 treesize of output 29 [2024-11-19 07:04:27,372 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:04:27,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:27,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2024-11-19 07:04:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-19 07:04:27,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096177941] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:27,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:27,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 50 [2024-11-19 07:04:27,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122512842] [2024-11-19 07:04:27,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:27,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-19 07:04:27,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:27,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-19 07:04:27,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2277, Unknown=9, NotChecked=96, Total=2550 [2024-11-19 07:04:27,726 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 07:04:29,153 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-19 07:04:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 07:04:29,154 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-19 07:04:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 07:04:29,154 INFO L225 Difference]: With dead ends: 84 [2024-11-19 07:04:29,154 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 07:04:29,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=401, Invalid=4149, Unknown=10, NotChecked=132, Total=4692 [2024-11-19 07:04:29,156 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 101 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 07:04:29,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1059 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1327 Invalid, 0 Unknown, 48 Unchecked, 0.7s Time] [2024-11-19 07:04:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 07:04:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2024-11-19 07:04:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.162162162162162) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-11-19 07:04:29,159 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 34 [2024-11-19 07:04:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 07:04:29,159 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-11-19 07:04:29,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-11-19 07:04:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 07:04:29,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 07:04:29,160 INFO L215 NwaCegarLoop]: trace histogram [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:04:29,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 07:04:29,360 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,SelfDestructingSolverStorable22 [2024-11-19 07:04:29,361 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-19 07:04:29,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 07:04:29,361 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2024-11-19 07:04:29,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 07:04:29,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239370470] [2024-11-19 07:04:29,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:29,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 07:04:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:29,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 07:04:29,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239370470] [2024-11-19 07:04:29,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239370470] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 07:04:29,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849675688] [2024-11-19 07:04:29,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 07:04:29,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 07:04:29,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 07:04:29,847 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:04:29,848 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:04:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 07:04:29,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-19 07:04:29,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 07:04:29,991 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:04:30,023 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 07:04:30,023 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:04:30,054 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-19 07:04:30,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 07:04:30,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 07:04:30,127 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 07:04:30,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-19 07:04:30,188 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 17 treesize of output 12 [2024-11-19 07:04:30,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:04:30,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-19 07:04:30,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 07:04:30,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:30,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 30 [2024-11-19 07:04:30,462 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 07:04:30,463 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 14 treesize of output 13 [2024-11-19 07:04:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 07:04:30,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 07:04:38,669 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 32 treesize of output 28 [2024-11-19 07:04:38,764 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1130 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1130) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2024-11-19 07:04:38,827 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_49| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_49| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1129) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1130) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_49| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2024-11-19 07:04:38,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:38,835 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 27 treesize of output 28 [2024-11-19 07:04:38,839 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 171 treesize of output 165 [2024-11-19 07:04:38,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 07:04:38,850 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 94 treesize of output 98 [2024-11-19 07:04:38,871 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 85 treesize of output 83 [2024-11-19 07:04:38,876 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 96 treesize of output 92 [2024-11-19 07:04:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-19 07:04:39,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849675688] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 07:04:39,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 07:04:39,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 41 [2024-11-19 07:04:39,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833810171] [2024-11-19 07:04:39,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 07:04:39,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-19 07:04:39,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 07:04:39,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-19 07:04:39,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1421, Unknown=10, NotChecked=154, Total=1722 [2024-11-19 07:04:39,026 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 07:04:47,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 07:04:55,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 07:04:59,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 07:05:07,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 07:05:11,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 07:05:15,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]