./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0513_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/list-ext-properties/test-0513_1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:55:07,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:55:07,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:55:07,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:55:07,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:55:07,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:55:07,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:55:07,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:55:07,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:55:07,734 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:55:07,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:55:07,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:55:07,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:55:07,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:55:07,736 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:55:07,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:55:07,737 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:55:07,737 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:55:07,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:55:07,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:55:07,741 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:55:07,742 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:55:07,742 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:55:07,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:55:07,746 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:55:07,747 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:55:07,747 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:55:07,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:55:07,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:55:07,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:55:07,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:55:07,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:55:07,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:55:07,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:55:07,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:55:07,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:55:07,757 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:55:07,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:55:07,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:55:07,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:55:07,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:55:07,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:55:07,758 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2024-10-11 17:55:08,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:55:08,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:55:08,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:55:08,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:55:08,023 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:55:08,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2024-10-11 17:55:09,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:55:09,680 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:55:09,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2024-10-11 17:55:09,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d23fb6a1e/0b700f4744644a48ad045bc15c8fdf55/FLAG420cbbf0c [2024-10-11 17:55:10,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d23fb6a1e/0b700f4744644a48ad045bc15c8fdf55 [2024-10-11 17:55:10,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:55:10,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:55:10,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:55:10,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:55:10,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:55:10,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:55:10" (1/1) ... [2024-10-11 17:55:10,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729cd8c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:10, skipping insertion in model container [2024-10-11 17:55:10,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:55:10" (1/1) ... [2024-10-11 17:55:10,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:55:10,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:55:10,449 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:55:10,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:55:10,538 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:55:10,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:10 WrapperNode [2024-10-11 17:55:10,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:55:10,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:55:10,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:55:10,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:55:10,548 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:55:10" (1/1) ... [2024-10-11 17:55:10,565 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:55:10" (1/1) ... [2024-10-11 17:55:10,600 INFO L138 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2024-10-11 17:55:10,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:55:10,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:55:10,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:55:10,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:55:10,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:10" (1/1) ... [2024-10-11 17:55:10,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:10" (1/1) ... [2024-10-11 17:55:10,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:10" (1/1) ... [2024-10-11 17:55:10,633 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 13 writes are split as follows [0, 13]. [2024-10-11 17:55:10,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:10" (1/1) ... [2024-10-11 17:55:10,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:10" (1/1) ... [2024-10-11 17:55:10,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:10" (1/1) ... [2024-10-11 17:55:10,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:10" (1/1) ... [2024-10-11 17:55:10,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:10" (1/1) ... [2024-10-11 17:55:10,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:10" (1/1) ... [2024-10-11 17:55:10,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:55:10,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:55:10,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:55:10,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:55:10,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:10" (1/1) ... [2024-10-11 17:55:10,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:55:10,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:10,687 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:55:10,690 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:55:10,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:55:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:55:10,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:55:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:55:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:55:10,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:55:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:55:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:55:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:55:10,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:55:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:55:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:55:10,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:55:10,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:55:10,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:55:10,848 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:55:10,850 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:55:11,244 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-10-11 17:55:11,245 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:55:11,307 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:55:11,308 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 17:55:11,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:55:11 BoogieIcfgContainer [2024-10-11 17:55:11,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:55:11,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:55:11,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:55:11,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:55:11,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:55:10" (1/3) ... [2024-10-11 17:55:11,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee794b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:55:11, skipping insertion in model container [2024-10-11 17:55:11,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:10" (2/3) ... [2024-10-11 17:55:11,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee794b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:55:11, skipping insertion in model container [2024-10-11 17:55:11,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:55:11" (3/3) ... [2024-10-11 17:55:11,318 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2024-10-11 17:55:11,334 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:55:11,335 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2024-10-11 17:55:11,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:55:11,379 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;@1b0fd8cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:55:11,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2024-10-11 17:55:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 61 states have (on average 2.4754098360655736) internal successors, (151), 131 states have internal predecessors, (151), 0 states have call successors, (0), 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:55:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:55:11,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:11,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:55:11,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:11,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:11,399 INFO L85 PathProgramCache]: Analyzing trace with hash 8988236, now seen corresponding path program 1 times [2024-10-11 17:55:11,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:11,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949372869] [2024-10-11 17:55:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:11,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:11,553 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:55:11,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:11,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949372869] [2024-10-11 17:55:11,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949372869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:11,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:11,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:11,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614275836] [2024-10-11 17:55:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:11,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:55:11,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:11,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:55:11,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:55:11,598 INFO L87 Difference]: Start difference. First operand has 132 states, 61 states have (on average 2.4754098360655736) internal successors, (151), 131 states have internal predecessors, (151), 0 states have call successors, (0), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:11,663 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2024-10-11 17:55:11,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:55:11,666 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:55:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:11,674 INFO L225 Difference]: With dead ends: 132 [2024-10-11 17:55:11,674 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 17:55:11,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:55:11,710 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:11,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 17:55:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-11 17:55:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 61 states have (on average 2.377049180327869) internal successors, (145), 130 states have internal predecessors, (145), 0 states have call successors, (0), 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:55:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2024-10-11 17:55:11,786 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 4 [2024-10-11 17:55:11,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:11,787 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2024-10-11 17:55:11,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:11,787 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2024-10-11 17:55:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:55:11,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:11,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:55:11,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:55:11,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:11,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:11,791 INFO L85 PathProgramCache]: Analyzing trace with hash -23037624, now seen corresponding path program 1 times [2024-10-11 17:55:11,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:11,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135638311] [2024-10-11 17:55:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:11,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:11,858 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:55:11,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:11,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135638311] [2024-10-11 17:55:11,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135638311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:11,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:11,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:55:11,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822231177] [2024-10-11 17:55:11,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:11,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:11,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:11,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:11,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:11,865 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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:55:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:12,008 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2024-10-11 17:55:12,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:12,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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:55:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:12,012 INFO L225 Difference]: With dead ends: 173 [2024-10-11 17:55:12,012 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 17:55:12,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:55:12,013 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 38 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:12,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 186 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 17:55:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 135. [2024-10-11 17:55:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 65 states have (on average 2.3230769230769233) internal successors, (151), 134 states have internal predecessors, (151), 0 states have call successors, (0), 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:55:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2024-10-11 17:55:12,025 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 6 [2024-10-11 17:55:12,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:12,025 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2024-10-11 17:55:12,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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:55:12,026 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2024-10-11 17:55:12,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:55:12,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:12,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:55:12,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:55:12,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:12,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:12,027 INFO L85 PathProgramCache]: Analyzing trace with hash -23037720, now seen corresponding path program 1 times [2024-10-11 17:55:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:12,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152912981] [2024-10-11 17:55:12,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:12,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:12,102 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:55:12,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:12,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152912981] [2024-10-11 17:55:12,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152912981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:12,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:12,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:12,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083909511] [2024-10-11 17:55:12,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:12,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:12,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:12,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:12,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:12,106 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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:55:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:12,199 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2024-10-11 17:55:12,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:12,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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:55:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:12,201 INFO L225 Difference]: With dead ends: 153 [2024-10-11 17:55:12,202 INFO L226 Difference]: Without dead ends: 152 [2024-10-11 17:55:12,202 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:55:12,203 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:12,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 218 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-11 17:55:12,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144. [2024-10-11 17:55:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 74 states have (on average 2.2972972972972974) internal successors, (170), 143 states have internal predecessors, (170), 0 states have call successors, (0), 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:55:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2024-10-11 17:55:12,212 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 6 [2024-10-11 17:55:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:12,213 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2024-10-11 17:55:12,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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:55:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2024-10-11 17:55:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:55:12,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:12,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:55:12,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:55:12,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:12,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:12,215 INFO L85 PathProgramCache]: Analyzing trace with hash -23037849, now seen corresponding path program 1 times [2024-10-11 17:55:12,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:12,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284626293] [2024-10-11 17:55:12,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:12,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:12,290 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:55:12,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:12,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284626293] [2024-10-11 17:55:12,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284626293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:12,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:12,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:12,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760065192] [2024-10-11 17:55:12,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:12,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:12,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:12,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:12,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:12,294 INFO L87 Difference]: Start difference. First operand 144 states and 170 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:55:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:12,430 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2024-10-11 17:55:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:12,431 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:55:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:12,432 INFO L225 Difference]: With dead ends: 148 [2024-10-11 17:55:12,435 INFO L226 Difference]: Without dead ends: 148 [2024-10-11 17:55:12,435 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:55:12,436 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 48 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:12,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 141 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-11 17:55:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2024-10-11 17:55:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 77 states have (on average 2.1818181818181817) internal successors, (168), 141 states have internal predecessors, (168), 0 states have call successors, (0), 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:55:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 168 transitions. [2024-10-11 17:55:12,447 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 168 transitions. Word has length 6 [2024-10-11 17:55:12,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:12,448 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 168 transitions. [2024-10-11 17:55:12,448 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:55:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 168 transitions. [2024-10-11 17:55:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:55:12,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:12,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:55:12,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:55:12,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:12,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash -23037848, now seen corresponding path program 1 times [2024-10-11 17:55:12,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:12,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606191707] [2024-10-11 17:55:12,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:12,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:12,576 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:55:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606191707] [2024-10-11 17:55:12,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606191707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:12,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:12,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:12,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513453318] [2024-10-11 17:55:12,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:12,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:12,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:12,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:12,581 INFO L87 Difference]: Start difference. First operand 142 states and 168 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:55:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:12,691 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2024-10-11 17:55:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:12,692 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:55:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:12,693 INFO L225 Difference]: With dead ends: 138 [2024-10-11 17:55:12,694 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 17:55:12,694 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:55:12,695 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 26 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:12,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 160 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 17:55:12,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-10-11 17:55:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 77 states have (on average 2.0779220779220777) internal successors, (160), 137 states have internal predecessors, (160), 0 states have call successors, (0), 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:55:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2024-10-11 17:55:12,711 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 6 [2024-10-11 17:55:12,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:12,714 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2024-10-11 17:55:12,715 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:55:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2024-10-11 17:55:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 17:55:12,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:12,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:12,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:55:12,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:12,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:12,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1000297805, now seen corresponding path program 1 times [2024-10-11 17:55:12,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:12,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746519394] [2024-10-11 17:55:12,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:12,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:12,796 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:55:12,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:12,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746519394] [2024-10-11 17:55:12,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746519394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:12,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:12,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:55:12,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072028483] [2024-10-11 17:55:12,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:12,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:12,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:12,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:12,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:12,800 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand has 4 states, 4 states have (on average 3.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:55:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:12,894 INFO L93 Difference]: Finished difference Result 258 states and 292 transitions. [2024-10-11 17:55:12,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:12,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.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:55:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:12,896 INFO L225 Difference]: With dead ends: 258 [2024-10-11 17:55:12,897 INFO L226 Difference]: Without dead ends: 258 [2024-10-11 17:55:12,897 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:55:12,900 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 131 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:12,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 335 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:12,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-11 17:55:12,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 141. [2024-10-11 17:55:12,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 80 states have (on average 2.0) internal successors, (160), 140 states have internal predecessors, (160), 0 states have call successors, (0), 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:55:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2024-10-11 17:55:12,913 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 12 [2024-10-11 17:55:12,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:12,913 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2024-10-11 17:55:12,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.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:55:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2024-10-11 17:55:12,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:55:12,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:12,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:12,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:55:12,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:12,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:12,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2113703728, now seen corresponding path program 1 times [2024-10-11 17:55:12,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:12,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931679765] [2024-10-11 17:55:12,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:12,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,035 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:55:13,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:13,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931679765] [2024-10-11 17:55:13,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931679765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:13,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:13,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:13,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009451247] [2024-10-11 17:55:13,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:13,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:13,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:13,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:13,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:13,037 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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:55:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:13,124 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2024-10-11 17:55:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:13,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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:55:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:13,126 INFO L225 Difference]: With dead ends: 137 [2024-10-11 17:55:13,126 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 17:55:13,126 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:55:13,127 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 15 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:13,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 161 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 17:55:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-11 17:55:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.95) internal successors, (156), 136 states have internal predecessors, (156), 0 states have call successors, (0), 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:55:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2024-10-11 17:55:13,131 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 15 [2024-10-11 17:55:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:13,131 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2024-10-11 17:55:13,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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:55:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2024-10-11 17:55:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:55:13,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:13,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:13,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:55:13,133 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:13,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2113703727, now seen corresponding path program 1 times [2024-10-11 17:55:13,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:13,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399406165] [2024-10-11 17:55:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,230 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:55:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:13,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399406165] [2024-10-11 17:55:13,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399406165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:13,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:13,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:13,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510459797] [2024-10-11 17:55:13,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:13,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:13,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:13,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:13,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:13,232 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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:55:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:13,327 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2024-10-11 17:55:13,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:13,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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:55:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:13,328 INFO L225 Difference]: With dead ends: 134 [2024-10-11 17:55:13,328 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 17:55:13,329 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:55:13,329 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 9 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:13,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 170 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 17:55:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-11 17:55:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 80 states have (on average 1.9125) internal successors, (153), 133 states have internal predecessors, (153), 0 states have call successors, (0), 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:55:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2024-10-11 17:55:13,335 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 15 [2024-10-11 17:55:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:13,335 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2024-10-11 17:55:13,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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:55:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2024-10-11 17:55:13,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:55:13,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:13,336 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:13,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:55:13,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:13,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1024057494, now seen corresponding path program 1 times [2024-10-11 17:55:13,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:13,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016307946] [2024-10-11 17:55:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,436 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:55:13,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:13,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016307946] [2024-10-11 17:55:13,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016307946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:13,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:13,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:13,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040156745] [2024-10-11 17:55:13,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:13,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:13,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:13,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:13,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:13,441 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:13,572 INFO L93 Difference]: Finished difference Result 191 states and 233 transitions. [2024-10-11 17:55:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:13,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 17:55:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:13,573 INFO L225 Difference]: With dead ends: 191 [2024-10-11 17:55:13,573 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 17:55:13,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:13,574 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 85 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:13,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 250 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 17:55:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 134. [2024-10-11 17:55:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 80 states have (on average 1.8875) internal successors, (151), 133 states have internal predecessors, (151), 0 states have call successors, (0), 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:55:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2024-10-11 17:55:13,580 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 21 [2024-10-11 17:55:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:13,580 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2024-10-11 17:55:13,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2024-10-11 17:55:13,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:55:13,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:13,582 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:13,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:55:13,582 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:13,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1024057398, now seen corresponding path program 1 times [2024-10-11 17:55:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:13,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438384911] [2024-10-11 17:55:13,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,677 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:55:13,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:13,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438384911] [2024-10-11 17:55:13,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438384911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:13,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:13,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:55:13,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235396253] [2024-10-11 17:55:13,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:13,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:13,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:13,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:13,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:13,680 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:13,822 INFO L93 Difference]: Finished difference Result 127 states and 145 transitions. [2024-10-11 17:55:13,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:13,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 17:55:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:13,823 INFO L225 Difference]: With dead ends: 127 [2024-10-11 17:55:13,823 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 17:55:13,823 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:55:13,824 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 36 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:13,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 176 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 17:55:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-10-11 17:55:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 81 states have (on average 1.7901234567901234) internal successors, (145), 126 states have internal predecessors, (145), 0 states have call successors, (0), 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:55:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2024-10-11 17:55:13,827 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 21 [2024-10-11 17:55:13,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:13,827 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2024-10-11 17:55:13,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,828 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2024-10-11 17:55:13,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:55:13,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:13,828 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:13,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:55:13,829 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:13,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:13,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1024057399, now seen corresponding path program 1 times [2024-10-11 17:55:13,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:13,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136033541] [2024-10-11 17:55:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,960 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:55:13,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:13,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136033541] [2024-10-11 17:55:13,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136033541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:13,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:13,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:13,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429463951] [2024-10-11 17:55:13,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:13,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:13,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:13,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:13,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:13,964 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:14,181 INFO L93 Difference]: Finished difference Result 179 states and 206 transitions. [2024-10-11 17:55:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:14,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 17:55:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:14,183 INFO L225 Difference]: With dead ends: 179 [2024-10-11 17:55:14,183 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 17:55:14,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:14,184 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 75 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:14,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 256 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:14,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 17:55:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 155. [2024-10-11 17:55:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 111 states have (on average 1.8468468468468469) internal successors, (205), 154 states have internal predecessors, (205), 0 states have call successors, (0), 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:55:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 205 transitions. [2024-10-11 17:55:14,189 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 205 transitions. Word has length 21 [2024-10-11 17:55:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:14,190 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 205 transitions. [2024-10-11 17:55:14,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 205 transitions. [2024-10-11 17:55:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:55:14,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:14,192 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, 1, 1, 1] [2024-10-11 17:55:14,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:55:14,192 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:14,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:14,192 INFO L85 PathProgramCache]: Analyzing trace with hash -399191618, now seen corresponding path program 1 times [2024-10-11 17:55:14,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:14,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335155480] [2024-10-11 17:55:14,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:14,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:14,298 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:55:14,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:14,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335155480] [2024-10-11 17:55:14,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335155480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:14,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:14,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:14,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105186167] [2024-10-11 17:55:14,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:14,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:14,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:14,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:14,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:14,300 INFO L87 Difference]: Start difference. First operand 155 states and 205 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:55:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:14,427 INFO L93 Difference]: Finished difference Result 180 states and 207 transitions. [2024-10-11 17:55:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:14,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:55:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:14,429 INFO L225 Difference]: With dead ends: 180 [2024-10-11 17:55:14,429 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 17:55:14,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:14,430 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 75 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:14,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 286 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:14,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 17:55:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 156. [2024-10-11 17:55:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 112 states have (on average 1.8392857142857142) internal successors, (206), 155 states have internal predecessors, (206), 0 states have call successors, (0), 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:55:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 206 transitions. [2024-10-11 17:55:14,433 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 206 transitions. Word has length 25 [2024-10-11 17:55:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:14,434 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 206 transitions. [2024-10-11 17:55:14,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:55:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 206 transitions. [2024-10-11 17:55:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:55:14,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:14,435 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, 1, 1, 1] [2024-10-11 17:55:14,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:55:14,435 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:14,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash -399145740, now seen corresponding path program 1 times [2024-10-11 17:55:14,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:14,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947559727] [2024-10-11 17:55:14,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:14,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:14,616 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:55:14,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:14,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947559727] [2024-10-11 17:55:14,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947559727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:14,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:14,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378142691] [2024-10-11 17:55:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:14,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:14,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:14,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:14,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:14,618 INFO L87 Difference]: Start difference. First operand 156 states and 206 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:55:14,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:14,797 INFO L93 Difference]: Finished difference Result 176 states and 229 transitions. [2024-10-11 17:55:14,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:14,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:55:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:14,798 INFO L225 Difference]: With dead ends: 176 [2024-10-11 17:55:14,798 INFO L226 Difference]: Without dead ends: 176 [2024-10-11 17:55:14,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:14,799 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 11 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:14,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 255 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-11 17:55:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2024-10-11 17:55:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 122 states have (on average 1.8032786885245902) internal successors, (220), 165 states have internal predecessors, (220), 0 states have call successors, (0), 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:55:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 220 transitions. [2024-10-11 17:55:14,803 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 220 transitions. Word has length 25 [2024-10-11 17:55:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:14,803 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 220 transitions. [2024-10-11 17:55:14,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:55:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 220 transitions. [2024-10-11 17:55:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:55:14,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:14,804 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, 1, 1, 1] [2024-10-11 17:55:14,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:55:14,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:14,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:14,805 INFO L85 PathProgramCache]: Analyzing trace with hash -399145739, now seen corresponding path program 1 times [2024-10-11 17:55:14,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:14,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035828932] [2024-10-11 17:55:14,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:14,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:15,012 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:55:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:15,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035828932] [2024-10-11 17:55:15,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035828932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:15,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:15,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:55:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273353332] [2024-10-11 17:55:15,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:15,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:15,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:15,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:15,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:15,014 INFO L87 Difference]: Start difference. First operand 166 states and 220 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:55:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:15,149 INFO L93 Difference]: Finished difference Result 167 states and 219 transitions. [2024-10-11 17:55:15,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:15,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:55:15,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:15,151 INFO L225 Difference]: With dead ends: 167 [2024-10-11 17:55:15,151 INFO L226 Difference]: Without dead ends: 167 [2024-10-11 17:55:15,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:15,152 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 6 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:15,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 318 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:15,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-11 17:55:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2024-10-11 17:55:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 119 states have (on average 1.8067226890756303) internal successors, (215), 162 states have internal predecessors, (215), 0 states have call successors, (0), 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:55:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 215 transitions. [2024-10-11 17:55:15,155 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 215 transitions. Word has length 25 [2024-10-11 17:55:15,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:15,156 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 215 transitions. [2024-10-11 17:55:15,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:55:15,156 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 215 transitions. [2024-10-11 17:55:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 17:55:15,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:15,157 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, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:15,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:55:15,157 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:15,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash 447185425, now seen corresponding path program 1 times [2024-10-11 17:55:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:15,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537061178] [2024-10-11 17:55:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:15,595 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:55:15,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:15,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537061178] [2024-10-11 17:55:15,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537061178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:15,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:15,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 17:55:15,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423087720] [2024-10-11 17:55:15,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:15,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:55:15,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:15,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:55:15,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:55:15,597 INFO L87 Difference]: Start difference. First operand 163 states and 215 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:15,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:15,909 INFO L93 Difference]: Finished difference Result 212 states and 274 transitions. [2024-10-11 17:55:15,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:55:15,910 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 17:55:15,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:15,911 INFO L225 Difference]: With dead ends: 212 [2024-10-11 17:55:15,911 INFO L226 Difference]: Without dead ends: 212 [2024-10-11 17:55:15,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:55:15,912 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 130 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:15,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 266 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-11 17:55:15,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 186. [2024-10-11 17:55:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 142 states have (on average 1.732394366197183) internal successors, (246), 185 states have internal predecessors, (246), 0 states have call successors, (0), 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:55:15,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 246 transitions. [2024-10-11 17:55:15,916 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 246 transitions. Word has length 28 [2024-10-11 17:55:15,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:15,916 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 246 transitions. [2024-10-11 17:55:15,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 246 transitions. [2024-10-11 17:55:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 17:55:15,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:15,917 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, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:15,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:55:15,918 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:15,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:15,918 INFO L85 PathProgramCache]: Analyzing trace with hash 447185426, now seen corresponding path program 1 times [2024-10-11 17:55:15,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:15,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440947296] [2024-10-11 17:55:15,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:15,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:16,424 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:55:16,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:16,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440947296] [2024-10-11 17:55:16,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440947296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:16,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:16,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:55:16,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30099163] [2024-10-11 17:55:16,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:16,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:55:16,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:16,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:55:16,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:16,429 INFO L87 Difference]: Start difference. First operand 186 states and 246 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:16,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:16,961 INFO L93 Difference]: Finished difference Result 282 states and 354 transitions. [2024-10-11 17:55:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:55:16,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-11 17:55:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:16,963 INFO L225 Difference]: With dead ends: 282 [2024-10-11 17:55:16,964 INFO L226 Difference]: Without dead ends: 282 [2024-10-11 17:55:16,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:55:16,964 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 219 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:16,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 309 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:55:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-11 17:55:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 206. [2024-10-11 17:55:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 162 states have (on average 1.7592592592592593) internal successors, (285), 205 states have internal predecessors, (285), 0 states have call successors, (0), 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:55:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 285 transitions. [2024-10-11 17:55:16,970 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 285 transitions. Word has length 28 [2024-10-11 17:55:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:16,970 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 285 transitions. [2024-10-11 17:55:16,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 285 transitions. [2024-10-11 17:55:16,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:55:16,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:16,973 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:16,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:55:16,974 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:16,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash 977845608, now seen corresponding path program 1 times [2024-10-11 17:55:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:16,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382196072] [2024-10-11 17:55:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:16,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:17,212 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:55:17,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:17,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382196072] [2024-10-11 17:55:17,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382196072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:17,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:17,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:55:17,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786374702] [2024-10-11 17:55:17,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:17,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:55:17,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:17,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:55:17,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:17,215 INFO L87 Difference]: Start difference. First operand 206 states and 285 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:17,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:17,347 INFO L93 Difference]: Finished difference Result 214 states and 293 transitions. [2024-10-11 17:55:17,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:55:17,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 17:55:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:17,349 INFO L225 Difference]: With dead ends: 214 [2024-10-11 17:55:17,349 INFO L226 Difference]: Without dead ends: 214 [2024-10-11 17:55:17,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:55:17,350 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 23 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:17,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 244 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-11 17:55:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2024-10-11 17:55:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 167 states have (on average 1.7365269461077844) internal successors, (290), 210 states have internal predecessors, (290), 0 states have call successors, (0), 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:55:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 290 transitions. [2024-10-11 17:55:17,354 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 290 transitions. Word has length 29 [2024-10-11 17:55:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:17,354 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 290 transitions. [2024-10-11 17:55:17,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 290 transitions. [2024-10-11 17:55:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:55:17,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:17,355 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:17,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:55:17,356 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:17,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash 977848120, now seen corresponding path program 1 times [2024-10-11 17:55:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:17,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206238323] [2024-10-11 17:55:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:17,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:55:17,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:17,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206238323] [2024-10-11 17:55:17,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206238323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:17,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:17,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:55:17,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744293240] [2024-10-11 17:55:17,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:17,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:17,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:17,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:17,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:17,415 INFO L87 Difference]: Start difference. First operand 211 states and 290 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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:55:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:17,585 INFO L93 Difference]: Finished difference Result 271 states and 372 transitions. [2024-10-11 17:55:17,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:17,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 17:55:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:17,586 INFO L225 Difference]: With dead ends: 271 [2024-10-11 17:55:17,586 INFO L226 Difference]: Without dead ends: 271 [2024-10-11 17:55:17,587 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:55:17,587 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 68 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:17,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 209 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-11 17:55:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 213. [2024-10-11 17:55:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 173 states have (on average 1.722543352601156) internal successors, (298), 212 states have internal predecessors, (298), 0 states have call successors, (0), 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:55:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 298 transitions. [2024-10-11 17:55:17,591 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 298 transitions. Word has length 29 [2024-10-11 17:55:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:17,592 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 298 transitions. [2024-10-11 17:55:17,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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:55:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2024-10-11 17:55:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:55:17,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:17,593 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:17,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:55:17,593 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:17,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:17,593 INFO L85 PathProgramCache]: Analyzing trace with hash 977848121, now seen corresponding path program 1 times [2024-10-11 17:55:17,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:17,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420904679] [2024-10-11 17:55:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:17,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:18,185 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:55:18,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:18,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420904679] [2024-10-11 17:55:18,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420904679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:18,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:18,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:55:18,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927926993] [2024-10-11 17:55:18,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:18,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:55:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:18,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:55:18,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:55:18,189 INFO L87 Difference]: Start difference. First operand 213 states and 298 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:18,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:18,688 INFO L93 Difference]: Finished difference Result 247 states and 339 transitions. [2024-10-11 17:55:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:55:18,689 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 17:55:18,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:18,690 INFO L225 Difference]: With dead ends: 247 [2024-10-11 17:55:18,690 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 17:55:18,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:55:18,691 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 50 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:18,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 335 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:55:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 17:55:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 217. [2024-10-11 17:55:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.7118644067796611) internal successors, (303), 216 states have internal predecessors, (303), 0 states have call successors, (0), 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:55:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 303 transitions. [2024-10-11 17:55:18,696 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 303 transitions. Word has length 29 [2024-10-11 17:55:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:18,696 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 303 transitions. [2024-10-11 17:55:18,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 303 transitions. [2024-10-11 17:55:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 17:55:18,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:18,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:18,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:55:18,697 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:18,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:18,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1688105793, now seen corresponding path program 1 times [2024-10-11 17:55:18,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:18,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058379651] [2024-10-11 17:55:18,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:18,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:55:18,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:18,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058379651] [2024-10-11 17:55:18,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058379651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:18,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:18,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:55:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781044137] [2024-10-11 17:55:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:18,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:18,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:18,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:18,737 INFO L87 Difference]: Start difference. First operand 217 states and 303 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:18,772 INFO L93 Difference]: Finished difference Result 218 states and 304 transitions. [2024-10-11 17:55:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:18,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-11 17:55:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:18,774 INFO L225 Difference]: With dead ends: 218 [2024-10-11 17:55:18,774 INFO L226 Difference]: Without dead ends: 218 [2024-10-11 17:55:18,774 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:55:18,774 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:18,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:18,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-11 17:55:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2024-10-11 17:55:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 178 states have (on average 1.7078651685393258) internal successors, (304), 217 states have internal predecessors, (304), 0 states have call successors, (0), 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:55:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 304 transitions. [2024-10-11 17:55:18,779 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 304 transitions. Word has length 32 [2024-10-11 17:55:18,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:18,780 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 304 transitions. [2024-10-11 17:55:18,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 304 transitions. [2024-10-11 17:55:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 17:55:18,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:18,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:18,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:55:18,781 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:18,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:18,782 INFO L85 PathProgramCache]: Analyzing trace with hash -791815975, now seen corresponding path program 1 times [2024-10-11 17:55:18,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:18,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523103852] [2024-10-11 17:55:18,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:18,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:19,045 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:55:19,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:19,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523103852] [2024-10-11 17:55:19,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523103852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:19,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:19,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:55:19,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762333059] [2024-10-11 17:55:19,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:19,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:55:19,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:19,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:55:19,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:55:19,048 INFO L87 Difference]: Start difference. First operand 218 states and 304 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:55:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:19,344 INFO L93 Difference]: Finished difference Result 303 states and 386 transitions. [2024-10-11 17:55:19,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:55:19,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 17:55:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:19,345 INFO L225 Difference]: With dead ends: 303 [2024-10-11 17:55:19,346 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 17:55:19,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:55:19,346 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 241 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:19,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 374 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 17:55:19,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 223. [2024-10-11 17:55:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 183 states have (on average 1.710382513661202) internal successors, (313), 222 states have internal predecessors, (313), 0 states have call successors, (0), 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:55:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 313 transitions. [2024-10-11 17:55:19,352 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 313 transitions. Word has length 33 [2024-10-11 17:55:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:19,352 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 313 transitions. [2024-10-11 17:55:19,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 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:55:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 313 transitions. [2024-10-11 17:55:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 17:55:19,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:19,353 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:19,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:55:19,353 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:19,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:19,353 INFO L85 PathProgramCache]: Analyzing trace with hash -791664808, now seen corresponding path program 1 times [2024-10-11 17:55:19,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:19,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590295747] [2024-10-11 17:55:19,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:20,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:20,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590295747] [2024-10-11 17:55:20,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590295747] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:20,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909884763] [2024-10-11 17:55:20,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:20,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:20,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:20,065 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:55:20,066 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:55:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:20,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 17:55:20,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:20,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:55:20,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:55:20,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 17:55:20,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 17:55:20,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 17:55:20,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 17:55:20,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 17:55:20,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 17:55:20,439 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 17:55:20,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 17:55:20,464 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 17:55:20,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 17:55:20,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-10-11 17:55:20,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-10-11 17:55:20,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 17:55:21,033 INFO L349 Elim1Store]: treesize reduction 57, result has 38.7 percent of original size [2024-10-11 17:55:21,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 137 treesize of output 134 [2024-10-11 17:55:21,098 INFO L349 Elim1Store]: treesize reduction 45, result has 38.4 percent of original size [2024-10-11 17:55:21,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 97 treesize of output 92 [2024-10-11 17:55:21,191 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2024-10-11 17:55:21,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 103 [2024-10-11 17:55:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:21,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:21,362 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:55:21,897 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-10-11 17:55:21,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 104 [2024-10-11 17:55:21,930 INFO L349 Elim1Store]: treesize reduction 10, result has 66.7 percent of original size [2024-10-11 17:55:21,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 152 [2024-10-11 17:55:22,223 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:55:22,233 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:55:22,301 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:55:22,313 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:55:22,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-11 17:55:22,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-11 17:55:22,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-11 17:55:22,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:22,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2024-10-11 17:55:22,474 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:22,475 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 15 treesize of output 9 [2024-10-11 17:55:23,178 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (let ((.cse9 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_3 Int)) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_3) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3)))))) (.cse10 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_69| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse23 (select v_arrayElimArr_1 4))) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_69| 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| .cse23) (< .cse23 |v_ULTIMATE.start_main_~item~0#1.offset_69|))))))) (.cse0 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) (.cse8 (not .cse2))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_28 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_28) (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_69| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_69| 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)) (= (select (select .cse1 v_arrayElimCell_28) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (= (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (< (select v_arrayElimArr_1 4) |v_ULTIMATE.start_main_~item~0#1.offset_69|)))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (or .cse2 (and (forall ((v_arrayElimCell_28 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_28) (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_69| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1))) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_69| 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)) (= (select (select .cse3 v_arrayElimCell_28) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (< (select v_arrayElimArr_1 4) |v_ULTIMATE.start_main_~item~0#1.offset_69|)))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_3 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse5 (select v_arrayElimArr_2 4)) (.cse4 (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (= (select (select .cse4 .cse5) v_prenex_3) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse5) (= (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_3) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_3 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse6 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse6) v_prenex_3) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse6)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_3 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse7 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse7) v_prenex_3) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse7) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_69| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_28 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_69| 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_28) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_28) (< (select v_arrayElimArr_1 4) |v_ULTIMATE.start_main_~item~0#1.offset_69|))))) (or .cse2 (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_69| Int) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_28 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_69| 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) v_arrayElimCell_28) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_28) (< (select v_arrayElimArr_1 4) |v_ULTIMATE.start_main_~item~0#1.offset_69|)))) (or .cse8 (and .cse9 .cse10 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimCell_28 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_28) (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_69| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse12 (select v_arrayElimArr_1 4))) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_69| 0) (= (select (select .cse11 v_arrayElimCell_28) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (= (select (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| .cse12) (< .cse12 |v_ULTIMATE.start_main_~item~0#1.offset_69|)))))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse14 (select v_arrayElimArr_2 4)) (.cse13 (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (= (select (select .cse13 .cse14) v_prenex_3) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse14) (= (select (select .cse13 |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_3) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3)))))) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_3 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse15 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (< v_prenex_3 0) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse15) v_prenex_3) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse15) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3)))) .cse2) (or (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_69| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse16 (select v_arrayElimArr_1 4))) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_69| 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| .cse16) (< .cse16 |v_ULTIMATE.start_main_~item~0#1.offset_69|)))) .cse8) (or .cse8 (and .cse9 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_3 Int)) (let ((.cse17 (select v_arrayElimArr_2 4))) (or (not (= .cse17 |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse17) v_prenex_3) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int))) (or (forall ((v_prenex_3 Int)) (or (< v_prenex_3 0) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_3) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3))) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_28 Int) (v_prenex_3 Int)) (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (or (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (= (select (select .cse18 |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_3) 0) (= (select (select .cse18 v_arrayElimCell_28) v_prenex_3) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) .cse10 (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_69| Int) (v_arrayElimCell_28 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse19 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse20 (select v_arrayElimArr_1 4))) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_69| 0) (= (select (select .cse19 v_arrayElimCell_28) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (= (select (select .cse19 |c_ULTIMATE.start_main_~item~0#1.base|) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| .cse20) (< .cse20 |v_ULTIMATE.start_main_~item~0#1.offset_69|)))))))) (or .cse8 (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_3 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_3) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3)))) (or .cse2 (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_3 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse21 (select v_arrayElimArr_2 4))) (or (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (< v_prenex_3 0) (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse21) v_prenex_3) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse21))))) (or .cse8 (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_28 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_28) (= (select (select .cse22 |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_3) 0) (= (select (select .cse22 v_arrayElimCell_28) v_prenex_3) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3)))))))) is different from false [2024-10-11 17:55:28,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((v_ArrVal_693 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_69| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_69| 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| .cse0) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_693) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (< .cse0 |v_ULTIMATE.start_main_~item~0#1.offset_69|)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (not (= v_ArrVal_693 (store .cse1 .cse2 (select v_ArrVal_693 .cse2)))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_3 Int) (v_arrayElimCell_28 Int) (v_ArrVal_691 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse4 .cse2 v_ArrVal_691)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (= (select (select .cse3 |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_3) 0) (= (select (select .cse3 v_arrayElimCell_28) v_prenex_3) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3)))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimCell_28 Int) (v_prenex_3 Int) (v_ArrVal_691 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse4 .cse2 v_ArrVal_691)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_28) (= (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_3) 0) (= (select (select .cse5 v_arrayElimCell_28) v_prenex_3) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3)))) (forall ((v_ArrVal_693 (Array Int Int))) (or (not (= v_ArrVal_693 (store .cse1 .cse2 (select v_ArrVal_693 .cse2)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_69| Int) (v_arrayElimCell_28 Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_693) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse6 (select v_arrayElimArr_1 4))) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_69| 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| .cse6) (= (select (select .cse7 v_arrayElimCell_28) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (< .cse6 |v_ULTIMATE.start_main_~item~0#1.offset_69|)))))))) (forall ((v_ArrVal_693 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_69| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse8 (select v_arrayElimArr_1 4))) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_69| 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (< |c_ULTIMATE.start_main_~item~0#1.offset| .cse8) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_693) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (< .cse8 |v_ULTIMATE.start_main_~item~0#1.offset_69|)))) (not (= v_ArrVal_693 (store .cse1 .cse2 (select v_ArrVal_693 .cse2)))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_3 Int) (v_ArrVal_691 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse9 (select v_arrayElimArr_2 4))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= .cse9 |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse4 .cse2 v_ArrVal_691)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse9) v_prenex_3) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3)))) (forall ((v_ArrVal_693 (Array Int Int))) (or (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_28 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_28) (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_69| Int) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_693) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1)) (.cse10 (select v_arrayElimArr_1 4))) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_69| 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| .cse10) (= (select (select .cse11 v_arrayElimCell_28) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (= (select (select .cse11 |c_ULTIMATE.start_main_~item~0#1.base|) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (< .cse10 |v_ULTIMATE.start_main_~item~0#1.offset_69|)))))))) (not (= v_ArrVal_693 (store .cse1 .cse2 (select v_ArrVal_693 .cse2)))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_3 Int) (v_ArrVal_691 Int) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse4 .cse2 v_ArrVal_691)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_3) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3))))) is different from false [2024-10-11 17:55:29,130 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (and (forall ((v_arrayElimArr_2 (Array Int Int)) (v_prenex_101 Int) (v_prenex_3 Int) (v_prenex_102 Int) (v_ArrVal_691 Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse1 .cse2 v_ArrVal_691)) v_prenex_102 v_arrayElimArr_2))) (or (= (select (select .cse0 v_prenex_101) v_prenex_3) 0) (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_3) 0) (= v_prenex_102 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< v_prenex_3 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_3)))) (forall ((v_prenex_94 (Array Int Int)) (v_arrayElimCell_28 Int) (v_prenex_96 (Array Int Int)) (v_prenex_95 Int) (v_prenex_93 Int)) (let ((.cse3 (select v_prenex_94 4)) (.cse5 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_prenex_96) v_prenex_95 v_prenex_94))) (or (= v_prenex_95 v_arrayElimCell_28) (< .cse3 v_prenex_93) (< |c_ULTIMATE.start_main_~item~0#1.offset| .cse3) (not (= v_prenex_96 (store .cse4 .cse2 (select v_prenex_96 .cse2)))) (= (select (select .cse5 |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_93) 0) (= v_prenex_95 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select .cse5 v_arrayElimCell_28) v_prenex_93) 0) (< v_prenex_93 0)))) (forall ((v_prenex_114 Int) (v_prenex_115 Int) (v_prenex_112 Int) (v_prenex_113 (Array Int Int)) (v_prenex_116 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_prenex_116) v_prenex_115 v_prenex_113)) (.cse6 (select v_prenex_113 4))) (or (= v_prenex_115 |c_ULTIMATE.start_main_~item~0#1.base|) (not (= v_prenex_116 (store .cse4 .cse2 (select v_prenex_116 .cse2)))) (< |c_ULTIMATE.start_main_~item~0#1.offset| .cse6) (= (select (select .cse7 |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_112) 0) (< v_prenex_112 0) (= 0 (select (select .cse7 v_prenex_114) v_prenex_112)) (< .cse6 v_prenex_112)))) (forall ((v_prenex_108 (Array Int Int)) (v_prenex_110 Int) (v_prenex_111 Int) (v_prenex_109 Int)) (let ((.cse8 (select v_prenex_108 4))) (or (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_109) (not (= .cse8 |c_ULTIMATE.start_main_~item~0#1.base|)) (= v_prenex_111 |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse1 .cse2 v_prenex_110)) v_prenex_111 v_prenex_108) .cse8) v_prenex_109) 0) (< v_prenex_109 0)))) (forall ((v_prenex_98 (Array Int Int)) (v_prenex_99 Int) (v_prenex_100 (Array Int Int)) (v_prenex_97 Int)) (let ((.cse9 (select v_prenex_98 4))) (or (< v_prenex_97 0) (= v_prenex_99 |c_ULTIMATE.start_main_~item~0#1.base|) (< |c_ULTIMATE.start_main_~item~0#1.offset| .cse9) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_prenex_100) v_prenex_99 v_prenex_98) |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_97) 0) (not (= (store .cse4 .cse2 (select v_prenex_100 .cse2)) v_prenex_100)) (< .cse9 v_prenex_97)))) (forall ((v_prenex_105 Int) (v_prenex_106 Int) (v_prenex_104 Int) (v_prenex_103 (Array Int Int)) (v_prenex_107 Int)) (let ((.cse10 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse1 .cse2 v_prenex_106)) v_prenex_107 v_prenex_103))) (or (= v_prenex_107 v_prenex_104) (= (select (select .cse10 |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_105) 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_105) (= v_prenex_107 |c_ULTIMATE.start_main_~item~0#1.base|) (< v_prenex_105 0) (= (select (select .cse10 v_prenex_104) v_prenex_105) 0) (not (= (select v_prenex_103 4) |c_ULTIMATE.start_main_~item~0#1.base|))))) (forall ((v_prenex_120 Int) (v_prenex_118 Int) (v_prenex_119 Int) (v_prenex_117 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store .cse1 .cse2 v_prenex_119)) v_prenex_120 v_prenex_117) |c_ULTIMATE.start_main_~item~0#1.base|) v_prenex_118) 0) (not (= (select v_prenex_117 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (< |c_ULTIMATE.start_main_~item~0#1.offset| v_prenex_118) (< v_prenex_118 0) (= v_prenex_120 |c_ULTIMATE.start_main_~item~0#1.base|))) (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_69| Int) (v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_693 (Array Int Int))) (let ((.cse11 (select v_arrayElimArr_1 4))) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_69| 0) (not (= v_ArrVal_693 (store .cse4 .cse2 (select v_ArrVal_693 .cse2)))) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (< |c_ULTIMATE.start_main_~item~0#1.offset| .cse11) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_693) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) |c_ULTIMATE.start_main_~item~0#1.base|) |v_ULTIMATE.start_main_~item~0#1.offset_69|) 0) (< .cse11 |v_ULTIMATE.start_main_~item~0#1.offset_69|)))))) is different from false [2024-10-11 17:55:29,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:29,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 45 [2024-10-11 17:55:29,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:29,696 INFO L349 Elim1Store]: treesize reduction 18, result has 43.8 percent of original size [2024-10-11 17:55:29,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 38 [2024-10-11 17:55:29,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:29,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2024-10-11 17:55:29,725 INFO L349 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2024-10-11 17:55:29,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2024-10-11 17:55:29,728 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:29,733 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 17:55:29,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 1 [2024-10-11 17:55:29,736 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:29,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-10-11 17:55:29,743 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:29,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-10-11 17:55:29,750 INFO L349 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2024-10-11 17:55:29,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2024-10-11 17:55:29,755 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:29,755 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:29,761 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 17:55:29,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 1 [2024-10-11 17:55:29,764 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:29,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-10-11 17:55:29,771 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:29,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-10-11 17:55:29,779 INFO L349 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2024-10-11 17:55:29,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 1 [2024-10-11 17:55:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:29,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909884763] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:29,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:55:29,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 14] total 29 [2024-10-11 17:55:29,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113368199] [2024-10-11 17:55:29,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:29,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 17:55:29,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:29,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 17:55:29,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=532, Unknown=9, NotChecked=150, Total=812 [2024-10-11 17:55:29,834 INFO L87 Difference]: Start difference. First operand 223 states and 313 transitions. Second operand has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:35,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:35,908 INFO L93 Difference]: Finished difference Result 251 states and 346 transitions. [2024-10-11 17:55:35,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 17:55:35,909 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-11 17:55:35,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:35,912 INFO L225 Difference]: With dead ends: 251 [2024-10-11 17:55:35,912 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 17:55:35,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=246, Invalid=947, Unknown=9, NotChecked=204, Total=1406 [2024-10-11 17:55:35,914 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 162 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:35,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 946 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 758 Invalid, 0 Unknown, 291 Unchecked, 0.9s Time] [2024-10-11 17:55:35,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 17:55:35,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 229. [2024-10-11 17:55:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 189 states have (on average 1.6984126984126984) internal successors, (321), 228 states have internal predecessors, (321), 0 states have call successors, (0), 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:55:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 321 transitions. [2024-10-11 17:55:35,920 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 321 transitions. Word has length 33 [2024-10-11 17:55:35,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:35,920 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 321 transitions. [2024-10-11 17:55:35,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 29 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 321 transitions. [2024-10-11 17:55:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 17:55:35,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:35,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:35,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 17:55:36,123 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,SelfDestructingSolverStorable21 [2024-10-11 17:55:36,124 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:36,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:36,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1223508821, now seen corresponding path program 1 times [2024-10-11 17:55:36,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:36,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642091047] [2024-10-11 17:55:36,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:36,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:36,399 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:55:36,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:36,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642091047] [2024-10-11 17:55:36,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642091047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:36,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:36,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:55:36,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033365058] [2024-10-11 17:55:36,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:36,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:55:36,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:36,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:55:36,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:55:36,400 INFO L87 Difference]: Start difference. First operand 229 states and 321 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 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:55:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:36,873 INFO L93 Difference]: Finished difference Result 310 states and 395 transitions. [2024-10-11 17:55:36,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:55:36,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 17:55:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:36,875 INFO L225 Difference]: With dead ends: 310 [2024-10-11 17:55:36,875 INFO L226 Difference]: Without dead ends: 310 [2024-10-11 17:55:36,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:55:36,876 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 236 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:36,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 353 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:55:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-11 17:55:36,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 230. [2024-10-11 17:55:36,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 190 states have (on average 1.6894736842105262) internal successors, (321), 229 states have internal predecessors, (321), 0 states have call successors, (0), 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:55:36,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 321 transitions. [2024-10-11 17:55:36,881 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 321 transitions. Word has length 34 [2024-10-11 17:55:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:36,881 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 321 transitions. [2024-10-11 17:55:36,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 9 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:55:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 321 transitions. [2024-10-11 17:55:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 17:55:36,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:36,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:36,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:55:36,882 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:36,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:36,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1228194049, now seen corresponding path program 1 times [2024-10-11 17:55:36,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:36,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213052753] [2024-10-11 17:55:36,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:36,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:37,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:37,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213052753] [2024-10-11 17:55:37,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213052753] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:37,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790835505] [2024-10-11 17:55:37,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:37,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:37,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:37,469 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:55:37,470 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:55:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:37,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 17:55:37,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:37,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:55:37,710 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 17:55:37,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 24 [2024-10-11 17:55:37,771 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 17:55:37,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2024-10-11 17:55:37,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:37,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:37,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:37,965 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 17 treesize of output 15 [2024-10-11 17:55:37,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:37,988 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 45 treesize of output 35 [2024-10-11 17:55:38,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 17:55:38,278 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 39 treesize of output 23 [2024-10-11 17:55:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:38,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:38,441 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:55:38,748 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 73 treesize of output 65 [2024-10-11 17:55:38,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-10-11 17:55:39,009 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0)) (.cse8 (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|))) (or (let ((.cse4 (not .cse2)) (.cse5 (not .cse8)) (.cse3 (and (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_73| Int)) (or (forall ((v_ArrVal_828 (Array Int Int)) (v_arrayElimCell_59 Int)) (or (= v_arrayElimCell_59 |c_ULTIMATE.start_main_~data~0#1.base|) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_828) v_arrayElimCell_59) (+ |v_ULTIMATE.start_main_~item~0#1.offset_73| 4))))) (< |v_ULTIMATE.start_main_~item~0#1.offset_73| 0))) (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_73| Int)) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_73| 0) (forall ((v_arrayElimCell_59 Int)) (or (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_828)) (.cse11 (+ |v_ULTIMATE.start_main_~item~0#1.offset_73| 4))) (or (< 1 (select (select .cse10 |c_ULTIMATE.start_main_~item~0#1.base|) .cse11)) (< 1 (select (select .cse10 v_arrayElimCell_59) .cse11))))) (= v_arrayElimCell_59 |c_ULTIMATE.start_main_~data~0#1.base|))))))) (.cse9 (forall ((v_ArrVal_828 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.offset_73| Int) (v_arrayElimCell_59 Int)) (or (= v_arrayElimCell_59 |c_ULTIMATE.start_main_~data~0#1.base|) (< |v_ULTIMATE.start_main_~item~0#1.offset_73| 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_~item~0#1.offset_73|) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_828) v_arrayElimCell_59) (+ |v_ULTIMATE.start_main_~item~0#1.offset_73| 4))))))) (and (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_73| Int)) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_73| 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_~item~0#1.offset_73|) (forall ((v_arrayElimCell_59 Int)) (or (forall ((v_ArrVal_828 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_828)) (.cse1 (+ |v_ULTIMATE.start_main_~item~0#1.offset_73| 4))) (or (< 1 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) .cse1)) (< 1 (select (select .cse0 v_arrayElimCell_59) .cse1))))) (= v_arrayElimCell_59 |c_ULTIMATE.start_main_~data~0#1.base|))))) (or .cse2 .cse3) (or (forall ((v_ArrVal_828 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.offset_73| Int)) (or (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_828) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_~item~0#1.offset_73| 4))) (< |v_ULTIMATE.start_main_~item~0#1.offset_73| 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_~item~0#1.offset_73|))) .cse4 .cse5) (or .cse4 .cse5 (and (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_73| Int)) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_73| 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_~item~0#1.offset_73|) (forall ((v_ArrVal_828 (Array Int Int)) (v_arrayElimCell_59 Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_828)) (.cse7 (+ |v_ULTIMATE.start_main_~item~0#1.offset_73| 4))) (or (< 1 (select (select .cse6 |c_ULTIMATE.start_main_~item~0#1.base|) .cse7)) (< 1 (select (select .cse6 v_arrayElimCell_59) .cse7))))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.offset_73| Int)) (or (< |v_ULTIMATE.start_main_~item~0#1.offset_73| 0) (< |c_ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_~item~0#1.offset_73|) (forall ((v_ArrVal_828 (Array Int Int))) (< 1 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_828) |c_ULTIMATE.start_main_~item~0#1.base|) (+ |v_ULTIMATE.start_main_~item~0#1.offset_73| 4)))))))) (or .cse3 .cse8) (or .cse8 .cse9) (or .cse2 .cse9))) (and .cse2 (= |c_ULTIMATE.start_main_~item~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|) .cse8))) is different from false [2024-10-11 17:55:40,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:40,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-10-11 17:55:40,154 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:40,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:40,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2024-10-11 17:55:40,198 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-11 17:55:40,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2024-10-11 17:55:40,207 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-11 17:55:40,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2024-10-11 17:55:40,216 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-11 17:55:40,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2024-10-11 17:55:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:40,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790835505] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:40,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:55:40,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 36 [2024-10-11 17:55:40,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401800577] [2024-10-11 17:55:40,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:40,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-11 17:55:40,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:40,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-11 17:55:40,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1080, Unknown=6, NotChecked=68, Total=1332 [2024-10-11 17:55:40,315 INFO L87 Difference]: Start difference. First operand 230 states and 321 transitions. Second operand has 37 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 36 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:55:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:43,039 INFO L93 Difference]: Finished difference Result 263 states and 356 transitions. [2024-10-11 17:55:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 17:55:43,040 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 36 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) Word has length 34 [2024-10-11 17:55:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:43,041 INFO L225 Difference]: With dead ends: 263 [2024-10-11 17:55:43,041 INFO L226 Difference]: Without dead ends: 263 [2024-10-11 17:55:43,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=430, Invalid=2113, Unknown=11, NotChecked=98, Total=2652 [2024-10-11 17:55:43,043 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 285 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 44 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:43,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 966 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1445 Invalid, 7 Unknown, 177 Unchecked, 1.6s Time] [2024-10-11 17:55:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-11 17:55:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 229. [2024-10-11 17:55:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 189 states have (on average 1.687830687830688) internal successors, (319), 228 states have internal predecessors, (319), 0 states have call successors, (0), 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:55:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 319 transitions. [2024-10-11 17:55:43,051 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 319 transitions. Word has length 34 [2024-10-11 17:55:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:43,051 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 319 transitions. [2024-10-11 17:55:43,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 36 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:55:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 319 transitions. [2024-10-11 17:55:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 17:55:43,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:43,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:43,073 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:55:43,252 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:55:43,252 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:43,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:43,253 INFO L85 PathProgramCache]: Analyzing trace with hash -725717349, now seen corresponding path program 1 times [2024-10-11 17:55:43,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:43,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137753666] [2024-10-11 17:55:43,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:43,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:43,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137753666] [2024-10-11 17:55:43,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137753666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:43,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:43,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 17:55:43,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133474896] [2024-10-11 17:55:43,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:43,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:55:43,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:43,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:55:43,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:55:43,852 INFO L87 Difference]: Start difference. First operand 229 states and 319 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 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:55:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:44,531 INFO L93 Difference]: Finished difference Result 258 states and 350 transitions. [2024-10-11 17:55:44,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:55:44,531 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-11 17:55:44,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:44,532 INFO L225 Difference]: With dead ends: 258 [2024-10-11 17:55:44,532 INFO L226 Difference]: Without dead ends: 258 [2024-10-11 17:55:44,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2024-10-11 17:55:44,533 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 84 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:44,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 663 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:55:44,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-11 17:55:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 229. [2024-10-11 17:55:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 189 states have (on average 1.6825396825396826) internal successors, (318), 228 states have internal predecessors, (318), 0 states have call successors, (0), 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:55:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 318 transitions. [2024-10-11 17:55:44,538 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 318 transitions. Word has length 35 [2024-10-11 17:55:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:44,538 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 318 transitions. [2024-10-11 17:55:44,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 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:55:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 318 transitions. [2024-10-11 17:55:44,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 17:55:44,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:44,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:44,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:55:44,542 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:44,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:44,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1077876517, now seen corresponding path program 1 times [2024-10-11 17:55:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:44,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268623260] [2024-10-11 17:55:44,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:44,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:44,924 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:55:44,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:44,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268623260] [2024-10-11 17:55:44,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268623260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:44,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438431405] [2024-10-11 17:55:44,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:44,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:44,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:44,927 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:55:44,928 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:55:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:45,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 17:55:45,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:45,107 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 17:55:45,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2024-10-11 17:55:45,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:45,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:45,232 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 23 treesize of output 21 [2024-10-11 17:55:45,292 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 17:55:45,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 16 treesize of output 29 [2024-10-11 17:55:45,515 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:55:45,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:45,699 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 88 treesize of output 80 [2024-10-11 17:55:46,458 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:55:46,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438431405] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:46,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:55:46,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 27 [2024-10-11 17:55:46,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101696711] [2024-10-11 17:55:46,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:46,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 17:55:46,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:46,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 17:55:46,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2024-10-11 17:55:46,460 INFO L87 Difference]: Start difference. First operand 229 states and 318 transitions. Second operand has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 28 states have internal predecessors, (101), 0 states have call successors, (0), 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:55:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:47,378 INFO L93 Difference]: Finished difference Result 231 states and 319 transitions. [2024-10-11 17:55:47,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:55:47,379 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 28 states have internal predecessors, (101), 0 states have call successors, (0), 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 38 [2024-10-11 17:55:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:47,381 INFO L225 Difference]: With dead ends: 231 [2024-10-11 17:55:47,381 INFO L226 Difference]: Without dead ends: 212 [2024-10-11 17:55:47,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 17:55:47,382 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 15 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:47,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 826 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1041 Invalid, 3 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 17:55:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-11 17:55:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-10-11 17:55:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 172 states have (on average 1.744186046511628) internal successors, (300), 211 states have internal predecessors, (300), 0 states have call successors, (0), 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:55:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 300 transitions. [2024-10-11 17:55:47,386 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 300 transitions. Word has length 38 [2024-10-11 17:55:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:47,387 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 300 transitions. [2024-10-11 17:55:47,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.607142857142857) internal successors, (101), 28 states have internal predecessors, (101), 0 states have call successors, (0), 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:55:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 300 transitions. [2024-10-11 17:55:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 17:55:47,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:47,388 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:47,405 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:55:47,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:47,589 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:47,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:47,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1663092709, now seen corresponding path program 1 times [2024-10-11 17:55:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520112794] [2024-10-11 17:55:47,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:47,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:47,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:47,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520112794] [2024-10-11 17:55:47,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520112794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:47,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170605891] [2024-10-11 17:55:47,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:47,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:47,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:47,657 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:55:47,658 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:55:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:47,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:55:47,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 17:55:47,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:47,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170605891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:47,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:55:47,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 17:55:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554768519] [2024-10-11 17:55:47,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:47,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:47,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:47,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:47,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:47,839 INFO L87 Difference]: Start difference. First operand 212 states and 300 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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:55:47,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:47,930 INFO L93 Difference]: Finished difference Result 348 states and 483 transitions. [2024-10-11 17:55:47,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:47,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-11 17:55:47,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:47,932 INFO L225 Difference]: With dead ends: 348 [2024-10-11 17:55:47,932 INFO L226 Difference]: Without dead ends: 346 [2024-10-11 17:55:47,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:47,932 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 92 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 274 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:55:47,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 274 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:47,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-11 17:55:47,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 221. [2024-10-11 17:55:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 181 states have (on average 1.6850828729281768) internal successors, (305), 220 states have internal predecessors, (305), 0 states have call successors, (0), 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:55:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 305 transitions. [2024-10-11 17:55:47,938 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 305 transitions. Word has length 39 [2024-10-11 17:55:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:47,938 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 305 transitions. [2024-10-11 17:55:47,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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:55:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 305 transitions. [2024-10-11 17:55:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 17:55:47,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:47,939 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:47,957 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:55:48,140 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,SelfDestructingSolverStorable26 [2024-10-11 17:55:48,140 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:48,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:48,140 INFO L85 PathProgramCache]: Analyzing trace with hash 853746083, now seen corresponding path program 1 times [2024-10-11 17:55:48,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:48,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438984855] [2024-10-11 17:55:48,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:48,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:48,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:48,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438984855] [2024-10-11 17:55:48,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438984855] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:48,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949822930] [2024-10-11 17:55:48,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:48,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:48,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:48,209 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:55:48,211 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:55:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:48,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:55:48,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:48,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:48,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949822930] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:48,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:55:48,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-11 17:55:48,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802864535] [2024-10-11 17:55:48,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:48,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:55:48,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:48,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:55:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:48,469 INFO L87 Difference]: Start difference. First operand 221 states and 305 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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:55:48,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:48,722 INFO L93 Difference]: Finished difference Result 862 states and 1188 transitions. [2024-10-11 17:55:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:55:48,723 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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 39 [2024-10-11 17:55:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:48,726 INFO L225 Difference]: With dead ends: 862 [2024-10-11 17:55:48,726 INFO L226 Difference]: Without dead ends: 862 [2024-10-11 17:55:48,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:48,726 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 595 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:48,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 672 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-10-11 17:55:48,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 233. [2024-10-11 17:55:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 193 states have (on average 1.5699481865284974) internal successors, (303), 232 states have internal predecessors, (303), 0 states have call successors, (0), 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:55:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 303 transitions. [2024-10-11 17:55:48,737 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 303 transitions. Word has length 39 [2024-10-11 17:55:48,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:48,738 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 303 transitions. [2024-10-11 17:55:48,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 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:55:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 303 transitions. [2024-10-11 17:55:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 17:55:48,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:48,739 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:48,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 17:55:48,942 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,SelfDestructingSolverStorable27 [2024-10-11 17:55:48,943 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:48,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:48,944 INFO L85 PathProgramCache]: Analyzing trace with hash -89945748, now seen corresponding path program 1 times [2024-10-11 17:55:48,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:48,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126324044] [2024-10-11 17:55:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:48,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:49,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:49,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126324044] [2024-10-11 17:55:49,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126324044] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:49,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670552661] [2024-10-11 17:55:49,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:49,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:49,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:49,245 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:55:49,247 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:55:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:49,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 17:55:49,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:49,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 17:55:49,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:55:49,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:55:49,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2024-10-11 17:55:49,590 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 17 treesize of output 9 [2024-10-11 17:55:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:49,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:53,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670552661] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:53,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:55:53,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 19 [2024-10-11 17:55:53,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635111991] [2024-10-11 17:55:53,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:53,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 17:55:53,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:53,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 17:55:53,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=312, Unknown=1, NotChecked=0, Total=380 [2024-10-11 17:55:53,756 INFO L87 Difference]: Start difference. First operand 233 states and 303 transitions. Second operand has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 20 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:54,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:54,337 INFO L93 Difference]: Finished difference Result 254 states and 301 transitions. [2024-10-11 17:55:54,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 17:55:54,337 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 20 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-11 17:55:54,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:54,338 INFO L225 Difference]: With dead ends: 254 [2024-10-11 17:55:54,338 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 17:55:54,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=238, Invalid=817, Unknown=1, NotChecked=0, Total=1056 [2024-10-11 17:55:54,339 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 248 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:54,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 599 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:55:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 17:55:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 233. [2024-10-11 17:55:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 193 states have (on average 1.5595854922279793) internal successors, (301), 232 states have internal predecessors, (301), 0 states have call successors, (0), 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:55:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 301 transitions. [2024-10-11 17:55:54,344 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 301 transitions. Word has length 41 [2024-10-11 17:55:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:54,344 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 301 transitions. [2024-10-11 17:55:54,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.684210526315789) internal successors, (89), 20 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 301 transitions. [2024-10-11 17:55:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 17:55:54,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:54,345 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:54,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 17:55:54,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 17:55:54,550 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:54,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:54,550 INFO L85 PathProgramCache]: Analyzing trace with hash -89945747, now seen corresponding path program 1 times [2024-10-11 17:55:54,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:54,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333286430] [2024-10-11 17:55:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:55,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:55,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333286430] [2024-10-11 17:55:55,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333286430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:55,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:55,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 17:55:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517417532] [2024-10-11 17:55:55,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:55,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:55:55,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:55,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:55:55,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:55:55,065 INFO L87 Difference]: Start difference. First operand 233 states and 301 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 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:55:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:55,461 INFO L93 Difference]: Finished difference Result 251 states and 298 transitions. [2024-10-11 17:55:55,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:55:55,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 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 41 [2024-10-11 17:55:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:55,463 INFO L225 Difference]: With dead ends: 251 [2024-10-11 17:55:55,463 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 17:55:55,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:55:55,464 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 62 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:55,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 475 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:55,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 17:55:55,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 233. [2024-10-11 17:55:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 193 states have (on average 1.544041450777202) internal successors, (298), 232 states have internal predecessors, (298), 0 states have call successors, (0), 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:55:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 298 transitions. [2024-10-11 17:55:55,468 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 298 transitions. Word has length 41 [2024-10-11 17:55:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:55,469 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 298 transitions. [2024-10-11 17:55:55,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 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:55:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 298 transitions. [2024-10-11 17:55:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:55:55,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:55,470 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:55,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 17:55:55,470 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:55,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:55,471 INFO L85 PathProgramCache]: Analyzing trace with hash -880702823, now seen corresponding path program 1 times [2024-10-11 17:55:55,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:55,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642312609] [2024-10-11 17:55:55,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:55,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:55,723 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:55,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:55,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642312609] [2024-10-11 17:55:55,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642312609] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:55,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514149601] [2024-10-11 17:55:55,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:55,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:55,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:55,726 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:55:55,727 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:55:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:55,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 17:55:55,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:55,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 17:55:55,933 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 17:55:55,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 17:55:55,950 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:55:55,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 17:55:55,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:55:55,981 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 17:55:55,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-11 17:55:55,994 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 16 treesize of output 8 [2024-10-11 17:55:55,997 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:55,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:56,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:56,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-10-11 17:55:56,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 33 treesize of output 25 [2024-10-11 17:55:56,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-11 17:55:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:56,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514149601] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:56,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:55:56,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 14 [2024-10-11 17:55:56,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670203825] [2024-10-11 17:55:56,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:56,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:55:56,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:56,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:55:56,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=137, Unknown=4, NotChecked=0, Total=182 [2024-10-11 17:55:56,132 INFO L87 Difference]: Start difference. First operand 233 states and 298 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:56,557 INFO L93 Difference]: Finished difference Result 248 states and 295 transitions. [2024-10-11 17:55:56,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:55:56,557 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-11 17:55:56,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:56,558 INFO L225 Difference]: With dead ends: 248 [2024-10-11 17:55:56,558 INFO L226 Difference]: Without dead ends: 248 [2024-10-11 17:55:56,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=277, Unknown=4, NotChecked=0, Total=380 [2024-10-11 17:55:56,559 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 252 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:56,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 560 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:55:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-11 17:55:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 230. [2024-10-11 17:55:56,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 190 states have (on average 1.5421052631578946) internal successors, (293), 229 states have internal predecessors, (293), 0 states have call successors, (0), 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:55:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 293 transitions. [2024-10-11 17:55:56,564 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 293 transitions. Word has length 44 [2024-10-11 17:55:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:56,564 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 293 transitions. [2024-10-11 17:55:56,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 293 transitions. [2024-10-11 17:55:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:55:56,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:56,565 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:56,583 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:55:56,768 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:55:56,769 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:56,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1100976879, now seen corresponding path program 1 times [2024-10-11 17:55:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:56,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789800335] [2024-10-11 17:55:56,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:56,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:57,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:57,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789800335] [2024-10-11 17:55:57,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789800335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:57,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318845238] [2024-10-11 17:55:57,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:57,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:57,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:57,090 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:55:57,092 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:55:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:57,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 17:55:57,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:57,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:57,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:55:57,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-11 17:55:57,446 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 17 treesize of output 9 [2024-10-11 17:55:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:57,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:57,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318845238] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:57,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:55:57,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2024-10-11 17:55:57,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986261708] [2024-10-11 17:55:57,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:57,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 17:55:57,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:57,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 17:55:57,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:55:57,628 INFO L87 Difference]: Start difference. First operand 230 states and 293 transitions. Second operand has 19 states, 18 states have (on average 5.333333333333333) internal successors, (96), 19 states have internal predecessors, (96), 0 states have call successors, (0), 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:55:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:58,153 INFO L93 Difference]: Finished difference Result 246 states and 292 transitions. [2024-10-11 17:55:58,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 17:55:58,153 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.333333333333333) internal successors, (96), 19 states have internal predecessors, (96), 0 states have call successors, (0), 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 46 [2024-10-11 17:55:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:58,154 INFO L225 Difference]: With dead ends: 246 [2024-10-11 17:55:58,154 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 17:55:58,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=752, Unknown=0, NotChecked=0, Total=992 [2024-10-11 17:55:58,155 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 158 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:58,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 570 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 17:55:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 230. [2024-10-11 17:55:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 190 states have (on average 1.5368421052631578) internal successors, (292), 229 states have internal predecessors, (292), 0 states have call successors, (0), 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:55:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 292 transitions. [2024-10-11 17:55:58,159 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 292 transitions. Word has length 46 [2024-10-11 17:55:58,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:58,160 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 292 transitions. [2024-10-11 17:55:58,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.333333333333333) internal successors, (96), 19 states have internal predecessors, (96), 0 states have call successors, (0), 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:55:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 292 transitions. [2024-10-11 17:55:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 17:55:58,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:58,161 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:58,178 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:55:58,364 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:55:58,365 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2024-10-11 17:55:58,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:58,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1463193455, now seen corresponding path program 1 times [2024-10-11 17:55:58,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:58,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85927017] [2024-10-11 17:55:58,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:58,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:59,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:59,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85927017] [2024-10-11 17:55:59,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85927017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:59,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230700896] [2024-10-11 17:55:59,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:59,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:59,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:59,261 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:55:59,262 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:55:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:59,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-11 17:55:59,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:59,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 17:55:59,467 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 17:55:59,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-11 17:55:59,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:59,626 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-10-11 17:55:59,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-10-11 17:55:59,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-11 17:55:59,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-11 17:55:59,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-11 17:55:59,832 INFO L349 Elim1Store]: treesize reduction 72, result has 33.3 percent of original size [2024-10-11 17:55:59,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 48 [2024-10-11 17:55:59,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2024-10-11 17:55:59,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-10-11 17:56:00,046 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 17:56:00,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 59 [2024-10-11 17:56:00,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-10-11 17:56:00,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 17:56:00,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2024-10-11 17:56:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:56:00,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:56:00,987 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 8 treesize of output 4 [2024-10-11 17:56:01,050 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (or (forall ((v_ArrVal_2009 (Array Int Int)) (v_ArrVal_2010 Int)) (= (let ((.cse0 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2009) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2010) (select .cse0 .cse1))) 1)) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0)) (forall ((v_ArrVal_2009 (Array Int Int)) (v_ArrVal_2010 Int)) (let ((.cse2 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2009) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select (store |c_#valid| (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2010) (select .cse2 .cse1)) 1) (= (select .cse2 0) |c_ULTIMATE.start_main_~data~0#1.base|)))))) is different from false [2024-10-11 17:56:01,067 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)))) (and (or (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (forall ((v_ArrVal_2009 (Array Int Int)) (v_ArrVal_2010 Int)) (= (let ((.cse0 (select (store .cse2 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2009) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2010) (select .cse0 .cse1))) 1))) (forall ((v_ArrVal_2009 (Array Int Int)) (v_ArrVal_2010 Int)) (let ((.cse3 (select (store .cse2 |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2009) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select .cse3 0) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (store |c_#valid| (select .cse3 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2010) (select .cse3 .cse1)) 1)))))) is different from false [2024-10-11 17:56:01,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (or (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (forall ((v_ArrVal_2009 (Array Int Int)) (v_ArrVal_2010 Int) (v_ArrVal_2006 (Array Int Int))) (= (let ((.cse0 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2006) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2009) |c_ULTIMATE.start_main_~data~0#1.base|))) (select (store |c_#valid| (select .cse0 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2010) (select .cse0 .cse1))) 1))) (forall ((v_ArrVal_2009 (Array Int Int)) (v_ArrVal_2010 Int) (v_ArrVal_2006 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2006) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_2009) |c_ULTIMATE.start_main_~data~0#1.base|))) (or (= (select .cse2 0) |c_ULTIMATE.start_main_~data~0#1.base|) (= (select (store |c_#valid| (select .cse2 |c_ULTIMATE.start_main_~data~0#1.offset|) v_ArrVal_2010) (select .cse2 .cse1)) 1)))))) is different from false [2024-10-11 17:56:03,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:56:03,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 102 [2024-10-11 17:56:03,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:56:03,950 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 386 treesize of output 384 [2024-10-11 17:56:03,960 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:56:03,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:56:03,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2024-10-11 17:56:03,979 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:56:03,980 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 87 treesize of output 81 [2024-10-11 17:56:04,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-11 17:56:04,036 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:56:04,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:56:04,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 81 treesize of output 89 [2024-10-11 17:56:06,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:56:06,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 75 [2024-10-11 17:56:06,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:56:06,039 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 132 treesize of output 131 [2024-10-11 17:56:06,048 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 41 treesize of output 37 [2024-10-11 17:56:06,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-10-11 17:56:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-11 17:56:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230700896] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:56:20,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:56:20,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 19] total 44 [2024-10-11 17:56:20,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142356516] [2024-10-11 17:56:20,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:56:20,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-11 17:56:20,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:56:20,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-11 17:56:20,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1478, Unknown=8, NotChecked=246, Total=1980 [2024-10-11 17:56:20,594 INFO L87 Difference]: Start difference. First operand 230 states and 292 transitions. Second operand has 45 states, 44 states have (on average 3.159090909090909) internal successors, (139), 45 states have internal predecessors, (139), 0 states have call successors, (0), 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:56:26,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]