./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:41:49,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:41:49,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:41:49,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:41:49,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:41:49,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:41:49,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:41:49,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:41:49,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:41:49,695 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:41:49,695 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:41:49,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:41:49,696 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:41:49,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:41:49,697 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:41:49,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:41:49,700 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:41:49,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:41:49,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:41:49,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:41:49,701 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:41:49,702 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:41:49,702 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:41:49,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:41:49,703 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:41:49,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:41:49,703 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:41:49,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:41:49,704 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:41:49,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:41:49,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:41:49,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:41:49,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:41:49,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:41:49,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:41:49,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:41:49,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:41:49,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:41:49,710 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:41:49,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:41:49,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:41:49,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:41:49,714 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 [2024-10-13 10:41:49,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:41:50,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:41:50,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:41:50,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:41:50,013 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:41:50,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2024-10-13 10:41:51,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:41:51,698 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:41:51,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2024-10-13 10:41:51,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac63febd8/0d9edb04d4ec49aba587d6c075719448/FLAGd6163ec53 [2024-10-13 10:41:51,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac63febd8/0d9edb04d4ec49aba587d6c075719448 [2024-10-13 10:41:51,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:41:51,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:41:51,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:41:51,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:41:51,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:41:51,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:41:51" (1/1) ... [2024-10-13 10:41:51,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57a3c749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:51, skipping insertion in model container [2024-10-13 10:41:51,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:41:51" (1/1) ... [2024-10-13 10:41:51,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:41:52,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:41:52,090 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:41:52,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:41:52,197 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:41:52,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52 WrapperNode [2024-10-13 10:41:52,198 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:41:52,199 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:41:52,199 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:41:52,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:41:52,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52" (1/1) ... [2024-10-13 10:41:52,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52" (1/1) ... [2024-10-13 10:41:52,247 INFO L138 Inliner]: procedures = 123, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2024-10-13 10:41:52,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:41:52,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:41:52,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:41:52,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:41:52,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52" (1/1) ... [2024-10-13 10:41:52,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52" (1/1) ... [2024-10-13 10:41:52,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52" (1/1) ... [2024-10-13 10:41:52,274 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2024-10-13 10:41:52,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52" (1/1) ... [2024-10-13 10:41:52,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52" (1/1) ... [2024-10-13 10:41:52,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52" (1/1) ... [2024-10-13 10:41:52,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52" (1/1) ... [2024-10-13 10:41:52,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52" (1/1) ... [2024-10-13 10:41:52,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52" (1/1) ... [2024-10-13 10:41:52,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:41:52,296 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:41:52,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:41:52,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:41:52,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52" (1/1) ... [2024-10-13 10:41:52,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:41:52,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:41:52,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:41:52,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:41:52,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:41:52,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:41:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:41:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:41:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:41:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:41:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:41:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:41:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:41:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:41:52,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:41:52,529 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:41:52,531 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:41:52,796 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-10-13 10:41:52,797 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:41:52,830 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:41:52,831 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 10:41:52,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:41:52 BoogieIcfgContainer [2024-10-13 10:41:52,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:41:52,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:41:52,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:41:52,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:41:52,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:41:51" (1/3) ... [2024-10-13 10:41:52,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799aebf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:41:52, skipping insertion in model container [2024-10-13 10:41:52,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:41:52" (2/3) ... [2024-10-13 10:41:52,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799aebf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:41:52, skipping insertion in model container [2024-10-13 10:41:52,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:41:52" (3/3) ... [2024-10-13 10:41:52,842 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2024-10-13 10:41:52,861 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:41:52,862 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-10-13 10:41:52,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:41:52,954 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;@2663a783, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:41:52,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-10-13 10:41:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 25 states have (on average 2.32) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:41:52,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:52,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:41:52,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:52,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:52,969 INFO L85 PathProgramCache]: Analyzing trace with hash 3817, now seen corresponding path program 1 times [2024-10-13 10:41:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:52,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645058455] [2024-10-13 10:41:52,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:53,171 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-13 10:41:53,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:53,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645058455] [2024-10-13 10:41:53,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645058455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:41:53,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:41:53,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:41:53,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5084676] [2024-10-13 10:41:53,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:41:53,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:41:53,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:53,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:41:53,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:41:53,210 INFO L87 Difference]: Start difference. First operand has 53 states, 25 states have (on average 2.32) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-13 10:41:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:53,362 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2024-10-13 10:41:53,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:41:53,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-13 10:41:53,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:53,372 INFO L225 Difference]: With dead ends: 50 [2024-10-13 10:41:53,372 INFO L226 Difference]: Without dead ends: 49 [2024-10-13 10:41:53,374 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-13 10:41:53,377 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:53,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-13 10:41:53,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-10-13 10:41:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2024-10-13 10:41:53,403 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 2 [2024-10-13 10:41:53,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:53,403 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2024-10-13 10:41:53,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-13 10:41:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2024-10-13 10:41:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:41:53,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:53,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:41:53,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:41:53,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:53,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash 3818, now seen corresponding path program 1 times [2024-10-13 10:41:53,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:53,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471486300] [2024-10-13 10:41:53,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:53,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:53,481 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-13 10:41:53,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:53,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471486300] [2024-10-13 10:41:53,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471486300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:41:53,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:41:53,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:41:53,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399907708] [2024-10-13 10:41:53,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:41:53,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:41:53,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:53,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:41:53,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:41:53,485 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-13 10:41:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:53,546 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-13 10:41:53,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:41:53,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2024-10-13 10:41:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:53,548 INFO L225 Difference]: With dead ends: 44 [2024-10-13 10:41:53,550 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 10:41:53,550 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-13 10:41:53,551 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:53,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 44 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 10:41:53,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-10-13 10:41:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-13 10:41:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-10-13 10:41:53,560 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 2 [2024-10-13 10:41:53,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:53,560 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-10-13 10:41:53,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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-13 10:41:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-10-13 10:41:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:41:53,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:53,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:53,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:41:53,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:53,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:53,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1755113050, now seen corresponding path program 1 times [2024-10-13 10:41:53,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:53,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200262573] [2024-10-13 10:41:53,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:53,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:53,727 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-13 10:41:53,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:53,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200262573] [2024-10-13 10:41:53,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200262573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:41:53,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:41:53,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:41:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164537620] [2024-10-13 10:41:53,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:41:53,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:41:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:53,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:41:53,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:41:53,732 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-13 10:41:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:53,866 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2024-10-13 10:41:53,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:41:53,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-10-13 10:41:53,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:53,867 INFO L225 Difference]: With dead ends: 47 [2024-10-13 10:41:53,867 INFO L226 Difference]: Without dead ends: 47 [2024-10-13 10:41:53,868 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-13 10:41:53,869 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:53,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 28 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:53,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-13 10:41:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-10-13 10:41:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-10-13 10:41:53,874 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 8 [2024-10-13 10:41:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:53,875 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-10-13 10:41:53,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-13 10:41:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-10-13 10:41:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:41:53,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:53,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:53,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:41:53,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:53,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1755113049, now seen corresponding path program 1 times [2024-10-13 10:41:53,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:53,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391766679] [2024-10-13 10:41:53,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:53,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:54,112 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-13 10:41:54,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:54,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391766679] [2024-10-13 10:41:54,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391766679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:41:54,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:41:54,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:41:54,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64901266] [2024-10-13 10:41:54,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:41:54,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:41:54,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:54,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:41:54,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:41:54,114 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-13 10:41:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:54,225 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2024-10-13 10:41:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:41:54,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-10-13 10:41:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:54,226 INFO L225 Difference]: With dead ends: 63 [2024-10-13 10:41:54,226 INFO L226 Difference]: Without dead ends: 63 [2024-10-13 10:41:54,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-13 10:41:54,228 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:54,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 51 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-13 10:41:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2024-10-13 10:41:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.608695652173913) internal successors, (74), 59 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-13 10:41:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2024-10-13 10:41:54,237 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 8 [2024-10-13 10:41:54,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:54,237 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2024-10-13 10:41:54,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 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-13 10:41:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2024-10-13 10:41:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:41:54,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:54,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:54,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:41:54,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:54,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:54,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1426069394, now seen corresponding path program 1 times [2024-10-13 10:41:54,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:54,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340397314] [2024-10-13 10:41:54,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:54,318 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-13 10:41:54,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:54,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340397314] [2024-10-13 10:41:54,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340397314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:41:54,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:41:54,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:41:54,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747080288] [2024-10-13 10:41:54,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:41:54,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:41:54,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:54,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:41:54,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:41:54,320 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:54,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:54,406 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2024-10-13 10:41:54,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:41:54,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-13 10:41:54,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:54,409 INFO L225 Difference]: With dead ends: 76 [2024-10-13 10:41:54,409 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 10:41:54,410 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-13 10:41:54,411 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:54,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 53 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 10:41:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 60. [2024-10-13 10:41:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.565217391304348) internal successors, (72), 59 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-13 10:41:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2024-10-13 10:41:54,425 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 9 [2024-10-13 10:41:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:54,426 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2024-10-13 10:41:54,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2024-10-13 10:41:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:41:54,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:54,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:54,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:41:54,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:54,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1259464461, now seen corresponding path program 1 times [2024-10-13 10:41:54,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:54,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548190821] [2024-10-13 10:41:54,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:54,639 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-13 10:41:54,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:54,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548190821] [2024-10-13 10:41:54,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548190821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:41:54,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:41:54,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:41:54,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921696247] [2024-10-13 10:41:54,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:41:54,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:41:54,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:54,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:41:54,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:41:54,644 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:54,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:54,704 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2024-10-13 10:41:54,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:41:54,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 10:41:54,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:54,706 INFO L225 Difference]: With dead ends: 59 [2024-10-13 10:41:54,707 INFO L226 Difference]: Without dead ends: 59 [2024-10-13 10:41:54,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-13 10:41:54,709 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:54,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-13 10:41:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-13 10:41:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 58 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-13 10:41:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2024-10-13 10:41:54,719 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 10 [2024-10-13 10:41:54,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:54,720 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2024-10-13 10:41:54,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2024-10-13 10:41:54,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:41:54,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:54,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:54,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:41:54,721 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:54,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:54,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1719329260, now seen corresponding path program 1 times [2024-10-13 10:41:54,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:54,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411611018] [2024-10-13 10:41:54,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:54,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:54,991 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-13 10:41:54,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:54,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411611018] [2024-10-13 10:41:54,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411611018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:41:54,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:41:54,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:41:54,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195529349] [2024-10-13 10:41:54,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:41:54,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:41:54,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:54,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:41:54,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:41:54,994 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:55,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:55,127 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-10-13 10:41:55,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:41:55,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 10:41:55,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:55,128 INFO L225 Difference]: With dead ends: 54 [2024-10-13 10:41:55,129 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 10:41:55,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:41:55,130 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:55,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:55,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 10:41:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 10:41:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2024-10-13 10:41:55,137 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 12 [2024-10-13 10:41:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:55,137 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2024-10-13 10:41:55,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2024-10-13 10:41:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:41:55,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:55,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:55,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:41:55,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:55,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:55,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1719318275, now seen corresponding path program 1 times [2024-10-13 10:41:55,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:55,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819495885] [2024-10-13 10:41:55,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:55,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:55,219 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-13 10:41:55,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:55,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819495885] [2024-10-13 10:41:55,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819495885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:41:55,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:41:55,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:41:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792106975] [2024-10-13 10:41:55,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:41:55,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:41:55,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:41:55,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:41:55,221 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:55,305 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2024-10-13 10:41:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:41:55,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 10:41:55,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:55,307 INFO L225 Difference]: With dead ends: 68 [2024-10-13 10:41:55,307 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 10:41:55,307 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-13 10:41:55,308 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:55,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 59 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 10:41:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2024-10-13 10:41:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.56) internal successors, (78), 62 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-13 10:41:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2024-10-13 10:41:55,318 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 12 [2024-10-13 10:41:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:55,319 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2024-10-13 10:41:55,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2024-10-13 10:41:55,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:41:55,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:55,320 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:55,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:41:55,320 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:55,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:55,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1569351894, now seen corresponding path program 1 times [2024-10-13 10:41:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:55,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269268040] [2024-10-13 10:41:55,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:55,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:41:55,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:55,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269268040] [2024-10-13 10:41:55,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269268040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:41:55,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060481889] [2024-10-13 10:41:55,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:55,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:41:55,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:41:55,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:41:55,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:41:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:55,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:41:55,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:41:55,715 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-13 10:41:55,722 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-13 10:41:55,758 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 19 treesize of output 18 [2024-10-13 10:41:55,767 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 19 treesize of output 18 [2024-10-13 10:41:55,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:41:55,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-13 10:41:55,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-13 10:41:56,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:41:56,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:41:56,245 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 10 treesize of output 8 [2024-10-13 10:41:56,253 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 14 treesize of output 12 [2024-10-13 10:41:56,266 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 10 treesize of output 8 [2024-10-13 10:41:56,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:41:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:41:56,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060481889] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:41:56,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:41:56,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2024-10-13 10:41:56,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893253927] [2024-10-13 10:41:56,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:41:56,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:41:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:56,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:41:56,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:41:56,282 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:56,565 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2024-10-13 10:41:56,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:41:56,565 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 10:41:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:56,568 INFO L225 Difference]: With dead ends: 74 [2024-10-13 10:41:56,568 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 10:41:56,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:41:56,569 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:56,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 188 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 10:41:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2024-10-13 10:41:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 72 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-13 10:41:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 89 transitions. [2024-10-13 10:41:56,578 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 89 transitions. Word has length 15 [2024-10-13 10:41:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:56,578 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 89 transitions. [2024-10-13 10:41:56,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2024-10-13 10:41:56,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:41:56,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:56,579 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:56,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 10:41:56,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:41:56,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:56,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1481435705, now seen corresponding path program 1 times [2024-10-13 10:41:56,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:56,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296706591] [2024-10-13 10:41:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:56,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:41:56,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296706591] [2024-10-13 10:41:56,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296706591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:41:56,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:41:56,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:41:56,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384357377] [2024-10-13 10:41:56,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:41:56,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:41:56,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:56,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:41:56,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:41:56,914 INFO L87 Difference]: Start difference. First operand 73 states and 89 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:56,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:56,997 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2024-10-13 10:41:56,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:41:56,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 10:41:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:56,999 INFO L225 Difference]: With dead ends: 75 [2024-10-13 10:41:56,999 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 10:41:56,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:41:57,000 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:57,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 67 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:57,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 10:41:57,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2024-10-13 10:41:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 68 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2024-10-13 10:41:57,007 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 15 [2024-10-13 10:41:57,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:57,007 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-10-13 10:41:57,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2024-10-13 10:41:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:41:57,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:57,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:57,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:41:57,008 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:57,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:57,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1405267554, now seen corresponding path program 1 times [2024-10-13 10:41:57,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:57,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777918316] [2024-10-13 10:41:57,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:57,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:41:57,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777918316] [2024-10-13 10:41:57,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777918316] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:41:57,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907505686] [2024-10-13 10:41:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:57,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:41:57,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:41:57,106 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:41:57,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:41:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:57,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 10:41:57,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:41:57,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:41:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:41:57,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:41:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:41:57,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907505686] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:41:57,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:41:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-10-13 10:41:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525251407] [2024-10-13 10:41:57,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:41:57,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:41:57,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:57,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:41:57,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:41:57,256 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:57,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:57,328 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2024-10-13 10:41:57,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:41:57,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-13 10:41:57,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:57,329 INFO L225 Difference]: With dead ends: 71 [2024-10-13 10:41:57,330 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 10:41:57,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:41:57,331 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:57,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 70 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 10:41:57,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-13 10:41:57,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 60 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-13 10:41:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2024-10-13 10:41:57,334 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 16 [2024-10-13 10:41:57,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:57,334 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2024-10-13 10:41:57,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:57,334 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2024-10-13 10:41:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:41:57,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:57,335 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:57,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:41:57,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 10:41:57,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:57,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:57,536 INFO L85 PathProgramCache]: Analyzing trace with hash -885388748, now seen corresponding path program 1 times [2024-10-13 10:41:57,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:57,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022715292] [2024-10-13 10:41:57,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:57,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:41:57,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:57,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022715292] [2024-10-13 10:41:57,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022715292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:41:57,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:41:57,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:41:57,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68391909] [2024-10-13 10:41:57,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:41:57,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:41:57,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:57,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:41:57,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:41:57,828 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-13 10:41:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:57,949 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-10-13 10:41:57,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:41:57,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-13 10:41:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:57,950 INFO L225 Difference]: With dead ends: 66 [2024-10-13 10:41:57,950 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 10:41:57,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:41:57,951 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:57,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:57,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 10:41:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2024-10-13 10:41:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-13 10:41:57,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2024-10-13 10:41:57,954 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 19 [2024-10-13 10:41:57,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:57,954 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2024-10-13 10:41:57,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-13 10:41:57,954 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2024-10-13 10:41:57,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:41:57,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:57,955 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:57,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:41:57,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:57,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:57,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1677247311, now seen corresponding path program 1 times [2024-10-13 10:41:57,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:57,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373976762] [2024-10-13 10:41:57,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:57,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:41:58,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:58,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373976762] [2024-10-13 10:41:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373976762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:41:58,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:41:58,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:41:58,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305186034] [2024-10-13 10:41:58,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:41:58,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:41:58,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:58,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:41:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:41:58,235 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:58,392 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-10-13 10:41:58,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:41:58,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-13 10:41:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:58,394 INFO L225 Difference]: With dead ends: 65 [2024-10-13 10:41:58,394 INFO L226 Difference]: Without dead ends: 65 [2024-10-13 10:41:58,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:41:58,394 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:58,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 93 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-13 10:41:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2024-10-13 10:41:58,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-13 10:41:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2024-10-13 10:41:58,401 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 20 [2024-10-13 10:41:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:58,401 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2024-10-13 10:41:58,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-10-13 10:41:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:41:58,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:58,402 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:58,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:41:58,402 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:58,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash -455058986, now seen corresponding path program 1 times [2024-10-13 10:41:58,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:58,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476661910] [2024-10-13 10:41:58,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:58,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:41:58,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:58,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476661910] [2024-10-13 10:41:58,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476661910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:41:58,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:41:58,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:41:58,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95663455] [2024-10-13 10:41:58,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:41:58,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:41:58,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:58,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:41:58,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:41:58,676 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-13 10:41:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:58,786 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2024-10-13 10:41:58,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:41:58,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-13 10:41:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:58,787 INFO L225 Difference]: With dead ends: 61 [2024-10-13 10:41:58,787 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 10:41:58,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:41:58,788 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:58,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 65 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 10:41:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-13 10:41:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 60 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-13 10:41:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-10-13 10:41:58,795 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2024-10-13 10:41:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:58,795 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-10-13 10:41:58,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-13 10:41:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-10-13 10:41:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:41:58,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:58,796 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:58,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:41:58,796 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:58,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:58,797 INFO L85 PathProgramCache]: Analyzing trace with hash -894662474, now seen corresponding path program 1 times [2024-10-13 10:41:58,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:58,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606712234] [2024-10-13 10:41:58,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:58,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:59,116 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-13 10:41:59,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:41:59,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606712234] [2024-10-13 10:41:59,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606712234] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:41:59,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752626055] [2024-10-13 10:41:59,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:59,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:41:59,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:41:59,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:41:59,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:41:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:41:59,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 10:41:59,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:41:59,228 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-13 10:41:59,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:41:59,259 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-13 10:41:59,280 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-13 10:41:59,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:41:59,319 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 18 treesize of output 16 [2024-10-13 10:41:59,353 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-13 10:41:59,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:41:59,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752626055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:41:59,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:41:59,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2024-10-13 10:41:59,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572329823] [2024-10-13 10:41:59,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:41:59,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:41:59,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:41:59,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:41:59,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:41:59,356 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:41:59,540 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-10-13 10:41:59,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:41:59,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-13 10:41:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:41:59,541 INFO L225 Difference]: With dead ends: 65 [2024-10-13 10:41:59,542 INFO L226 Difference]: Without dead ends: 64 [2024-10-13 10:41:59,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:41:59,543 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:41:59,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 123 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:41:59,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-13 10:41:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2024-10-13 10:41:59,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 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-13 10:41:59,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-10-13 10:41:59,545 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 22 [2024-10-13 10:41:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:41:59,545 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-10-13 10:41:59,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:41:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-10-13 10:41:59,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:41:59,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:41:59,546 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:41:59,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:41:59,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:41:59,751 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:41:59,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:41:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash -88944713, now seen corresponding path program 1 times [2024-10-13 10:41:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:41:59,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193644095] [2024-10-13 10:41:59,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:41:59,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:41:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:00,043 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-13 10:42:00,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:42:00,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193644095] [2024-10-13 10:42:00,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193644095] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:42:00,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704962806] [2024-10-13 10:42:00,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:00,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:42:00,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:42:00,046 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:42:00,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 10:42:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:00,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:42:00,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:42:00,151 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-13 10:42:00,168 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:42:00,169 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-13 10:42:00,193 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-13 10:42:00,226 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:42:00,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 10:42:00,265 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 29 treesize of output 24 [2024-10-13 10:42:00,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:00,370 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 32 treesize of output 16 [2024-10-13 10:42:00,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:42:00,398 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-13 10:42:00,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:42:00,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:00,615 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 45 treesize of output 49 [2024-10-13 10:42:00,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:00,748 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-13 10:42:00,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:00,757 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 33 treesize of output 33 [2024-10-13 10:42:00,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-13 10:42:00,782 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 10:42:00,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2024-10-13 10:42:00,846 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-13 10:42:00,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704962806] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:42:00,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:42:00,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-10-13 10:42:00,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470050885] [2024-10-13 10:42:00,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:42:00,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 10:42:00,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:42:00,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 10:42:00,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=437, Unknown=2, NotChecked=0, Total=506 [2024-10-13 10:42:00,848 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:42:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:42:01,576 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2024-10-13 10:42:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 10:42:01,576 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-13 10:42:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:42:01,577 INFO L225 Difference]: With dead ends: 72 [2024-10-13 10:42:01,577 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 10:42:01,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=304, Invalid=1176, Unknown=2, NotChecked=0, Total=1482 [2024-10-13 10:42:01,578 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 81 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:42:01,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 148 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:42:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 10:42:01,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2024-10-13 10:42:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 64 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-13 10:42:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2024-10-13 10:42:01,582 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 22 [2024-10-13 10:42:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:42:01,582 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2024-10-13 10:42:01,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.227272727272727) internal successors, (49), 23 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:42:01,583 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2024-10-13 10:42:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 10:42:01,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:42:01,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:42:01,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 10:42:01,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 10:42:01,787 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:42:01,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:42:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash -88944712, now seen corresponding path program 1 times [2024-10-13 10:42:01,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:42:01,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345340478] [2024-10-13 10:42:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:01,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:42:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:02,136 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-13 10:42:02,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:42:02,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345340478] [2024-10-13 10:42:02,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345340478] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:42:02,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23216215] [2024-10-13 10:42:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:02,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:42:02,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:42:02,139 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:42:02,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 10:42:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:02,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-13 10:42:02,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:42:02,248 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-13 10:42:02,297 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:42:02,298 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-13 10:42:02,321 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-13 10:42:02,333 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-13 10:42:02,367 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:42:02,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2024-10-13 10:42:02,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 27 treesize of output 22 [2024-10-13 10:42:02,426 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 40 treesize of output 31 [2024-10-13 10:42:02,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-13 10:42:02,553 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 0 case distinctions, treesize of input 43 treesize of output 23 [2024-10-13 10:42:02,558 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 10:42:02,597 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-13 10:42:02,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:42:02,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:02,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2024-10-13 10:42:03,001 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 142 treesize of output 134 [2024-10-13 10:42:03,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:03,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-10-13 10:42:03,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:03,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:03,049 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 30 treesize of output 26 [2024-10-13 10:42:03,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2024-10-13 10:42:03,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:03,059 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:42:03,187 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-13 10:42:03,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23216215] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:42:03,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:42:03,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2024-10-13 10:42:03,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458097023] [2024-10-13 10:42:03,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:42:03,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 10:42:03,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:42:03,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 10:42:03,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=525, Unknown=2, NotChecked=0, Total=600 [2024-10-13 10:42:03,190 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:42:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:42:03,859 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-10-13 10:42:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 10:42:03,860 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-13 10:42:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:42:03,860 INFO L225 Difference]: With dead ends: 77 [2024-10-13 10:42:03,861 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 10:42:03,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=255, Invalid=1003, Unknown=2, NotChecked=0, Total=1260 [2024-10-13 10:42:03,862 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 49 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:42:03,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 155 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:42:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 10:42:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2024-10-13 10:42:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 71 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:42:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2024-10-13 10:42:03,865 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 22 [2024-10-13 10:42:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:42:03,865 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2024-10-13 10:42:03,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:42:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2024-10-13 10:42:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:42:03,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:42:03,866 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:42:03,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 10:42:04,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 10:42:04,067 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:42:04,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:42:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1537680289, now seen corresponding path program 1 times [2024-10-13 10:42:04,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:42:04,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206763989] [2024-10-13 10:42:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:04,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:42:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:42:04,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:42:04,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206763989] [2024-10-13 10:42:04,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206763989] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:42:04,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513329421] [2024-10-13 10:42:04,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:04,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:42:04,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:42:04,234 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:42:04,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 10:42:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:04,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 10:42:04,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:42:04,478 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-13 10:42:04,531 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-10-13 10:42:04,531 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 55 treesize of output 54 [2024-10-13 10:42:04,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2024-10-13 10:42:04,609 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 65 treesize of output 52 [2024-10-13 10:42:04,869 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 0 case distinctions, treesize of input 68 treesize of output 44 [2024-10-13 10:42:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:42:05,170 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:42:05,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:05,444 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-13 10:42:05,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:05,456 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 33 treesize of output 33 [2024-10-13 10:42:05,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-13 10:42:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:42:05,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513329421] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:42:05,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:42:05,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 30 [2024-10-13 10:42:05,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402460706] [2024-10-13 10:42:05,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:42:05,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-13 10:42:05,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:42:05,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-13 10:42:05,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=809, Unknown=2, NotChecked=0, Total=930 [2024-10-13 10:42:05,656 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-13 10:42:10,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-13 10:42:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:42:10,995 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2024-10-13 10:42:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-13 10:42:10,996 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 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 23 [2024-10-13 10:42:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:42:10,996 INFO L225 Difference]: With dead ends: 114 [2024-10-13 10:42:10,996 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 10:42:10,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=445, Invalid=2413, Unknown=4, NotChecked=0, Total=2862 [2024-10-13 10:42:10,998 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 94 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 40 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:42:10,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 231 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 677 Invalid, 9 Unknown, 0 Unchecked, 4.6s Time] [2024-10-13 10:42:10,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 10:42:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 74. [2024-10-13 10:42:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 73 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:42:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2024-10-13 10:42:11,001 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 23 [2024-10-13 10:42:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:42:11,001 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2024-10-13 10:42:11,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 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-13 10:42:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2024-10-13 10:42:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:42:11,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:42:11,002 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:42:11,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 10:42:11,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 10:42:11,206 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:42:11,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:42:11,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1745358440, now seen corresponding path program 1 times [2024-10-13 10:42:11,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:42:11,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944446642] [2024-10-13 10:42:11,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:11,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:42:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:42:11,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:42:11,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944446642] [2024-10-13 10:42:11,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944446642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:42:11,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:42:11,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:42:11,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443967068] [2024-10-13 10:42:11,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:42:11,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:42:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:42:11,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:42:11,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:42:11,522 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:42:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:42:11,733 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2024-10-13 10:42:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:42:11,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-13 10:42:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:42:11,734 INFO L225 Difference]: With dead ends: 77 [2024-10-13 10:42:11,734 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 10:42:11,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:42:11,735 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:42:11,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 82 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:42:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 10:42:11,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-10-13 10:42:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 73 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-13 10:42:11,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2024-10-13 10:42:11,739 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 24 [2024-10-13 10:42:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:42:11,740 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2024-10-13 10:42:11,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:42:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2024-10-13 10:42:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:42:11,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:42:11,740 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] [2024-10-13 10:42:11,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:42:11,741 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:42:11,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:42:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2042754587, now seen corresponding path program 1 times [2024-10-13 10:42:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:42:11,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661487800] [2024-10-13 10:42:11,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:11,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:42:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:12,293 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-13 10:42:12,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:42:12,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661487800] [2024-10-13 10:42:12,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661487800] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:42:12,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059417369] [2024-10-13 10:42:12,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:12,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:42:12,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:42:12,296 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:42:12,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 10:42:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:12,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-13 10:42:12,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:42:12,410 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-13 10:42:12,440 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:42:12,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:42:12,450 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-13 10:42:12,467 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:42:12,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 10:42:12,495 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-13 10:42:12,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-10-13 10:42:12,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-10-13 10:42:12,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:12,627 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 46 treesize of output 38 [2024-10-13 10:42:12,712 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 10:42:12,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-13 10:42:12,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:42:12,751 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-13 10:42:12,751 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:42:13,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:13,263 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 220 treesize of output 284 [2024-10-13 10:42:13,629 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~y~0#1.offset| v_prenex_6) (< v_prenex_6 0) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|) v_prenex_6)) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5))) (forall ((v_prenex_6 Int) (v_prenex_5 Int) (v_prenex_4 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_4) |c_ULTIMATE.start_main_~y~0#1.base|))) (let ((.cse1 (select .cse0 v_prenex_6))) (or (not (= (select (store .cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_prenex_5) 8) .cse1)) (< |c_ULTIMATE.start_main_~y~0#1.offset| v_prenex_6) (< v_prenex_6 0) (= |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_5) (= .cse1 v_prenex_5))))) (forall ((v_ArrVal_889 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_46| Int)) (or (< |c_ULTIMATE.start_main_~y~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_46|) (< |v_ULTIMATE.start_main_~list~0#1.offset_46| 0) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_889) |c_ULTIMATE.start_main_~y~0#1.base|) |v_ULTIMATE.start_main_~list~0#1.offset_46|) |c_ULTIMATE.start_main_~y~0#1.base|))))) is different from false [2024-10-13 10:42:13,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:13,645 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-13 10:42:13,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:13,655 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 33 treesize of output 33 [2024-10-13 10:42:13,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-13 10:42:13,683 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 10:42:13,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2024-10-13 10:42:13,692 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 10:42:13,692 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 58 treesize of output 1 [2024-10-13 10:42:13,758 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-13 10:42:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059417369] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:42:13,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:42:13,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 32 [2024-10-13 10:42:13,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531598966] [2024-10-13 10:42:13,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:42:13,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-13 10:42:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:42:13,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-13 10:42:13,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=912, Unknown=1, NotChecked=62, Total=1122 [2024-10-13 10:42:13,760 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 33 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:42:14,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:42:14,482 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2024-10-13 10:42:14,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:42:14,483 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 33 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 10:42:14,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:42:14,483 INFO L225 Difference]: With dead ends: 80 [2024-10-13 10:42:14,483 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 10:42:14,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=386, Invalid=1779, Unknown=1, NotChecked=90, Total=2256 [2024-10-13 10:42:14,484 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 78 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:42:14,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 128 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 419 Invalid, 0 Unknown, 65 Unchecked, 0.3s Time] [2024-10-13 10:42:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 10:42:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-10-13 10:42:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.375) internal successors, (88), 75 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:42:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2024-10-13 10:42:14,486 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 26 [2024-10-13 10:42:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:42:14,487 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2024-10-13 10:42:14,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 33 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:42:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2024-10-13 10:42:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:42:14,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:42:14,487 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] [2024-10-13 10:42:14,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 10:42:14,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:42:14,688 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:42:14,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:42:14,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2042754588, now seen corresponding path program 1 times [2024-10-13 10:42:14,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:42:14,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965096583] [2024-10-13 10:42:14,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:42:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:15,082 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-13 10:42:15,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:42:15,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965096583] [2024-10-13 10:42:15,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965096583] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:42:15,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565660830] [2024-10-13 10:42:15,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:15,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:42:15,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:42:15,085 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:42:15,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 10:42:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:15,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-13 10:42:15,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:42:15,227 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-13 10:42:15,290 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:42:15,290 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-13 10:42:15,322 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-13 10:42:15,327 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-13 10:42:15,380 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:42:15,380 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 62 treesize of output 55 [2024-10-13 10:42:15,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-10-13 10:42:15,456 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-13 10:42:15,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-10-13 10:42:15,476 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-13 10:42:15,477 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 15 treesize of output 15 [2024-10-13 10:42:15,526 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 56 treesize of output 32 [2024-10-13 10:42:15,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-10-13 10:42:15,673 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 0 case distinctions, treesize of input 48 treesize of output 24 [2024-10-13 10:42:15,677 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 10:42:15,742 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-13 10:42:15,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:42:16,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:16,091 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 124 treesize of output 128 [2024-10-13 10:42:16,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:16,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 132 [2024-10-13 10:42:16,409 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 142 treesize of output 134 [2024-10-13 10:42:16,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:16,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-10-13 10:42:16,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:16,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-13 10:42:16,467 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-13 10:42:16,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:16,475 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:42:16,628 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-13 10:42:16,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565660830] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:42:16,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:42:16,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 26 [2024-10-13 10:42:16,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547424574] [2024-10-13 10:42:16,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:42:16,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-13 10:42:16,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:42:16,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 10:42:16,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=672, Unknown=3, NotChecked=0, Total=756 [2024-10-13 10:42:16,630 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 28 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-13 10:42:17,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:42:17,624 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2024-10-13 10:42:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 10:42:17,625 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 10:42:17,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:42:17,625 INFO L225 Difference]: With dead ends: 88 [2024-10-13 10:42:17,625 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 10:42:17,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=272, Invalid=1285, Unknown=3, NotChecked=0, Total=1560 [2024-10-13 10:42:17,626 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 123 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:42:17,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 198 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:42:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 10:42:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2024-10-13 10:42:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:42:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2024-10-13 10:42:17,629 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 26 [2024-10-13 10:42:17,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:42:17,629 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2024-10-13 10:42:17,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-13 10:42:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2024-10-13 10:42:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:42:17,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:42:17,630 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:42:17,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 10:42:17,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-13 10:42:17,834 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:42:17,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:42:17,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1023843419, now seen corresponding path program 1 times [2024-10-13 10:42:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:42:17,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123600253] [2024-10-13 10:42:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:17,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:42:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:42:18,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:42:18,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123600253] [2024-10-13 10:42:18,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123600253] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:42:18,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512220201] [2024-10-13 10:42:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:18,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:42:18,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:42:18,588 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:42:18,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 10:42:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:18,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-13 10:42:18,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:42:18,725 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-13 10:42:18,730 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-13 10:42:18,786 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-13 10:42:18,796 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 19 treesize of output 18 [2024-10-13 10:42:18,846 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:18,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 46 [2024-10-13 10:42:18,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:18,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2024-10-13 10:42:18,939 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 10:42:18,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 52 [2024-10-13 10:42:18,966 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-10-13 10:42:18,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 47 [2024-10-13 10:42:19,299 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-13 10:42:19,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:19,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:19,873 INFO L349 Elim1Store]: treesize reduction 41, result has 46.8 percent of original size [2024-10-13 10:42:19,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 156 treesize of output 131 [2024-10-13 10:42:19,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:19,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:19,913 INFO L349 Elim1Store]: treesize reduction 9, result has 69.0 percent of original size [2024-10-13 10:42:19,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 96 treesize of output 81 [2024-10-13 10:42:19,961 INFO L349 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2024-10-13 10:42:19,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 78 [2024-10-13 10:42:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:42:20,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:42:20,201 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-13 10:42:37,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:42:37,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:37,463 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:42:37,463 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:42:37,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:37,473 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 48 treesize of output 37 [2024-10-13 10:42:37,481 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:42:37,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:42:37,487 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 2 case distinctions, treesize of input 44 treesize of output 35 [2024-10-13 10:42:37,497 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 10:42:37,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 68 [2024-10-13 10:42:37,503 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 0 case distinctions, treesize of input 47 treesize of output 35 [2024-10-13 10:42:37,514 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 10:42:37,514 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 38 treesize of output 33 [2024-10-13 10:42:37,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:42:37,523 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 6 [2024-10-13 10:42:37,528 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:42:37,531 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-10-13 10:42:37,531 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 2 case distinctions, treesize of input 87 treesize of output 1 [2024-10-13 10:42:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:42:37,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512220201] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:42:37,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:42:37,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 34 [2024-10-13 10:42:37,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420973993] [2024-10-13 10:42:37,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:42:37,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-13 10:42:37,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:42:37,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 10:42:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1058, Unknown=2, NotChecked=0, Total=1190 [2024-10-13 10:42:37,585 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 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-13 10:42:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:42:40,160 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2024-10-13 10:42:40,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-13 10:42:40,160 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 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 26 [2024-10-13 10:42:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:42:40,161 INFO L225 Difference]: With dead ends: 114 [2024-10-13 10:42:40,161 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 10:42:40,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=503, Invalid=3035, Unknown=2, NotChecked=0, Total=3540 [2024-10-13 10:42:40,162 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 95 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:42:40,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 310 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 10:42:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 10:42:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 100. [2024-10-13 10:42:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 99 states have internal predecessors, (113), 0 states have call successors, (0), 0 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-13 10:42:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2024-10-13 10:42:40,169 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 26 [2024-10-13 10:42:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:42:40,170 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2024-10-13 10:42:40,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 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-13 10:42:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2024-10-13 10:42:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:42:40,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:42:40,170 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:42:40,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 10:42:40,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:42:40,371 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:42:40,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:42:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1023832434, now seen corresponding path program 1 times [2024-10-13 10:42:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:42:40,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192578199] [2024-10-13 10:42:40,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:40,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:42:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:42:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:42:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192578199] [2024-10-13 10:42:40,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192578199] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:42:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576078486] [2024-10-13 10:42:40,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:40,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:42:40,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:42:40,612 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:42:40,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 10:42:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:40,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 10:42:40,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:42:40,830 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-13 10:42:40,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:40,877 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 31 treesize of output 25 [2024-10-13 10:42:40,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:40,962 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-13 10:42:40,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 35 [2024-10-13 10:42:41,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:41,118 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-13 10:42:41,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 18 [2024-10-13 10:42:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:42:41,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:42:41,374 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 70 treesize of output 66 [2024-10-13 10:42:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:42:41,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576078486] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:42:41,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:42:41,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 19 [2024-10-13 10:42:41,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556880683] [2024-10-13 10:42:41,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:42:41,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 10:42:41,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:42:41,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 10:42:41,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:42:41,478 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 21 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-13 10:42:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:42:42,442 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2024-10-13 10:42:42,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 10:42:42,442 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 10:42:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:42:42,443 INFO L225 Difference]: With dead ends: 114 [2024-10-13 10:42:42,443 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 10:42:42,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=364, Invalid=1276, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 10:42:42,444 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 79 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:42:42,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 163 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:42:42,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 10:42:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2024-10-13 10:42:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 101 states have internal predecessors, (115), 0 states have call successors, (0), 0 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-13 10:42:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2024-10-13 10:42:42,446 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 26 [2024-10-13 10:42:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:42:42,447 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2024-10-13 10:42:42,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-13 10:42:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2024-10-13 10:42:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:42:42,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:42:42,447 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:42:42,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 10:42:42,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-13 10:42:42,652 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2024-10-13 10:42:42,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:42:42,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1865805221, now seen corresponding path program 2 times [2024-10-13 10:42:42,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:42:42,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130950231] [2024-10-13 10:42:42,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:42:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:42:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:42:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:42:43,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:42:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130950231] [2024-10-13 10:42:43,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130950231] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:42:43,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418390753] [2024-10-13 10:42:43,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:42:43,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:42:43,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:42:43,189 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:42:43,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 10:42:43,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:42:43,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:42:43,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-13 10:42:43,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:42:43,314 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-13 10:42:43,338 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-13 10:42:43,347 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-13 10:42:43,358 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 19 treesize of output 18 [2024-10-13 10:42:43,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-13 10:42:43,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-13 10:42:43,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-13 10:42:43,471 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:42:43,471 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-13 10:42:43,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-10-13 10:42:43,543 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 30 treesize of output 21 [2024-10-13 10:42:43,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:43,632 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2024-10-13 10:42:43,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 121 treesize of output 96 [2024-10-13 10:42:43,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:42:43,666 INFO L349 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2024-10-13 10:42:43,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 60 [2024-10-13 10:42:43,870 INFO L349 Elim1Store]: treesize reduction 90, result has 15.9 percent of original size [2024-10-13 10:42:43,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 168 treesize of output 118 [2024-10-13 10:42:43,888 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 146 treesize of output 117 [2024-10-13 10:42:45,649 INFO L349 Elim1Store]: treesize reduction 124, result has 72.9 percent of original size [2024-10-13 10:42:45,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 3 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 313 treesize of output 559