./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 64bit --witnessprinter.graph.data.programhash f1ad2d5826e88851ec05294e79547a11a54665f4a2cf6f0e66f9eabed656148f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:51:10,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:51:10,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-11 17:51:10,726 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:51:10,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:51:10,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:51:10,763 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:51:10,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:51:10,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:51:10,766 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:51:10,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:51:10,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:51:10,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:51:10,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:51:10,770 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:51:10,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:51:10,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:51:10,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:51:10,771 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:51:10,771 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:51:10,772 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:51:10,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:51:10,776 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:51:10,777 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:51:10,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:51:10,777 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:51:10,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:51:10,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:51:10,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:51:10,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:51:10,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:51:10,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:51:10,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:51:10,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:51:10,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:51:10,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:51:10,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:51:10,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:51:10,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:51:10,782 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-clean/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-clean/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1ad2d5826e88851ec05294e79547a11a54665f4a2cf6f0e66f9eabed656148f [2024-10-11 17:51:11,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:51:11,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:51:11,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:51:11,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:51:11,083 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:51:11,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i [2024-10-11 17:51:12,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:51:12,905 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:51:12,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrlcpy-alloca-2.i [2024-10-11 17:51:12,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32e0ad361/ee6d1e61ae854536adee32521a9f7de9/FLAGd5f0fe5ea [2024-10-11 17:51:12,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32e0ad361/ee6d1e61ae854536adee32521a9f7de9 [2024-10-11 17:51:12,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:51:12,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:51:12,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:51:12,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:51:12,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:51:12,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:51:12" (1/1) ... [2024-10-11 17:51:12,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1563a246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:12, skipping insertion in model container [2024-10-11 17:51:12,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:51:12" (1/1) ... [2024-10-11 17:51:13,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:51:13,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:51:13,359 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:51:13,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:51:13,429 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:51:13,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13 WrapperNode [2024-10-11 17:51:13,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:51:13,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:51:13,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:51:13,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:51:13,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13" (1/1) ... [2024-10-11 17:51:13,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13" (1/1) ... [2024-10-11 17:51:13,469 INFO L138 Inliner]: procedures = 111, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2024-10-11 17:51:13,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:51:13,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:51:13,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:51:13,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:51:13,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13" (1/1) ... [2024-10-11 17:51:13,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13" (1/1) ... [2024-10-11 17:51:13,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13" (1/1) ... [2024-10-11 17:51:13,531 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [1, 3]. [2024-10-11 17:51:13,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13" (1/1) ... [2024-10-11 17:51:13,533 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13" (1/1) ... [2024-10-11 17:51:13,539 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13" (1/1) ... [2024-10-11 17:51:13,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13" (1/1) ... [2024-10-11 17:51:13,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13" (1/1) ... [2024-10-11 17:51:13,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13" (1/1) ... [2024-10-11 17:51:13,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:51:13,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:51:13,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:51:13,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:51:13,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13" (1/1) ... [2024-10-11 17:51:13,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:51:13,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:13,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:51:13,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:51:13,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:51:13,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:51:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:51:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:51:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:51:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:51:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:51:13,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:51:13,799 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:51:13,801 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:51:14,011 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-11 17:51:14,012 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:51:14,047 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:51:14,047 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:51:14,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:51:14 BoogieIcfgContainer [2024-10-11 17:51:14,048 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:51:14,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:51:14,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:51:14,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:51:14,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:51:12" (1/3) ... [2024-10-11 17:51:14,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9fac01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:51:14, skipping insertion in model container [2024-10-11 17:51:14,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:13" (2/3) ... [2024-10-11 17:51:14,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9fac01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:51:14, skipping insertion in model container [2024-10-11 17:51:14,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:51:14" (3/3) ... [2024-10-11 17:51:14,059 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca-2.i [2024-10-11 17:51:14,077 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:51:14,078 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-10-11 17:51:14,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:51:14,144 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;@3f65c35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:51:14,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-11 17:51:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 2.15) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:51:14,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:14,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:51:14,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:14,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:14,159 INFO L85 PathProgramCache]: Analyzing trace with hash 111906049, now seen corresponding path program 1 times [2024-10-11 17:51:14,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:14,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165354384] [2024-10-11 17:51:14,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:14,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165354384] [2024-10-11 17:51:14,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165354384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:14,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:14,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:51:14,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853225208] [2024-10-11 17:51:14,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:14,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:51:14,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:14,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:51:14,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:51:14,561 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 2.15) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:14,618 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-10-11 17:51:14,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:51:14,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-10-11 17:51:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:14,630 INFO L225 Difference]: With dead ends: 33 [2024-10-11 17:51:14,630 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 17:51:14,633 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-10-11 17:51:14,636 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:14,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:14,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 17:51:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 17:51:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.95) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-10-11 17:51:14,676 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 5 [2024-10-11 17:51:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:14,677 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-10-11 17:51:14,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-10-11 17:51:14,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:51:14,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:14,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:51:14,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:51:14,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:14,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:14,680 INFO L85 PathProgramCache]: Analyzing trace with hash 111906050, now seen corresponding path program 1 times [2024-10-11 17:51:14,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:14,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956074121] [2024-10-11 17:51:14,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:14,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:15,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:15,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956074121] [2024-10-11 17:51:15,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956074121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:15,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:15,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:15,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331379295] [2024-10-11 17:51:15,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:15,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:51:15,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:15,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:51:15,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:15,044 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:15,081 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2024-10-11 17:51:15,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:51:15,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-10-11 17:51:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:15,083 INFO L225 Difference]: With dead ends: 37 [2024-10-11 17:51:15,084 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 17:51:15,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:15,087 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:15,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 17:51:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-10-11 17:51:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-10-11 17:51:15,095 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 5 [2024-10-11 17:51:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:15,096 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-10-11 17:51:15,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-10-11 17:51:15,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:51:15,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:15,096 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:51:15,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:51:15,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:15,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:15,097 INFO L85 PathProgramCache]: Analyzing trace with hash 111907972, now seen corresponding path program 1 times [2024-10-11 17:51:15,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:15,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280830028] [2024-10-11 17:51:15,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:15,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:15,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:15,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280830028] [2024-10-11 17:51:15,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280830028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:15,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:15,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:15,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499901177] [2024-10-11 17:51:15,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:15,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:51:15,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:15,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:51:15,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:15,339 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:15,371 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2024-10-11 17:51:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:51:15,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-10-11 17:51:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:15,372 INFO L225 Difference]: With dead ends: 33 [2024-10-11 17:51:15,373 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 17:51:15,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:15,374 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:15,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 59 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:15,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 17:51:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-10-11 17:51:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.9) internal successors, (38), 30 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-11 17:51:15,380 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 5 [2024-10-11 17:51:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:15,380 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-11 17:51:15,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-11 17:51:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:51:15,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:15,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:51:15,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:51:15,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:15,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:15,382 INFO L85 PathProgramCache]: Analyzing trace with hash -825879788, now seen corresponding path program 1 times [2024-10-11 17:51:15,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:15,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832511650] [2024-10-11 17:51:15,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:15,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:15,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832511650] [2024-10-11 17:51:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832511650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:15,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:15,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:51:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612216657] [2024-10-11 17:51:15,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:15,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:51:15,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:15,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:51:15,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:51:15,440 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:15,473 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2024-10-11 17:51:15,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:51:15,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-10-11 17:51:15,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:15,474 INFO L225 Difference]: With dead ends: 30 [2024-10-11 17:51:15,474 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 17:51:15,475 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-10-11 17:51:15,476 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:15,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:15,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 17:51:15,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 17:51:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.85) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-11 17:51:15,486 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 6 [2024-10-11 17:51:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:15,487 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-11 17:51:15,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-10-11 17:51:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:51:15,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:15,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:51:15,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:51:15,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:15,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:15,491 INFO L85 PathProgramCache]: Analyzing trace with hash -825879787, now seen corresponding path program 1 times [2024-10-11 17:51:15,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:15,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409047367] [2024-10-11 17:51:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:15,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:15,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:15,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409047367] [2024-10-11 17:51:15,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409047367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:15,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:15,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:15,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577942188] [2024-10-11 17:51:15,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:15,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:51:15,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:15,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:51:15,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:15,631 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:15,657 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-10-11 17:51:15,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:51:15,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-10-11 17:51:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:15,662 INFO L225 Difference]: With dead ends: 34 [2024-10-11 17:51:15,662 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 17:51:15,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:15,664 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:15,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:15,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 17:51:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-11 17:51:15,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.75) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-10-11 17:51:15,675 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 6 [2024-10-11 17:51:15,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:15,676 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-10-11 17:51:15,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-10-11 17:51:15,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:51:15,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:15,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:51:15,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:51:15,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:15,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:15,678 INFO L85 PathProgramCache]: Analyzing trace with hash -824032745, now seen corresponding path program 1 times [2024-10-11 17:51:15,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:15,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550343437] [2024-10-11 17:51:15,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:15,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:15,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:15,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550343437] [2024-10-11 17:51:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550343437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244430265] [2024-10-11 17:51:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:15,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:51:15,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:15,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:51:15,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:15,918 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:15,945 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2024-10-11 17:51:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:51:15,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-10-11 17:51:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:15,946 INFO L225 Difference]: With dead ends: 33 [2024-10-11 17:51:15,946 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 17:51:15,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:15,948 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:15,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 17:51:15,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-10-11 17:51:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.8) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-10-11 17:51:15,957 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 6 [2024-10-11 17:51:15,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:15,957 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-10-11 17:51:15,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-10-11 17:51:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:51:15,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:15,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:15,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:51:15,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:15,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:15,960 INFO L85 PathProgramCache]: Analyzing trace with hash 212692980, now seen corresponding path program 1 times [2024-10-11 17:51:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:15,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220203216] [2024-10-11 17:51:15,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:15,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:16,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:16,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:16,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220203216] [2024-10-11 17:51:16,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220203216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:16,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25888434] [2024-10-11 17:51:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:16,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:51:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:16,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:51:16,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:51:16,009 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:16,033 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2024-10-11 17:51:16,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:51:16,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:51:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:16,034 INFO L225 Difference]: With dead ends: 30 [2024-10-11 17:51:16,034 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 17:51:16,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:51:16,035 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:16,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 17:51:16,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 17:51:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-11 17:51:16,043 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 10 [2024-10-11 17:51:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:16,043 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-11 17:51:16,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,043 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-10-11 17:51:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:51:16,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:16,044 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:16,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:51:16,044 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:16,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:16,045 INFO L85 PathProgramCache]: Analyzing trace with hash 212666882, now seen corresponding path program 1 times [2024-10-11 17:51:16,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:16,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351908751] [2024-10-11 17:51:16,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:16,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-10-11 17:51:16,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:16,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351908751] [2024-10-11 17:51:16,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351908751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:16,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:16,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:16,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820729125] [2024-10-11 17:51:16,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:16,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:51:16,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:16,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:51:16,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:16,104 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:16,146 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-10-11 17:51:16,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:51:16,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:51:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:16,147 INFO L225 Difference]: With dead ends: 35 [2024-10-11 17:51:16,149 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 17:51:16,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:16,150 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 19 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:16,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 50 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 17:51:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2024-10-11 17:51:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-10-11 17:51:16,158 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 10 [2024-10-11 17:51:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:16,158 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-10-11 17:51:16,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-10-11 17:51:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:51:16,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:16,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:16,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:51:16,160 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:16,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash 212666883, now seen corresponding path program 1 times [2024-10-11 17:51:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:16,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805852694] [2024-10-11 17:51:16,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:16,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805852694] [2024-10-11 17:51:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805852694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:16,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:16,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:51:16,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134894488] [2024-10-11 17:51:16,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:16,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:51:16,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:16,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:51:16,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:16,256 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:16,286 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-11 17:51:16,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:51:16,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:51:16,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:16,289 INFO L225 Difference]: With dead ends: 34 [2024-10-11 17:51:16,289 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 17:51:16,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:16,290 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:16,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 79 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 17:51:16,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-10-11 17:51:16,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.6) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-10-11 17:51:16,293 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 10 [2024-10-11 17:51:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:16,294 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-10-11 17:51:16,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-10-11 17:51:16,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:51:16,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:16,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:16,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:51:16,295 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:16,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:16,296 INFO L85 PathProgramCache]: Analyzing trace with hash 211867555, now seen corresponding path program 1 times [2024-10-11 17:51:16,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:16,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939610671] [2024-10-11 17:51:16,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:16,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:16,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939610671] [2024-10-11 17:51:16,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939610671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:16,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:16,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:16,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579845887] [2024-10-11 17:51:16,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:16,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:51:16,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:16,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:51:16,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:16,358 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:16,395 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-10-11 17:51:16,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:51:16,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:51:16,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:16,396 INFO L225 Difference]: With dead ends: 32 [2024-10-11 17:51:16,396 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 17:51:16,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 17:51:16,397 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:16,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 43 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 17:51:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 17:51:16,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.56) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-10-11 17:51:16,404 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 10 [2024-10-11 17:51:16,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:16,404 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-10-11 17:51:16,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-10-11 17:51:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:51:16,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:16,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:16,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:51:16,405 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:16,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:16,409 INFO L85 PathProgramCache]: Analyzing trace with hash 211867556, now seen corresponding path program 1 times [2024-10-11 17:51:16,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:16,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259889493] [2024-10-11 17:51:16,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:16,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:16,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:16,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:16,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259889493] [2024-10-11 17:51:16,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259889493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:16,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:16,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:51:16,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107847452] [2024-10-11 17:51:16,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:16,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:51:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:16,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:51:16,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:51:16,570 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:16,625 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-10-11 17:51:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:51:16,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:51:16,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:16,626 INFO L225 Difference]: With dead ends: 41 [2024-10-11 17:51:16,626 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 17:51:16,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:51:16,627 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:16,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 101 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:51:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 17:51:16,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2024-10-11 17:51:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-10-11 17:51:16,633 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 10 [2024-10-11 17:51:16,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:16,633 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-10-11 17:51:16,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-10-11 17:51:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:51:16,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:16,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:16,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:51:16,634 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:16,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:16,634 INFO L85 PathProgramCache]: Analyzing trace with hash -596679743, now seen corresponding path program 1 times [2024-10-11 17:51:16,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:16,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090455796] [2024-10-11 17:51:16,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:16,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:16,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:16,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090455796] [2024-10-11 17:51:16,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090455796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:16,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:16,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:51:16,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900094551] [2024-10-11 17:51:16,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:16,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:51:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:16,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:51:16,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:16,736 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:16,759 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-11 17:51:16,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:51:16,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:51:16,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:16,760 INFO L225 Difference]: With dead ends: 34 [2024-10-11 17:51:16,760 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 17:51:16,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:16,764 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:16,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 17:51:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-10-11 17:51:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.608695652173913) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-11 17:51:16,770 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 10 [2024-10-11 17:51:16,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:16,770 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-11 17:51:16,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-10-11 17:51:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:51:16,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:16,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:16,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:51:16,772 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:16,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:16,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2022040378, now seen corresponding path program 1 times [2024-10-11 17:51:16,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:16,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110673128] [2024-10-11 17:51:16,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:16,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:16,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:16,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110673128] [2024-10-11 17:51:16,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110673128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:16,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:16,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:51:16,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437856415] [2024-10-11 17:51:16,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:16,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:51:16,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:16,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:51:16,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:16,835 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:16,881 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-10-11 17:51:16,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:51:16,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2024-10-11 17:51:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:16,883 INFO L225 Difference]: With dead ends: 35 [2024-10-11 17:51:16,883 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 17:51:16,883 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-10-11 17:51:16,884 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:16,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:16,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 17:51:16,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2024-10-11 17:51:16,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.565217391304348) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-10-11 17:51:16,887 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 11 [2024-10-11 17:51:16,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:16,887 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-10-11 17:51:16,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-10-11 17:51:16,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:51:16,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:16,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:16,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:51:16,889 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:16,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:16,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2022040377, now seen corresponding path program 1 times [2024-10-11 17:51:16,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:16,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79532648] [2024-10-11 17:51:16,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:16,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:17,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:17,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79532648] [2024-10-11 17:51:17,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79532648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:17,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:17,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:51:17,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794210381] [2024-10-11 17:51:17,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:17,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:51:17,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:17,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:51:17,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:51:17,044 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:17,112 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-10-11 17:51:17,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:51:17,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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 11 [2024-10-11 17:51:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:17,114 INFO L225 Difference]: With dead ends: 39 [2024-10-11 17:51:17,114 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 17:51:17,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:51:17,115 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:17,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 110 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:51:17,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 17:51:17,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2024-10-11 17:51:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 32 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2024-10-11 17:51:17,119 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 11 [2024-10-11 17:51:17,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:17,119 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2024-10-11 17:51:17,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2024-10-11 17:51:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 17:51:17,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:17,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:17,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:51:17,120 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:17,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1741243115, now seen corresponding path program 1 times [2024-10-11 17:51:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:17,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330460752] [2024-10-11 17:51:17,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:17,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:17,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:17,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330460752] [2024-10-11 17:51:17,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330460752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:17,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:17,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:51:17,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699153270] [2024-10-11 17:51:17,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:17,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:51:17,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:17,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:51:17,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:17,231 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-10-11 17:51:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:17,252 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2024-10-11 17:51:17,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:51:17,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-10-11 17:51:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:17,254 INFO L225 Difference]: With dead ends: 32 [2024-10-11 17:51:17,254 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 17:51:17,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:17,255 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:17,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 42 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 17:51:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 17:51:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.48) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-10-11 17:51:17,262 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 12 [2024-10-11 17:51:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:17,262 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-10-11 17:51:17,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-10-11 17:51:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-10-11 17:51:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:51:17,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:17,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:17,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:51:17,263 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:17,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:17,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1856842198, now seen corresponding path program 1 times [2024-10-11 17:51:17,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:17,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755400399] [2024-10-11 17:51:17,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:17,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:17,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:17,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755400399] [2024-10-11 17:51:17,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755400399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:17,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:17,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:17,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867015078] [2024-10-11 17:51:17,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:17,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:51:17,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:17,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:51:17,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:17,314 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:17,341 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-10-11 17:51:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:51:17,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-10-11 17:51:17,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:17,343 INFO L225 Difference]: With dead ends: 29 [2024-10-11 17:51:17,343 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 17:51:17,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 17:51:17,344 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:17,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 37 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 17:51:17,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-11 17:51:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.44) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-10-11 17:51:17,348 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 13 [2024-10-11 17:51:17,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:17,348 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-10-11 17:51:17,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-10-11 17:51:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:51:17,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:17,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:17,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:51:17,349 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:17,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:17,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1856842197, now seen corresponding path program 1 times [2024-10-11 17:51:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:17,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470299158] [2024-10-11 17:51:17,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:17,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:17,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:17,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470299158] [2024-10-11 17:51:17,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470299158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:17,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:17,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:51:17,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973981869] [2024-10-11 17:51:17,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:17,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:51:17,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:17,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:51:17,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:17,452 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:17,479 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-10-11 17:51:17,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:51:17,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2024-10-11 17:51:17,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:17,480 INFO L225 Difference]: With dead ends: 48 [2024-10-11 17:51:17,480 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 17:51:17,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:17,481 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:17,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:17,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 17:51:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-10-11 17:51:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.380952380952381) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2024-10-11 17:51:17,484 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 13 [2024-10-11 17:51:17,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:17,484 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2024-10-11 17:51:17,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,485 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2024-10-11 17:51:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:51:17,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:17,485 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:17,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:51:17,486 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:17,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:17,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1155777619, now seen corresponding path program 1 times [2024-10-11 17:51:17,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:17,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654699063] [2024-10-11 17:51:17,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:17,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:17,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:17,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654699063] [2024-10-11 17:51:17,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654699063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:17,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:17,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:51:17,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637663324] [2024-10-11 17:51:17,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:17,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:51:17,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:17,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:51:17,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:51:17,616 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:17,643 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-10-11 17:51:17,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:51:17,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2024-10-11 17:51:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:17,644 INFO L225 Difference]: With dead ends: 46 [2024-10-11 17:51:17,644 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 17:51:17,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:51:17,645 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:17,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 17:51:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2024-10-11 17:51:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.36) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-10-11 17:51:17,648 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 13 [2024-10-11 17:51:17,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:17,649 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-10-11 17:51:17,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-10-11 17:51:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:51:17,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:17,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:17,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:51:17,650 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:17,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:17,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1727690885, now seen corresponding path program 1 times [2024-10-11 17:51:17,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:17,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445275531] [2024-10-11 17:51:17,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:17,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:17,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:17,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445275531] [2024-10-11 17:51:17,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445275531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:17,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:17,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:51:17,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088609614] [2024-10-11 17:51:17,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:17,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:51:17,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:17,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:51:17,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:51:17,805 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:17,851 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-11 17:51:17,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:51:17,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:51:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:17,853 INFO L225 Difference]: With dead ends: 31 [2024-10-11 17:51:17,853 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 17:51:17,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:51:17,854 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:17,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 17:51:17,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 17:51:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-10-11 17:51:17,855 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 14 [2024-10-11 17:51:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:17,856 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-11 17:51:17,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-10-11 17:51:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:51:17,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:17,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:17,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:51:17,859 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:17,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash -805762989, now seen corresponding path program 1 times [2024-10-11 17:51:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:17,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736353628] [2024-10-11 17:51:17,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:17,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736353628] [2024-10-11 17:51:17,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736353628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:17,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:17,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:51:17,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956911921] [2024-10-11 17:51:17,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:17,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:51:17,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:17,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:51:17,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:17,960 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:17,989 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-10-11 17:51:17,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:51:17,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:51:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:17,990 INFO L225 Difference]: With dead ends: 37 [2024-10-11 17:51:17,991 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 17:51:17,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:17,991 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:17,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:17,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 17:51:17,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 17:51:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-11 17:51:17,993 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 15 [2024-10-11 17:51:17,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:17,997 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-11 17:51:17,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:17,997 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-11 17:51:17,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:51:17,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:17,998 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:17,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:51:17,998 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:17,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1392569003, now seen corresponding path program 1 times [2024-10-11 17:51:17,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:17,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666588085] [2024-10-11 17:51:17,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:17,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:18,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:18,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666588085] [2024-10-11 17:51:18,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666588085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:18,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:18,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:51:18,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673280040] [2024-10-11 17:51:18,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:18,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:51:18,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:51:18,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:51:18,279 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:18,357 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-10-11 17:51:18,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:51:18,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:51:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:18,359 INFO L225 Difference]: With dead ends: 43 [2024-10-11 17:51:18,359 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 17:51:18,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:51:18,360 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:18,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 93 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:51:18,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 17:51:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 17:51:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-11 17:51:18,362 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 15 [2024-10-11 17:51:18,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:18,362 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-11 17:51:18,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-11 17:51:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:51:18,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:18,363 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:18,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:51:18,363 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:18,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:18,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1392534182, now seen corresponding path program 1 times [2024-10-11 17:51:18,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:18,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724051091] [2024-10-11 17:51:18,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:18,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:18,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:18,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724051091] [2024-10-11 17:51:18,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724051091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:18,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:18,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:51:18,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70696566] [2024-10-11 17:51:18,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:18,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:51:18,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:18,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:51:18,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:51:18,528 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:18,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:18,565 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2024-10-11 17:51:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:51:18,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:51:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:18,567 INFO L225 Difference]: With dead ends: 63 [2024-10-11 17:51:18,567 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 17:51:18,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:51:18,568 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:18,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 85 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:18,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 17:51:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2024-10-11 17:51:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-10-11 17:51:18,570 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 15 [2024-10-11 17:51:18,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:18,570 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-10-11 17:51:18,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-10-11 17:51:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:51:18,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:18,571 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:18,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:51:18,572 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:18,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:18,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1891315864, now seen corresponding path program 1 times [2024-10-11 17:51:18,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:18,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036087703] [2024-10-11 17:51:18,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:18,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:18,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:18,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036087703] [2024-10-11 17:51:18,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036087703] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:18,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418748379] [2024-10-11 17:51:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:18,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:18,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:18,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:18,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:51:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:18,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 17:51:18,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:19,077 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 14 treesize of output 10 [2024-10-11 17:51:19,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:51:19,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 20 treesize of output 17 [2024-10-11 17:51:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:19,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:19,689 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 13 [2024-10-11 17:51:19,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-10-11 17:51:19,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 17:51:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:19,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418748379] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:19,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:19,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2024-10-11 17:51:19,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559369797] [2024-10-11 17:51:19,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:19,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 17:51:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:19,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 17:51:19,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:51:19,729 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:19,933 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-10-11 17:51:19,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:51:19,933 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:51:19,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:19,934 INFO L225 Difference]: With dead ends: 58 [2024-10-11 17:51:19,934 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 17:51:19,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2024-10-11 17:51:19,935 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:19,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 147 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:51:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 17:51:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2024-10-11 17:51:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.26) internal successors, (63), 53 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2024-10-11 17:51:19,942 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 15 [2024-10-11 17:51:19,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:19,942 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2024-10-11 17:51:19,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2024-10-11 17:51:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:51:19,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:19,943 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:19,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:51:20,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 17:51:20,144 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:20,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:20,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1498750381, now seen corresponding path program 1 times [2024-10-11 17:51:20,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:20,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437756663] [2024-10-11 17:51:20,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:20,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:20,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437756663] [2024-10-11 17:51:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437756663] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595835673] [2024-10-11 17:51:20,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:20,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:20,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:20,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:20,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:51:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:20,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 17:51:20,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:20,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:20,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 17:51:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:20,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595835673] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:20,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:20,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2024-10-11 17:51:20,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103685974] [2024-10-11 17:51:20,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:20,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 17:51:20,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:20,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 17:51:20,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:51:20,917 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:21,173 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2024-10-11 17:51:21,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:51:21,173 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 21 states have internal predecessors, (38), 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-10-11 17:51:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:21,175 INFO L225 Difference]: With dead ends: 55 [2024-10-11 17:51:21,175 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 17:51:21,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2024-10-11 17:51:21,176 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:21,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 199 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:51:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 17:51:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 17:51:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-10-11 17:51:21,178 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 16 [2024-10-11 17:51:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:21,178 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-10-11 17:51:21,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-10-11 17:51:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:51:21,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:21,179 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:21,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:51:21,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:21,380 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:21,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1248935862, now seen corresponding path program 1 times [2024-10-11 17:51:21,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:21,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985261335] [2024-10-11 17:51:21,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:21,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:21,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:21,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985261335] [2024-10-11 17:51:21,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985261335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:21,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:21,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:51:21,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790907185] [2024-10-11 17:51:21,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:21,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:51:21,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:21,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:51:21,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:51:21,537 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:21,568 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2024-10-11 17:51:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:51:21,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 17:51:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:21,569 INFO L225 Difference]: With dead ends: 67 [2024-10-11 17:51:21,569 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 17:51:21,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:51:21,570 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:21,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 95 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 17:51:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 17:51:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2024-10-11 17:51:21,575 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 17 [2024-10-11 17:51:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:21,576 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2024-10-11 17:51:21,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2024-10-11 17:51:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:51:21,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:21,576 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:21,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:51:21,576 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:21,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:21,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1770984726, now seen corresponding path program 1 times [2024-10-11 17:51:21,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:21,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432887210] [2024-10-11 17:51:21,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:21,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:21,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:21,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432887210] [2024-10-11 17:51:21,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432887210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:21,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:21,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:51:21,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653102440] [2024-10-11 17:51:21,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:21,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:51:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:21,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:51:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:21,664 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:21,683 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-10-11 17:51:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:51:21,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 17:51:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:21,684 INFO L225 Difference]: With dead ends: 57 [2024-10-11 17:51:21,684 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 17:51:21,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:21,685 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:21,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 17:51:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-11 17:51:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-10-11 17:51:21,688 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 17 [2024-10-11 17:51:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:21,689 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-10-11 17:51:21,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-10-11 17:51:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:51:21,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:21,689 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:21,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:51:21,689 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:21,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash 227867508, now seen corresponding path program 1 times [2024-10-11 17:51:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721335180] [2024-10-11 17:51:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:22,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:22,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721335180] [2024-10-11 17:51:22,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721335180] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:22,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589318705] [2024-10-11 17:51:22,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:22,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:22,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:22,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:22,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:51:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:22,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 17:51:22,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:22,103 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 14 treesize of output 10 [2024-10-11 17:51:22,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:51:22,283 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 20 treesize of output 17 [2024-10-11 17:51:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:22,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:22,570 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 13 [2024-10-11 17:51:22,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-10-11 17:51:22,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 17:51:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:22,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589318705] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:22,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:22,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-10-11 17:51:22,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80912768] [2024-10-11 17:51:22,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:22,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 17:51:22,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:22,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 17:51:22,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:51:22,595 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 17 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:22,782 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-10-11 17:51:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:51:22,782 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 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 17 [2024-10-11 17:51:22,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:22,783 INFO L225 Difference]: With dead ends: 48 [2024-10-11 17:51:22,783 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 17:51:22,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:51:22,784 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:22,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 104 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:51:22,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 17:51:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 17:51:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2024-10-11 17:51:22,787 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2024-10-11 17:51:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:22,788 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2024-10-11 17:51:22,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2024-10-11 17:51:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:51:22,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:22,788 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:22,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:51:22,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:22,989 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:22,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1168262767, now seen corresponding path program 1 times [2024-10-11 17:51:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:22,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128242734] [2024-10-11 17:51:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:22,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:23,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:23,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128242734] [2024-10-11 17:51:23,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128242734] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:23,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146498473] [2024-10-11 17:51:23,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:23,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:23,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:23,275 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:23,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:51:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:23,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 17:51:23,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:23,370 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 13 treesize of output 1 [2024-10-11 17:51:23,380 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 14 treesize of output 10 [2024-10-11 17:51:23,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:51:23,488 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 20 treesize of output 17 [2024-10-11 17:51:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:23,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:23,778 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 13 [2024-10-11 17:51:23,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-10-11 17:51:23,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-10-11 17:51:23,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146498473] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:23,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:23,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 17 [2024-10-11 17:51:23,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17454846] [2024-10-11 17:51:23,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:23,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 17:51:23,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:23,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 17:51:23,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:51:23,818 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:23,984 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2024-10-11 17:51:23,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:51:23,984 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 17:51:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:23,984 INFO L225 Difference]: With dead ends: 50 [2024-10-11 17:51:23,985 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 17:51:23,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:51:23,985 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:23,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 137 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:51:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 17:51:23,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-10-11 17:51:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2024-10-11 17:51:23,987 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 19 [2024-10-11 17:51:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:23,988 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2024-10-11 17:51:23,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2024-10-11 17:51:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:51:23,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:23,988 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:24,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:51:24,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 17:51:24,193 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:24,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:24,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1942348515, now seen corresponding path program 2 times [2024-10-11 17:51:24,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:24,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839039253] [2024-10-11 17:51:24,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:24,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839039253] [2024-10-11 17:51:24,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839039253] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97818223] [2024-10-11 17:51:24,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:51:24,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:24,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:24,991 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:24,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:51:25,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:51:25,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:51:25,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 17:51:25,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:25,094 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-10-11 17:51:25,103 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 14 treesize of output 10 [2024-10-11 17:51:25,494 INFO L349 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2024-10-11 17:51:25,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2024-10-11 17:51:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:25,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:26,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-10-11 17:51:26,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-10-11 17:51:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:26,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97818223] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:26,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:26,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 28 [2024-10-11 17:51:26,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793294460] [2024-10-11 17:51:26,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:26,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 17:51:26,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 17:51:26,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2024-10-11 17:51:26,111 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:26,729 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2024-10-11 17:51:26,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:51:26,730 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 17:51:26,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:26,730 INFO L225 Difference]: With dead ends: 59 [2024-10-11 17:51:26,730 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 17:51:26,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 17:51:26,731 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:26,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 170 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:51:26,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 17:51:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 17:51:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-10-11 17:51:26,734 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2024-10-11 17:51:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:26,734 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-10-11 17:51:26,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-10-11 17:51:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:51:26,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:26,735 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:26,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:51:26,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 17:51:26,940 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:26,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1225478172, now seen corresponding path program 2 times [2024-10-11 17:51:26,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:26,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498325943] [2024-10-11 17:51:26,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:26,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:27,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:27,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498325943] [2024-10-11 17:51:27,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498325943] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:27,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118104552] [2024-10-11 17:51:27,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:51:27,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:27,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:27,374 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:27,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:51:27,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:51:27,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:51:27,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-11 17:51:27,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:27,485 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-10-11 17:51:27,516 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 14 treesize of output 10 [2024-10-11 17:51:32,187 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-10-11 17:51:32,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 23 [2024-10-11 17:51:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:32,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:32,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-10-11 17:51:32,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-10-11 17:51:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:32,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118104552] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:32,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:32,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27 [2024-10-11 17:51:32,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281004717] [2024-10-11 17:51:32,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:32,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 17:51:32,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:32,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 17:51:32,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=659, Unknown=2, NotChecked=0, Total=756 [2024-10-11 17:51:32,702 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 28 states, 27 states have (on average 1.962962962962963) internal successors, (53), 28 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:39,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:51:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:39,963 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2024-10-11 17:51:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:51:39,963 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.962962962962963) internal successors, (53), 28 states have internal predecessors, (53), 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-10-11 17:51:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:39,964 INFO L225 Difference]: With dead ends: 56 [2024-10-11 17:51:39,964 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 17:51:39,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=169, Invalid=1159, Unknown=4, NotChecked=0, Total=1332 [2024-10-11 17:51:39,965 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 80 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:39,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 183 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 316 Invalid, 8 Unknown, 0 Unchecked, 6.3s Time] [2024-10-11 17:51:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 17:51:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-10-11 17:51:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-10-11 17:51:39,966 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 20 [2024-10-11 17:51:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:39,967 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-10-11 17:51:39,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.962962962962963) internal successors, (53), 28 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-10-11 17:51:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:51:39,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:39,968 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:39,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 17:51:40,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:40,168 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:40,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:40,169 INFO L85 PathProgramCache]: Analyzing trace with hash 664882311, now seen corresponding path program 2 times [2024-10-11 17:51:40,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:40,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61362342] [2024-10-11 17:51:40,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:40,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:40,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:40,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61362342] [2024-10-11 17:51:40,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61362342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:40,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593344864] [2024-10-11 17:51:40,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:51:40,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:40,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:40,530 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:40,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 17:51:40,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:51:40,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:51:40,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 17:51:40,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:40,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:51:40,630 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 13 treesize of output 7 [2024-10-11 17:51:40,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 17:51:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:41,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:41,633 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:51:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:41,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593344864] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:41,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:41,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 31 [2024-10-11 17:51:41,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709446852] [2024-10-11 17:51:41,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:41,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 17:51:41,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:41,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 17:51:41,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2024-10-11 17:51:41,638 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 32 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:42,171 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2024-10-11 17:51:42,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 17:51:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 32 states have internal predecessors, (58), 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 21 [2024-10-11 17:51:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:42,172 INFO L225 Difference]: With dead ends: 52 [2024-10-11 17:51:42,172 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 17:51:42,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=197, Invalid=1443, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 17:51:42,173 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:42,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 132 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:51:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 17:51:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-10-11 17:51:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2024-10-11 17:51:42,174 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 21 [2024-10-11 17:51:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:42,174 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2024-10-11 17:51:42,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 32 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2024-10-11 17:51:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:51:42,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:42,175 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:42,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 17:51:42,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:42,376 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:42,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:42,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1596107842, now seen corresponding path program 1 times [2024-10-11 17:51:42,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:42,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708295884] [2024-10-11 17:51:42,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:42,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:42,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:42,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708295884] [2024-10-11 17:51:42,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708295884] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:42,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308485507] [2024-10-11 17:51:42,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:42,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:42,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:42,912 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:42,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 17:51:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:42,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 17:51:42,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:43,024 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 13 treesize of output 1 [2024-10-11 17:51:43,033 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 14 treesize of output 10 [2024-10-11 17:51:43,442 INFO L349 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2024-10-11 17:51:43,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2024-10-11 17:51:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:43,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:43,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-10-11 17:51:43,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-10-11 17:51:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:43,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308485507] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:43,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:43,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 26 [2024-10-11 17:51:43,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244310365] [2024-10-11 17:51:43,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:43,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 17:51:43,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:43,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 17:51:43,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2024-10-11 17:51:43,985 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:44,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:44,321 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-10-11 17:51:44,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 17:51:44,322 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 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-10-11 17:51:44,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:44,322 INFO L225 Difference]: With dead ends: 54 [2024-10-11 17:51:44,322 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 17:51:44,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2024-10-11 17:51:44,324 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:44,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 112 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:51:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 17:51:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-10-11 17:51:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2024-10-11 17:51:44,325 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 22 [2024-10-11 17:51:44,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:44,325 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2024-10-11 17:51:44,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2024-10-11 17:51:44,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:51:44,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:44,326 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:44,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 17:51:44,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-11 17:51:44,533 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:44,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:44,533 INFO L85 PathProgramCache]: Analyzing trace with hash 65802639, now seen corresponding path program 2 times [2024-10-11 17:51:44,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:44,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415768810] [2024-10-11 17:51:44,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:44,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:45,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:45,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415768810] [2024-10-11 17:51:45,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415768810] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:45,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013795758] [2024-10-11 17:51:45,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:51:45,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:45,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:45,928 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:45,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 17:51:46,016 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:51:46,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:51:46,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-11 17:51:46,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:46,059 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 13 treesize of output 1 [2024-10-11 17:51:46,098 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 13 treesize of output 9 [2024-10-11 17:51:46,690 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-10-11 17:51:46,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-11 17:51:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:46,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:47,519 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 44 treesize of output 38 [2024-10-11 17:51:47,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2024-10-11 17:51:47,632 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:47,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013795758] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:47,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:47,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 44 [2024-10-11 17:51:47,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881133293] [2024-10-11 17:51:47,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:47,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-11 17:51:47,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:47,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-11 17:51:47,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1817, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 17:51:47,635 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 45 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 45 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:49,023 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2024-10-11 17:51:49,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 17:51:49,023 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 45 states have internal predecessors, (72), 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 25 [2024-10-11 17:51:49,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:49,023 INFO L225 Difference]: With dead ends: 74 [2024-10-11 17:51:49,023 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 17:51:49,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=333, Invalid=3449, Unknown=0, NotChecked=0, Total=3782 [2024-10-11 17:51:49,025 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:49,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 113 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:51:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 17:51:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2024-10-11 17:51:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2024-10-11 17:51:49,035 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 25 [2024-10-11 17:51:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:49,035 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2024-10-11 17:51:49,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 45 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2024-10-11 17:51:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 17:51:49,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:49,035 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:49,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 17:51:49,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:49,236 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:49,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:49,237 INFO L85 PathProgramCache]: Analyzing trace with hash -519131036, now seen corresponding path program 3 times [2024-10-11 17:51:49,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:49,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752517078] [2024-10-11 17:51:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:49,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:49,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:49,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752517078] [2024-10-11 17:51:49,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752517078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:49,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728166377] [2024-10-11 17:51:49,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:51:49,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:49,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:49,780 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:49,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 17:51:49,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-11 17:51:49,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:51:49,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-10-11 17:51:49,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:49,961 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 13 treesize of output 9 [2024-10-11 17:51:50,832 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-10-11 17:51:50,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 39 [2024-10-11 17:51:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:50,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:51,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2024-10-11 17:51:51,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2024-10-11 17:51:51,958 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 15 treesize of output 11 [2024-10-11 17:51:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:52,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728166377] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:52,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:52,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 43 [2024-10-11 17:51:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644774831] [2024-10-11 17:51:52,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:52,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-11 17:51:52,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:52,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-11 17:51:52,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1690, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 17:51:52,066 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 44 states, 43 states have (on average 2.0) internal successors, (86), 44 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:53,476 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2024-10-11 17:51:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-11 17:51:53,477 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.0) internal successors, (86), 44 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-11 17:51:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:53,477 INFO L225 Difference]: With dead ends: 106 [2024-10-11 17:51:53,477 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 17:51:53,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=480, Invalid=3942, Unknown=0, NotChecked=0, Total=4422 [2024-10-11 17:51:53,479 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 224 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:53,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 509 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:51:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 17:51:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 80. [2024-10-11 17:51:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 79 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2024-10-11 17:51:53,481 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 30 [2024-10-11 17:51:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:53,481 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2024-10-11 17:51:53,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.0) internal successors, (86), 44 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2024-10-11 17:51:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 17:51:53,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:53,482 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:53,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 17:51:53,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-11 17:51:53,685 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:51:53,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:53,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1429800111, now seen corresponding path program 3 times [2024-10-11 17:51:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:53,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478826672] [2024-10-11 17:51:53,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:53,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:54,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:54,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478826672] [2024-10-11 17:51:54,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478826672] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:54,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082442189] [2024-10-11 17:51:54,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:51:54,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:54,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:54,228 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:54,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 17:51:54,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-11 17:51:54,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:51:54,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-10-11 17:51:54,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:54,386 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-10-11 17:51:54,397 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 14 treesize of output 10 [2024-10-11 17:51:55,534 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-10-11 17:51:55,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2024-10-11 17:51:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 17:51:55,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:57,738 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 66 treesize of output 56 [2024-10-11 17:51:57,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:51:57,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 176 [2024-10-11 17:51:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:58,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082442189] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:58,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:58,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 20] total 42 [2024-10-11 17:51:58,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898611181] [2024-10-11 17:51:58,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:58,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 17:51:58,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:58,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 17:51:58,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1618, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 17:51:58,030 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand has 43 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 43 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:02,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:52:04,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:04,038 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2024-10-11 17:52:04,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 17:52:04,039 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 43 states have internal predecessors, (83), 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-10-11 17:52:04,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:04,039 INFO L225 Difference]: With dead ends: 96 [2024-10-11 17:52:04,040 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 17:52:04,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=519, Invalid=4311, Unknown=0, NotChecked=0, Total=4830 [2024-10-11 17:52:04,041 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 76 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:04,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 385 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 990 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 17:52:04,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 17:52:04,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-10-11 17:52:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-10-11 17:52:04,048 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 31 [2024-10-11 17:52:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:04,048 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-10-11 17:52:04,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 43 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-10-11 17:52:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 17:52:04,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:04,049 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:04,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 17:52:04,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-11 17:52:04,250 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:52:04,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1086807047, now seen corresponding path program 3 times [2024-10-11 17:52:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:04,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361552742] [2024-10-11 17:52:04,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 9 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:04,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:04,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361552742] [2024-10-11 17:52:04,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361552742] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:52:04,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599319102] [2024-10-11 17:52:04,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:52:04,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:04,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:04,832 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:52:04,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 17:52:04,982 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-11 17:52:04,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:52:04,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-11 17:52:04,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:52:05,015 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-11 17:52:05,016 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 1 case distinctions, treesize of input 13 treesize of output 11 [2024-10-11 17:52:05,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 17:52:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:05,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:52:06,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:52:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:06,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599319102] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:52:06,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:52:06,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 41 [2024-10-11 17:52:06,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820735005] [2024-10-11 17:52:06,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:52:06,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-11 17:52:06,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:06,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-11 17:52:06,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1561, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 17:52:06,567 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 42 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 42 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:08,277 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2024-10-11 17:52:08,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 17:52:08,277 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 42 states have internal predecessors, (88), 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-10-11 17:52:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:08,277 INFO L225 Difference]: With dead ends: 63 [2024-10-11 17:52:08,277 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 17:52:08,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=508, Invalid=4322, Unknown=0, NotChecked=0, Total=4830 [2024-10-11 17:52:08,279 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 48 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:08,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 169 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:52:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 17:52:08,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 17:52:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-10-11 17:52:08,280 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 31 [2024-10-11 17:52:08,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:08,281 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-10-11 17:52:08,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 42 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:08,281 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-10-11 17:52:08,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 17:52:08,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:08,281 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:08,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 17:52:08,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-11 17:52:08,482 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:52:08,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1969827484, now seen corresponding path program 4 times [2024-10-11 17:52:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:08,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164585116] [2024-10-11 17:52:08,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:08,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:09,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164585116] [2024-10-11 17:52:09,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164585116] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:52:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641587570] [2024-10-11 17:52:09,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:52:09,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:09,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:09,421 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:52:09,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 17:52:09,566 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:52:09,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:52:09,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-10-11 17:52:09,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:52:09,597 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 13 treesize of output 1 [2024-10-11 17:52:09,627 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 13 treesize of output 9 [2024-10-11 17:52:11,550 INFO L349 Elim1Store]: treesize reduction 28, result has 56.9 percent of original size [2024-10-11 17:52:11,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 73 treesize of output 71 [2024-10-11 17:52:11,554 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-10-11 17:52:11,574 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-10-11 17:52:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:11,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:52:14,356 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 119 treesize of output 103 [2024-10-11 17:52:14,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 89 [2024-10-11 17:52:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:14,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641587570] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:52:14,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:52:14,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 29, 29] total 71 [2024-10-11 17:52:14,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756114981] [2024-10-11 17:52:14,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:52:14,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2024-10-11 17:52:14,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:14,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2024-10-11 17:52:14,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=4603, Unknown=0, NotChecked=0, Total=5112 [2024-10-11 17:52:14,605 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 72 states, 71 states have (on average 2.056338028169014) internal successors, (146), 72 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:18,734 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2024-10-11 17:52:18,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-11 17:52:18,734 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 2.056338028169014) internal successors, (146), 72 states have internal predecessors, (146), 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 50 [2024-10-11 17:52:18,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:18,735 INFO L225 Difference]: With dead ends: 91 [2024-10-11 17:52:18,735 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 17:52:18,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1843 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1278, Invalid=12062, Unknown=0, NotChecked=0, Total=13340 [2024-10-11 17:52:18,739 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:18,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 17:52:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 17:52:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 17:52:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:18,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2024-10-11 17:52:18,743 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 50 [2024-10-11 17:52:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:18,744 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2024-10-11 17:52:18,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 2.056338028169014) internal successors, (146), 72 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:52:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2024-10-11 17:52:18,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 17:52:18,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:52:18,745 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:18,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 17:52:18,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:18,946 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-10-11 17:52:18,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:52:18,946 INFO L85 PathProgramCache]: Analyzing trace with hash -19426460, now seen corresponding path program 5 times [2024-10-11 17:52:18,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:52:18,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314730606] [2024-10-11 17:52:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:52:18,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:52:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:52:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:20,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:52:20,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314730606] [2024-10-11 17:52:20,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314730606] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:52:20,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525170422] [2024-10-11 17:52:20,885 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 17:52:20,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:20,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:52:20,887 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:52:20,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 17:52:21,365 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2024-10-11 17:52:21,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:52:21,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 197 conjuncts are in the unsatisfiable core [2024-10-11 17:52:21,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:52:21,442 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 14 treesize of output 10