./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:56:09,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:56:09,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:56:09,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:56:09,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:56:09,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:56:09,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:56:09,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:56:09,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:56:09,530 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:56:09,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:56:09,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:56:09,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:56:09,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:56:09,532 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:56:09,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:56:09,533 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:56:09,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:56:09,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:56:09,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:56:09,534 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:56:09,536 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:56:09,536 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:56:09,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:56:09,537 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:56:09,537 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:56:09,537 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:56:09,538 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:56:09,538 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:56:09,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:56:09,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:56:09,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:56:09,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:56:09,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:56:09,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:56:09,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:56:09,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:56:09,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:56:09,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:56:09,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:56:09,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:56:09,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:56:09,542 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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2024-11-19 06:56:09,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:56:09,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:56:09,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:56:09,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:56:09,854 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:56:09,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-reverse.i [2024-11-19 06:56:11,335 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:56:11,638 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:56:11,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i [2024-11-19 06:56:11,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01a2bd9e/c17db52b96024b8694b5b44d9cf1f2cf/FLAGbca458484 [2024-11-19 06:56:11,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01a2bd9e/c17db52b96024b8694b5b44d9cf1f2cf [2024-11-19 06:56:11,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:56:11,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:56:11,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:56:11,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:56:11,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:56:11,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:56:11" (1/1) ... [2024-11-19 06:56:11,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134eaed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:11, skipping insertion in model container [2024-11-19 06:56:11,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:56:11" (1/1) ... [2024-11-19 06:56:11,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:56:12,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:56:12,309 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:56:12,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:56:12,386 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:56:12,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12 WrapperNode [2024-11-19 06:56:12,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:56:12,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:56:12,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:56:12,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:56:12,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12" (1/1) ... [2024-11-19 06:56:12,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12" (1/1) ... [2024-11-19 06:56:12,433 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 146 [2024-11-19 06:56:12,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:56:12,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:56:12,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:56:12,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:56:12,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12" (1/1) ... [2024-11-19 06:56:12,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12" (1/1) ... [2024-11-19 06:56:12,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12" (1/1) ... [2024-11-19 06:56:12,468 INFO L175 MemorySlicer]: Split 33 memory accesses to 2 slices as follows [2, 31]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2024-11-19 06:56:12,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12" (1/1) ... [2024-11-19 06:56:12,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12" (1/1) ... [2024-11-19 06:56:12,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12" (1/1) ... [2024-11-19 06:56:12,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12" (1/1) ... [2024-11-19 06:56:12,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12" (1/1) ... [2024-11-19 06:56:12,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12" (1/1) ... [2024-11-19 06:56:12,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:56:12,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:56:12,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:56:12,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:56:12,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12" (1/1) ... [2024-11-19 06:56:12,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:56:12,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:12,533 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 06:56:12,540 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 06:56:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:56:12,622 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:56:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:56:12,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:56:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:56:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:56:12,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:56:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:56:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:56:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:56:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:56:12,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:56:12,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:56:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:56:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:56:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:56:12,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:56:12,803 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:56:12,806 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:56:13,258 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2024-11-19 06:56:13,258 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:56:13,274 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:56:13,275 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-19 06:56:13,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:56:13 BoogieIcfgContainer [2024-11-19 06:56:13,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:56:13,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:56:13,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:56:13,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:56:13,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:56:11" (1/3) ... [2024-11-19 06:56:13,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac82a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:56:13, skipping insertion in model container [2024-11-19 06:56:13,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:56:12" (2/3) ... [2024-11-19 06:56:13,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac82a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:56:13, skipping insertion in model container [2024-11-19 06:56:13,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:56:13" (3/3) ... [2024-11-19 06:56:13,284 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2024-11-19 06:56:13,304 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:56:13,304 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-11-19 06:56:13,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:56:13,369 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;@553638d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:56:13,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2024-11-19 06:56:13,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 81 states have (on average 2.123456790123457) internal successors, (172), 148 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:56:13,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:56:13,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:13,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:56:13,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:13,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-19 06:56:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:13,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206119819] [2024-11-19 06:56:13,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:13,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:13,599 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 06:56:13,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:13,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206119819] [2024-11-19 06:56:13,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206119819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:13,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:13,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:56:13,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320896222] [2024-11-19 06:56:13,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:13,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:56:13,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:13,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:56:13,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:13,632 INFO L87 Difference]: Start difference. First operand has 153 states, 81 states have (on average 2.123456790123457) internal successors, (172), 148 states have internal predecessors, (172), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 06:56:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:13,832 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2024-11-19 06:56:13,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:56:13,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-19 06:56:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:13,846 INFO L225 Difference]: With dead ends: 145 [2024-11-19 06:56:13,846 INFO L226 Difference]: Without dead ends: 143 [2024-11-19 06:56:13,848 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 06:56:13,853 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 80 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:13,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 144 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-19 06:56:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-19 06:56:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 141 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2024-11-19 06:56:13,906 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 3 [2024-11-19 06:56:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:13,907 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2024-11-19 06:56:13,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 06:56:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2024-11-19 06:56:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:56:13,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:13,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:56:13,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:56:13,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:13,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-19 06:56:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:13,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920597625] [2024-11-19 06:56:13,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:13,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:14,014 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 06:56:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:14,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920597625] [2024-11-19 06:56:14,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920597625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:14,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:14,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:56:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071696160] [2024-11-19 06:56:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:14,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:56:14,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:14,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:56:14,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:56:14,019 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 06:56:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:14,191 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2024-11-19 06:56:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:56:14,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-19 06:56:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:14,193 INFO L225 Difference]: With dead ends: 140 [2024-11-19 06:56:14,193 INFO L226 Difference]: Without dead ends: 140 [2024-11-19 06:56:14,193 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 06:56:14,196 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 80 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:14,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 140 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-19 06:56:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-19 06:56:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 76 states have (on average 1.9342105263157894) internal successors, (147), 138 states have internal predecessors, (147), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2024-11-19 06:56:14,217 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 3 [2024-11-19 06:56:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:14,217 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2024-11-19 06:56:14,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 06:56:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2024-11-19 06:56:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:56:14,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:14,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:14,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:56:14,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:14,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:14,219 INFO L85 PathProgramCache]: Analyzing trace with hash 919164531, now seen corresponding path program 1 times [2024-11-19 06:56:14,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:14,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090263209] [2024-11-19 06:56:14,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:14,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:14,437 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 06:56:14,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:14,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090263209] [2024-11-19 06:56:14,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090263209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:14,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:14,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:56:14,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17290767] [2024-11-19 06:56:14,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:14,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:56:14,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:14,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:56:14,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:56:14,443 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 06:56:14,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:14,671 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2024-11-19 06:56:14,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:14,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 06:56:14,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:14,672 INFO L225 Difference]: With dead ends: 127 [2024-11-19 06:56:14,673 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 06:56:14,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:14,674 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 117 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:14,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 97 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:14,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 06:56:14,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-19 06:56:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 80 states have (on average 1.725) internal successors, (138), 125 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2024-11-19 06:56:14,682 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 9 [2024-11-19 06:56:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:14,683 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2024-11-19 06:56:14,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 06:56:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2024-11-19 06:56:14,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:56:14,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:14,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:14,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:56:14,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:14,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:14,686 INFO L85 PathProgramCache]: Analyzing trace with hash 919164532, now seen corresponding path program 1 times [2024-11-19 06:56:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:14,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464488170] [2024-11-19 06:56:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:14,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:14,893 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 06:56:14,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:14,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464488170] [2024-11-19 06:56:14,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464488170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:14,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:14,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:56:14,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130641057] [2024-11-19 06:56:14,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:14,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:56:14,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:14,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:56:14,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:14,897 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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 06:56:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:15,272 INFO L93 Difference]: Finished difference Result 164 states and 182 transitions. [2024-11-19 06:56:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:15,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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 06:56:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:15,273 INFO L225 Difference]: With dead ends: 164 [2024-11-19 06:56:15,274 INFO L226 Difference]: Without dead ends: 164 [2024-11-19 06:56:15,274 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 06:56:15,275 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 136 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:15,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 187 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:56:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-19 06:56:15,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2024-11-19 06:56:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 109 states have (on average 1.6055045871559632) internal successors, (175), 154 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 178 transitions. [2024-11-19 06:56:15,283 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 178 transitions. Word has length 9 [2024-11-19 06:56:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:15,283 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 178 transitions. [2024-11-19 06:56:15,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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 06:56:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 178 transitions. [2024-11-19 06:56:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:56:15,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:15,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:15,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:56:15,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:15,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931275, now seen corresponding path program 1 times [2024-11-19 06:56:15,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:15,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101029035] [2024-11-19 06:56:15,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:15,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:15,434 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 06:56:15,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:15,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101029035] [2024-11-19 06:56:15,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101029035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:15,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:15,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:15,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091453896] [2024-11-19 06:56:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:15,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:15,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:15,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:15,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:15,438 INFO L87 Difference]: Start difference. First operand 156 states and 178 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 06:56:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:15,615 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2024-11-19 06:56:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:15,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-11-19 06:56:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:15,616 INFO L225 Difference]: With dead ends: 155 [2024-11-19 06:56:15,617 INFO L226 Difference]: Without dead ends: 155 [2024-11-19 06:56:15,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:15,618 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:15,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 319 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:15,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-19 06:56:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-19 06:56:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 109 states have (on average 1.5871559633027523) internal successors, (173), 153 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 176 transitions. [2024-11-19 06:56:15,637 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 176 transitions. Word has length 12 [2024-11-19 06:56:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:15,638 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 176 transitions. [2024-11-19 06:56:15,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 06:56:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 176 transitions. [2024-11-19 06:56:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:56:15,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:15,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:15,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:56:15,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:15,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1880931274, now seen corresponding path program 1 times [2024-11-19 06:56:15,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:15,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706572774] [2024-11-19 06:56:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:15,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:15,804 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 06:56:15,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:15,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706572774] [2024-11-19 06:56:15,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706572774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:15,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:15,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:15,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557049070] [2024-11-19 06:56:15,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:15,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:15,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:15,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:15,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:15,807 INFO L87 Difference]: Start difference. First operand 155 states and 176 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 06:56:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:15,997 INFO L93 Difference]: Finished difference Result 154 states and 174 transitions. [2024-11-19 06:56:15,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:16,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-11-19 06:56:16,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:16,002 INFO L225 Difference]: With dead ends: 154 [2024-11-19 06:56:16,002 INFO L226 Difference]: Without dead ends: 154 [2024-11-19 06:56:16,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:16,003 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 2 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:16,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 301 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:16,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-19 06:56:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-19 06:56:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5688073394495412) internal successors, (171), 152 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions. [2024-11-19 06:56:16,014 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 12 [2024-11-19 06:56:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:16,015 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 174 transitions. [2024-11-19 06:56:16,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 06:56:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions. [2024-11-19 06:56:16,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:56:16,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:16,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:16,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:56:16,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:16,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:16,017 INFO L85 PathProgramCache]: Analyzing trace with hash -802687776, now seen corresponding path program 1 times [2024-11-19 06:56:16,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:16,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211742148] [2024-11-19 06:56:16,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:16,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:16,070 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 06:56:16,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:16,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211742148] [2024-11-19 06:56:16,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211742148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:16,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:16,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:16,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591251900] [2024-11-19 06:56:16,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:16,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:56:16,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:16,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:56:16,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:56:16,073 INFO L87 Difference]: Start difference. First operand 154 states and 174 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:16,208 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2024-11-19 06:56:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:16,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 06:56:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:16,209 INFO L225 Difference]: With dead ends: 158 [2024-11-19 06:56:16,210 INFO L226 Difference]: Without dead ends: 158 [2024-11-19 06:56:16,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:16,211 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 124 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:16,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 202 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:16,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-19 06:56:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2024-11-19 06:56:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 152 states have internal predecessors, (168), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 171 transitions. [2024-11-19 06:56:16,224 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 171 transitions. Word has length 17 [2024-11-19 06:56:16,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:16,224 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 171 transitions. [2024-11-19 06:56:16,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:16,225 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 171 transitions. [2024-11-19 06:56:16,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:56:16,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:16,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:16,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:56:16,226 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:16,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618057, now seen corresponding path program 1 times [2024-11-19 06:56:16,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:16,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926741674] [2024-11-19 06:56:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:16,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:16,450 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 06:56:16,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:16,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926741674] [2024-11-19 06:56:16,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926741674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:16,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:16,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:56:16,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965688292] [2024-11-19 06:56:16,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:16,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:56:16,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:16,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:56:16,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:56:16,453 INFO L87 Difference]: Start difference. First operand 154 states and 171 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 06:56:16,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:16,890 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2024-11-19 06:56:16,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:56:16,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2024-11-19 06:56:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:16,892 INFO L225 Difference]: With dead ends: 153 [2024-11-19 06:56:16,892 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 06:56:16,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:56:16,893 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 114 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:16,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 280 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:56:16,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 06:56:16,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-19 06:56:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 151 states have internal predecessors, (167), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2024-11-19 06:56:16,901 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 16 [2024-11-19 06:56:16,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:16,902 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2024-11-19 06:56:16,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 06:56:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2024-11-19 06:56:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:56:16,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:16,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:16,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:56:16,904 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:16,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:16,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1483618056, now seen corresponding path program 1 times [2024-11-19 06:56:16,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:16,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241383339] [2024-11-19 06:56:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:16,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:17,224 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 06:56:17,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:17,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241383339] [2024-11-19 06:56:17,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241383339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:17,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:17,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:56:17,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400664712] [2024-11-19 06:56:17,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:17,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:56:17,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:17,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:56:17,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:56:17,231 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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 06:56:17,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:17,863 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2024-11-19 06:56:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:56:17,863 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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 16 [2024-11-19 06:56:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:17,864 INFO L225 Difference]: With dead ends: 149 [2024-11-19 06:56:17,864 INFO L226 Difference]: Without dead ends: 149 [2024-11-19 06:56:17,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:56:17,866 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 117 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:17,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 349 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:56:17,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-19 06:56:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 140. [2024-11-19 06:56:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 101 states have (on average 1.5148514851485149) internal successors, (153), 138 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 156 transitions. [2024-11-19 06:56:17,871 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 156 transitions. Word has length 16 [2024-11-19 06:56:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:17,872 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 156 transitions. [2024-11-19 06:56:17,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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 06:56:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 156 transitions. [2024-11-19 06:56:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:56:17,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:17,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:17,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:56:17,873 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:17,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:17,873 INFO L85 PathProgramCache]: Analyzing trace with hash 919818880, now seen corresponding path program 1 times [2024-11-19 06:56:17,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:17,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382248790] [2024-11-19 06:56:17,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:17,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:18,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382248790] [2024-11-19 06:56:18,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382248790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:18,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:18,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:56:18,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505166640] [2024-11-19 06:56:18,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:18,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:56:18,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:18,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:56:18,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:18,105 INFO L87 Difference]: Start difference. First operand 140 states and 156 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 06:56:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:18,291 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2024-11-19 06:56:18,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:56:18,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2024-11-19 06:56:18,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:18,292 INFO L225 Difference]: With dead ends: 157 [2024-11-19 06:56:18,292 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 06:56:18,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:56:18,293 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 24 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:18,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 446 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:18,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 06:56:18,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 148. [2024-11-19 06:56:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 146 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 165 transitions. [2024-11-19 06:56:18,297 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 165 transitions. Word has length 18 [2024-11-19 06:56:18,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:18,297 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 165 transitions. [2024-11-19 06:56:18,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 06:56:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 165 transitions. [2024-11-19 06:56:18,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 06:56:18,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:18,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:18,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:56:18,298 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:18,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:18,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1207405087, now seen corresponding path program 1 times [2024-11-19 06:56:18,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:18,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425500803] [2024-11-19 06:56:18,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:18,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:18,432 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 06:56:18,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:18,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425500803] [2024-11-19 06:56:18,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425500803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:18,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:18,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:56:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560615528] [2024-11-19 06:56:18,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:18,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:56:18,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:18,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:56:18,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:18,435 INFO L87 Difference]: Start difference. First operand 148 states and 165 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) 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 06:56:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:18,676 INFO L93 Difference]: Finished difference Result 162 states and 183 transitions. [2024-11-19 06:56:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:56:18,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) 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 20 [2024-11-19 06:56:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:18,677 INFO L225 Difference]: With dead ends: 162 [2024-11-19 06:56:18,677 INFO L226 Difference]: Without dead ends: 162 [2024-11-19 06:56:18,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:56:18,678 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 6 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:18,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 366 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:56:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-19 06:56:18,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2024-11-19 06:56:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 156 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2024-11-19 06:56:18,682 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 20 [2024-11-19 06:56:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:18,683 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2024-11-19 06:56:18,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) 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 06:56:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2024-11-19 06:56:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:56:18,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:18,684 INFO L215 NwaCegarLoop]: trace histogram [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 06:56:18,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:56:18,684 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:18,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:18,685 INFO L85 PathProgramCache]: Analyzing trace with hash 653173643, now seen corresponding path program 1 times [2024-11-19 06:56:18,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:18,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143096665] [2024-11-19 06:56:18,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:18,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:18,779 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 06:56:18,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:18,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143096665] [2024-11-19 06:56:18,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143096665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:18,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:18,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:18,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375663780] [2024-11-19 06:56:18,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:18,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:18,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:18,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:18,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:18,782 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 06:56:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:18,932 INFO L93 Difference]: Finished difference Result 157 states and 176 transitions. [2024-11-19 06:56:18,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:18,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 06:56:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:18,934 INFO L225 Difference]: With dead ends: 157 [2024-11-19 06:56:18,934 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 06:56:18,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:18,935 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:18,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 298 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 06:56:18,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-19 06:56:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 119 states have (on average 1.453781512605042) internal successors, (173), 155 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 176 transitions. [2024-11-19 06:56:18,939 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 176 transitions. Word has length 22 [2024-11-19 06:56:18,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:18,939 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 176 transitions. [2024-11-19 06:56:18,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 06:56:18,939 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 176 transitions. [2024-11-19 06:56:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:56:18,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:18,940 INFO L215 NwaCegarLoop]: trace histogram [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 06:56:18,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:56:18,940 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:18,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:18,941 INFO L85 PathProgramCache]: Analyzing trace with hash 653173644, now seen corresponding path program 1 times [2024-11-19 06:56:18,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:18,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580843382] [2024-11-19 06:56:18,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:18,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:19,100 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 06:56:19,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580843382] [2024-11-19 06:56:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580843382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:19,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:56:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267653553] [2024-11-19 06:56:19,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:19,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:56:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:19,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:56:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:56:19,103 INFO L87 Difference]: Start difference. First operand 157 states and 176 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 06:56:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:19,262 INFO L93 Difference]: Finished difference Result 156 states and 174 transitions. [2024-11-19 06:56:19,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:56:19,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 06:56:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:19,264 INFO L225 Difference]: With dead ends: 156 [2024-11-19 06:56:19,264 INFO L226 Difference]: Without dead ends: 156 [2024-11-19 06:56:19,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:19,265 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:19,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 288 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-19 06:56:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-19 06:56:19,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 154 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 174 transitions. [2024-11-19 06:56:19,269 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 174 transitions. Word has length 22 [2024-11-19 06:56:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:19,269 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 174 transitions. [2024-11-19 06:56:19,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 06:56:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 174 transitions. [2024-11-19 06:56:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:56:19,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:19,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:19,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:56:19,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:19,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:19,271 INFO L85 PathProgramCache]: Analyzing trace with hash 12463374, now seen corresponding path program 1 times [2024-11-19 06:56:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:19,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748165265] [2024-11-19 06:56:19,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:19,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:19,580 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 06:56:19,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:19,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748165265] [2024-11-19 06:56:19,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748165265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:19,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:19,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:56:19,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079292883] [2024-11-19 06:56:19,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:19,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:56:19,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:19,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:56:19,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:56:19,584 INFO L87 Difference]: Start difference. First operand 156 states and 174 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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 06:56:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:20,044 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2024-11-19 06:56:20,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:56:20,045 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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 26 [2024-11-19 06:56:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:20,046 INFO L225 Difference]: With dead ends: 154 [2024-11-19 06:56:20,046 INFO L226 Difference]: Without dead ends: 154 [2024-11-19 06:56:20,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:56:20,047 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 93 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:20,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 294 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:56:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-19 06:56:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-19 06:56:20,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.4201680672268908) internal successors, (169), 152 states have internal predecessors, (169), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2024-11-19 06:56:20,052 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 26 [2024-11-19 06:56:20,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:20,052 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2024-11-19 06:56:20,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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 06:56:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2024-11-19 06:56:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:56:20,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:20,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:20,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:56:20,054 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:20,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:20,054 INFO L85 PathProgramCache]: Analyzing trace with hash 12463373, now seen corresponding path program 1 times [2024-11-19 06:56:20,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:20,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466043711] [2024-11-19 06:56:20,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:20,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:20,256 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 06:56:20,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466043711] [2024-11-19 06:56:20,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466043711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:56:20,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:56:20,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:56:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574853378] [2024-11-19 06:56:20,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:56:20,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:56:20,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:20,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:56:20,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:56:20,258 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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 06:56:20,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:20,593 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2024-11-19 06:56:20,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:56:20,593 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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 26 [2024-11-19 06:56:20,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:20,594 INFO L225 Difference]: With dead ends: 153 [2024-11-19 06:56:20,594 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 06:56:20,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:56:20,597 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 92 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:20,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 241 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:56:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 06:56:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-19 06:56:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 119 states have (on average 1.411764705882353) internal successors, (168), 151 states have internal predecessors, (168), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2024-11-19 06:56:20,601 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 26 [2024-11-19 06:56:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:20,601 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2024-11-19 06:56:20,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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 06:56:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2024-11-19 06:56:20,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:56:20,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:20,602 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:20,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:56:20,604 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:20,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1845732973, now seen corresponding path program 1 times [2024-11-19 06:56:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:20,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124522022] [2024-11-19 06:56:20,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:20,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:21,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:21,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:21,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124522022] [2024-11-19 06:56:21,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124522022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:21,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294860413] [2024-11-19 06:56:21,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:21,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:21,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:21,033 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 06:56:21,036 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 06:56:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:21,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-19 06:56:21,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:21,215 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 06:56:21,312 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:56:21,313 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 06:56:21,371 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 06:56:21,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:56:21,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:56:21,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:21,504 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 0 case distinctions, treesize of input 40 treesize of output 30 [2024-11-19 06:56:21,610 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 06:56:21,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-19 06:56:21,662 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:21,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 06:56:21,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 06:56:21,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:21,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:22,039 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-19 06:56:22,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 06:56:22,564 INFO L349 Elim1Store]: treesize reduction 17, result has 69.6 percent of original size [2024-11-19 06:56:22,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 94 [2024-11-19 06:56:22,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:22,602 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 760 treesize of output 747 [2024-11-19 06:56:22,645 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 188 treesize of output 178 [2024-11-19 06:56:22,676 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 06:56:22,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:22,709 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 160 treesize of output 140 [2024-11-19 06:56:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:23,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294860413] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:56:23,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:56:23,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 35 [2024-11-19 06:56:23,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082179430] [2024-11-19 06:56:23,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:56:23,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-19 06:56:23,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:23,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-19 06:56:23,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1138, Unknown=6, NotChecked=0, Total=1260 [2024-11-19 06:56:23,197 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 states have internal predecessors, (75), 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 06:56:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:24,799 INFO L93 Difference]: Finished difference Result 219 states and 248 transitions. [2024-11-19 06:56:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:56:24,799 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 states have internal predecessors, (75), 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 06:56:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:24,800 INFO L225 Difference]: With dead ends: 219 [2024-11-19 06:56:24,801 INFO L226 Difference]: Without dead ends: 219 [2024-11-19 06:56:24,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=271, Invalid=1793, Unknown=6, NotChecked=0, Total=2070 [2024-11-19 06:56:24,803 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 391 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:24,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 934 Invalid, 2018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 06:56:24,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-19 06:56:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 174. [2024-11-19 06:56:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 140 states have (on average 1.3785714285714286) internal successors, (193), 172 states have internal predecessors, (193), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2024-11-19 06:56:24,807 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 29 [2024-11-19 06:56:24,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:24,808 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2024-11-19 06:56:24,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.142857142857143) internal successors, (75), 36 states have internal predecessors, (75), 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 06:56:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2024-11-19 06:56:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-19 06:56:24,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:24,809 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:24,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:56:25,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 06:56:25,010 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:25,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:25,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1845732972, now seen corresponding path program 1 times [2024-11-19 06:56:25,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:25,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533517801] [2024-11-19 06:56:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:25,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:25,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:25,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533517801] [2024-11-19 06:56:25,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533517801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:25,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593866839] [2024-11-19 06:56:25,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:25,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:25,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:25,526 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 06:56:25,531 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 06:56:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:25,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-19 06:56:25,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:25,663 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 06:56:25,741 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:56:25,741 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 06:56:25,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:56:25,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:56:25,808 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 06:56:25,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:25,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2024-11-19 06:56:25,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 06:56:26,024 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 06:56:26,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-19 06:56:26,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:26,038 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 06:56:26,055 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:26,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-19 06:56:26,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 06:56:26,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 06:56:26,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:56:26,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:26,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:26,498 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_589 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_589) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|) 1)))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_589) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_590) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|)))) is different from false [2024-11-19 06:56:26,738 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_#t~mem4#1.offset| 4))) (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_585 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_585) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| (store .cse0 .cse1 v_ArrVal_584)) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_589) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|) 1)))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 Int) (v_ArrVal_590 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_86| Int) (v_ArrVal_585 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_86| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_86|) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| (store .cse0 .cse1 v_ArrVal_584)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_585) .cse2 v_ArrVal_589) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|) 3) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_590) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_86|))))))))) is different from false [2024-11-19 06:56:27,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:27,023 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 53 treesize of output 54 [2024-11-19 06:56:27,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:27,041 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 166 treesize of output 161 [2024-11-19 06:56:27,055 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 57 treesize of output 55 [2024-11-19 06:56:27,061 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 86 treesize of output 80 [2024-11-19 06:56:27,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:27,167 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 118 treesize of output 119 [2024-11-19 06:56:27,171 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:56:27,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:27,176 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 29 treesize of output 30 [2024-11-19 06:56:27,179 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:56:27,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:27,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:27,184 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-19 06:56:27,187 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:56:27,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:27,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:27,191 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-19 06:56:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:27,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593866839] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:56:27,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:56:27,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 37 [2024-11-19 06:56:27,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320428602] [2024-11-19 06:56:27,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:56:27,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-19 06:56:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:27,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-19 06:56:27,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1124, Unknown=14, NotChecked=138, Total=1406 [2024-11-19 06:56:27,435 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 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 06:56:29,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:29,527 INFO L93 Difference]: Finished difference Result 252 states and 289 transitions. [2024-11-19 06:56:29,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 06:56:29,527 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 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 06:56:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:29,528 INFO L225 Difference]: With dead ends: 252 [2024-11-19 06:56:29,529 INFO L226 Difference]: Without dead ends: 252 [2024-11-19 06:56:29,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=387, Invalid=2363, Unknown=14, NotChecked=206, Total=2970 [2024-11-19 06:56:29,530 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 399 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 2447 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 2980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:29,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1444 Invalid, 2980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2447 Invalid, 0 Unknown, 459 Unchecked, 1.5s Time] [2024-11-19 06:56:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-19 06:56:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 172. [2024-11-19 06:56:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 144 states have (on average 1.3611111111111112) internal successors, (196), 170 states have internal predecessors, (196), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 199 transitions. [2024-11-19 06:56:29,535 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 199 transitions. Word has length 29 [2024-11-19 06:56:29,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:29,536 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 199 transitions. [2024-11-19 06:56:29,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 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 06:56:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 199 transitions. [2024-11-19 06:56:29,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:56:29,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:29,538 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:29,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:56:29,739 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,SelfDestructingSolverStorable16 [2024-11-19 06:56:29,739 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:29,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1416772208, now seen corresponding path program 1 times [2024-11-19 06:56:29,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:29,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880107758] [2024-11-19 06:56:29,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:29,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:30,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:30,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880107758] [2024-11-19 06:56:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880107758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:30,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347708230] [2024-11-19 06:56:30,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:30,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:30,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:30,114 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 06:56:30,115 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 06:56:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:30,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-19 06:56:30,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:30,247 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 06:56:30,313 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:56:30,314 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 06:56:30,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:56:30,356 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 06:56:30,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 06:56:30,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:30,458 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 0 case distinctions, treesize of input 40 treesize of output 30 [2024-11-19 06:56:30,563 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 06:56:30,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-19 06:56:30,600 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:30,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 06:56:30,707 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 33 treesize of output 17 [2024-11-19 06:56:30,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 06:56:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:30,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:30,877 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-19 06:56:30,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 06:56:31,242 INFO L349 Elim1Store]: treesize reduction 17, result has 69.6 percent of original size [2024-11-19 06:56:31,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 94 [2024-11-19 06:56:31,299 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2024-11-19 06:56:31,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 90 treesize of output 103 [2024-11-19 06:56:31,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:31,311 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 58 treesize of output 60 [2024-11-19 06:56:31,319 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 78 treesize of output 74 [2024-11-19 06:56:31,337 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 06:56:31,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-19 06:56:31,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:31,464 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 76 treesize of output 76 [2024-11-19 06:56:31,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:31,563 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 37 treesize of output 53 [2024-11-19 06:56:31,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:31,612 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 31 treesize of output 35 [2024-11-19 06:56:31,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:31,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347708230] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:56:31,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:56:31,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 34 [2024-11-19 06:56:31,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087264269] [2024-11-19 06:56:31,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:56:31,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-19 06:56:31,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:31,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 06:56:31,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1068, Unknown=11, NotChecked=0, Total=1190 [2024-11-19 06:56:31,864 INFO L87 Difference]: Start difference. First operand 172 states and 199 transitions. Second operand has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 35 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 06:56:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:33,081 INFO L93 Difference]: Finished difference Result 232 states and 267 transitions. [2024-11-19 06:56:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:56:33,081 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 35 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 31 [2024-11-19 06:56:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:33,083 INFO L225 Difference]: With dead ends: 232 [2024-11-19 06:56:33,083 INFO L226 Difference]: Without dead ends: 232 [2024-11-19 06:56:33,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=234, Invalid=1561, Unknown=11, NotChecked=0, Total=1806 [2024-11-19 06:56:33,084 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 405 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:33,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1105 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 06:56:33,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-19 06:56:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 179. [2024-11-19 06:56:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 151 states have (on average 1.3576158940397351) internal successors, (205), 177 states have internal predecessors, (205), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 208 transitions. [2024-11-19 06:56:33,089 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 208 transitions. Word has length 31 [2024-11-19 06:56:33,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:33,089 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 208 transitions. [2024-11-19 06:56:33,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.3529411764705883) internal successors, (80), 35 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 06:56:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 208 transitions. [2024-11-19 06:56:33,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:56:33,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:33,090 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:33,107 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 06:56:33,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 06:56:33,291 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:33,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:33,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1416772209, now seen corresponding path program 1 times [2024-11-19 06:56:33,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:33,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206101292] [2024-11-19 06:56:33,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:33,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:33,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206101292] [2024-11-19 06:56:33,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206101292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:33,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359833004] [2024-11-19 06:56:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:33,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:33,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:33,819 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 06:56:33,821 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 06:56:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:33,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-19 06:56:33,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:33,942 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 06:56:34,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:56:34,020 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:56:34,020 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 06:56:34,060 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 06:56:34,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 06:56:34,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:34,166 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 0 case distinctions, treesize of input 65 treesize of output 43 [2024-11-19 06:56:34,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 06:56:34,285 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:56:34,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-19 06:56:34,303 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 06:56:34,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-19 06:56:34,341 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:34,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-19 06:56:34,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 06:56:34,484 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 23 treesize of output 11 [2024-11-19 06:56:34,490 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 33 treesize of output 17 [2024-11-19 06:56:34,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 06:56:34,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 06:56:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:34,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:34,742 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_819 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_98| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_98|))) (forall ((v_ArrVal_819 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_98| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_98|) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) 9))))) is different from false [2024-11-19 06:56:34,838 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_819 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_98| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_98|) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|))))) (forall ((v_ArrVal_819 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_98| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_98|) (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|))))))) is different from false [2024-11-19 06:56:34,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_#t~mem4#1.offset| 4))) (and (forall ((v_ArrVal_813 (Array Int Int)) (v_ArrVal_814 Int) (v_ArrVal_819 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_98| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_98|) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_813) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| (store .cse0 .cse1 v_ArrVal_814)) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) 9)))) (forall ((v_ArrVal_813 (Array Int Int)) (v_ArrVal_818 (Array Int Int)) (v_ArrVal_814 Int) (v_ArrVal_819 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_98| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_98|) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| (store .cse0 .cse1 v_ArrVal_814)))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_813) .cse2 v_ArrVal_819) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) 11) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|))))))))) is different from false [2024-11-19 06:56:35,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:35,123 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 118 treesize of output 119 [2024-11-19 06:56:35,161 INFO L349 Elim1Store]: treesize reduction 17, result has 69.6 percent of original size [2024-11-19 06:56:35,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 119 [2024-11-19 06:56:35,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:35,186 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 218 treesize of output 217 [2024-11-19 06:56:35,257 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2024-11-19 06:56:35,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 278 treesize of output 269 [2024-11-19 06:56:35,270 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 150 treesize of output 144 [2024-11-19 06:56:35,282 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 93 treesize of output 91 [2024-11-19 06:56:35,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:35,306 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 106 treesize of output 106 [2024-11-19 06:56:35,321 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 132 treesize of output 126 [2024-11-19 06:56:35,385 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 06:56:35,435 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 06:56:35,448 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 06:56:35,497 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:56:35,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 21 treesize of output 20 [2024-11-19 06:56:35,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:35,639 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 152 treesize of output 168 [2024-11-19 06:56:36,087 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 06:56:36,096 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 9 treesize of output 7 [2024-11-19 06:56:36,103 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 9 treesize of output 7 [2024-11-19 06:56:36,134 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 8 treesize of output 4 [2024-11-19 06:56:36,216 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-19 06:56:36,217 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 74 treesize of output 87 [2024-11-19 06:56:36,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:36,587 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 53 treesize of output 54 [2024-11-19 06:56:36,591 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:56:36,594 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:56:36,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:36,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:56:36,599 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 06:56:36,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:36,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359833004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:56:36,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:56:36,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 33 [2024-11-19 06:56:36,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290409115] [2024-11-19 06:56:36,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:56:36,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-19 06:56:36,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:36,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-19 06:56:36,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=798, Unknown=15, NotChecked=180, Total=1122 [2024-11-19 06:56:36,812 INFO L87 Difference]: Start difference. First operand 179 states and 208 transitions. Second operand has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 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 06:56:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:37,943 INFO L93 Difference]: Finished difference Result 232 states and 267 transitions. [2024-11-19 06:56:37,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:56:37,944 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 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) Word has length 31 [2024-11-19 06:56:37,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:37,944 INFO L225 Difference]: With dead ends: 232 [2024-11-19 06:56:37,944 INFO L226 Difference]: Without dead ends: 232 [2024-11-19 06:56:37,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=1177, Unknown=16, NotChecked=222, Total=1640 [2024-11-19 06:56:37,945 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 469 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 2149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 541 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:37,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 982 Invalid, 2149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1562 Invalid, 0 Unknown, 541 Unchecked, 0.9s Time] [2024-11-19 06:56:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-19 06:56:37,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 179. [2024-11-19 06:56:37,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 151 states have (on average 1.3509933774834437) internal successors, (204), 177 states have internal predecessors, (204), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 207 transitions. [2024-11-19 06:56:37,950 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 207 transitions. Word has length 31 [2024-11-19 06:56:37,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:37,950 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 207 transitions. [2024-11-19 06:56:37,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 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 06:56:37,950 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 207 transitions. [2024-11-19 06:56:37,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:56:37,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:37,951 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:37,969 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 06:56:38,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:38,156 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:38,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:38,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1314580577, now seen corresponding path program 1 times [2024-11-19 06:56:38,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:38,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25031934] [2024-11-19 06:56:38,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:38,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:56:38,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:38,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25031934] [2024-11-19 06:56:38,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25031934] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:38,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174435595] [2024-11-19 06:56:38,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:38,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:38,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:38,256 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 06:56:38,257 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 06:56:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:38,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:56:38,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:38,396 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 06:56:38,408 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 06:56:38,441 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:56:38,441 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 06:56:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:56:38,449 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:56:38,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174435595] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:56:38,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:56:38,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2024-11-19 06:56:38,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885604706] [2024-11-19 06:56:38,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:56:38,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:56:38,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:56:38,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:56:38,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:56:38,510 INFO L87 Difference]: Start difference. First operand 179 states and 207 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:56:38,620 INFO L93 Difference]: Finished difference Result 177 states and 200 transitions. [2024-11-19 06:56:38,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:56:38,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-19 06:56:38,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:56:38,621 INFO L225 Difference]: With dead ends: 177 [2024-11-19 06:56:38,621 INFO L226 Difference]: Without dead ends: 177 [2024-11-19 06:56:38,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:56:38,622 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 122 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:56:38,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 71 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:56:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-19 06:56:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 169. [2024-11-19 06:56:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 167 states have internal predecessors, (189), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2024-11-19 06:56:38,637 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 36 [2024-11-19 06:56:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:56:38,637 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2024-11-19 06:56:38,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:56:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2024-11-19 06:56:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:56:38,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:56:38,638 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:56:38,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:56:38,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:38,839 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:56:38,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:56:38,840 INFO L85 PathProgramCache]: Analyzing trace with hash 788170431, now seen corresponding path program 1 times [2024-11-19 06:56:38,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:56:38,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182351203] [2024-11-19 06:56:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:38,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:56:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:39,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:56:39,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182351203] [2024-11-19 06:56:39,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182351203] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:56:39,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656425680] [2024-11-19 06:56:39,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:56:39,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:56:39,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:56:39,191 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 06:56:39,192 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 06:56:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:56:39,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 06:56:39,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:56:39,457 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 06:56:39,457 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 17 treesize of output 21 [2024-11-19 06:56:39,507 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 06:56:39,600 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:39,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 06:56:39,724 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-19 06:56:39,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-19 06:56:39,745 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 06:56:39,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-19 06:56:39,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 06:56:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:56:39,933 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:56:40,222 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_109| Int)) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1047))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1049)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_109|)) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_109|) (< |v_ULTIMATE.start_main_~x~0#1.offset_109| 0))) is different from false [2024-11-19 06:56:40,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:40,234 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 38 treesize of output 31 [2024-11-19 06:56:40,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:40,245 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 252 treesize of output 227 [2024-11-19 06:56:40,251 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 171 treesize of output 163 [2024-11-19 06:56:40,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:40,260 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 163 treesize of output 159 [2024-11-19 06:56:46,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:56:46,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 300 case distinctions, treesize of input 399 treesize of output 2741