./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-ext3/getNumbers4-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:01:08,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:01:08,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:01:08,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:01:08,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:01:08,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:01:08,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:01:08,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:01:08,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:01:08,469 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:01:08,469 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:01:08,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:01:08,470 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:01:08,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:01:08,473 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:01:08,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:01:08,474 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:01:08,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:01:08,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:01:08,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:01:08,475 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:01:08,479 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:01:08,479 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:01:08,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:01:08,480 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:01:08,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:01:08,480 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:01:08,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:01:08,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:01:08,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:01:08,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:01:08,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:01:08,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:01:08,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:01:08,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:01:08,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:01:08,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:01:08,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:01:08,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:01:08,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:01:08,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:01:08,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:01:08,486 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac [2024-10-11 18:01:08,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:01:08,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:01:08,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:01:08,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:01:08,827 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:01:08,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2024-10-11 18:01:10,448 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:01:10,643 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:01:10,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2024-10-11 18:01:10,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/371998e34/70ec1e39260648429d78b3c5517df190/FLAG993b6b97e [2024-10-11 18:01:10,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/371998e34/70ec1e39260648429d78b3c5517df190 [2024-10-11 18:01:10,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:01:10,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:01:10,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:01:10,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:01:10,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:01:10,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:10,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d67ea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10, skipping insertion in model container [2024-10-11 18:01:10,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:10,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:01:10,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:01:10,893 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:01:10,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:01:10,930 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:01:10,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10 WrapperNode [2024-10-11 18:01:10,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:01:10,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:01:10,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:01:10,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:01:10,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:10,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:10,993 INFO L138 Inliner]: procedures = 13, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 99 [2024-10-11 18:01:10,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:01:10,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:01:11,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:01:11,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:01:11,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:11,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:11,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:11,053 INFO L175 MemorySlicer]: Split 11 memory accesses to 4 slices as follows [3, 3, 3, 2]. 27 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0, 0]. The 7 writes are split as follows [2, 2, 2, 1]. [2024-10-11 18:01:11,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:11,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:11,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:11,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:11,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:11,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:11,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:01:11,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:01:11,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:01:11,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:01:11,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10" (1/1) ... [2024-10-11 18:01:11,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:01:11,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:11,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:01:11,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:01:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:01:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 18:01:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:01:11,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 18:01:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 18:01:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 18:01:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:01:11,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:01:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:01:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:01:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 18:01:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 18:01:11,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:01:11,308 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:01:11,311 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:01:11,576 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-10-11 18:01:11,577 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:01:11,643 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:01:11,644 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 18:01:11,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:01:11 BoogieIcfgContainer [2024-10-11 18:01:11,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:01:11,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:01:11,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:01:11,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:01:11,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:01:10" (1/3) ... [2024-10-11 18:01:11,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566c7b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:01:11, skipping insertion in model container [2024-10-11 18:01:11,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:10" (2/3) ... [2024-10-11 18:01:11,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@566c7b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:01:11, skipping insertion in model container [2024-10-11 18:01:11,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:01:11" (3/3) ... [2024-10-11 18:01:11,662 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2024-10-11 18:01:11,679 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:01:11,680 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-10-11 18:01:11,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:01:11,743 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;@3aa75d5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:01:11,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-10-11 18:01:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 20 states have (on average 2.35) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:11,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 18:01:11,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:11,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 18:01:11,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:11,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:11,762 INFO L85 PathProgramCache]: Analyzing trace with hash 146394, now seen corresponding path program 1 times [2024-10-11 18:01:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:11,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947311510] [2024-10-11 18:01:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:11,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947311510] [2024-10-11 18:01:12,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947311510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:12,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:12,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:01:12,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134811610] [2024-10-11 18:01:12,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:12,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:12,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:12,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:12,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:12,084 INFO L87 Difference]: Start difference. First operand has 38 states, 20 states have (on average 2.35) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 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.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:12,156 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-10-11 18:01:12,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:12,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 18:01:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:12,167 INFO L225 Difference]: With dead ends: 37 [2024-10-11 18:01:12,167 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 18:01:12,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:12,175 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:12,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 31 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 18:01:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 18:01:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 2.0) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-10-11 18:01:12,211 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 3 [2024-10-11 18:01:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:12,211 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-11 18:01:12,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-10-11 18:01:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 18:01:12,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:12,214 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 18:01:12,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:01:12,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:12,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:12,216 INFO L85 PathProgramCache]: Analyzing trace with hash 146395, now seen corresponding path program 1 times [2024-10-11 18:01:12,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:12,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227314198] [2024-10-11 18:01:12,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:12,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:12,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:12,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227314198] [2024-10-11 18:01:12,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227314198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:12,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:12,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:01:12,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890336094] [2024-10-11 18:01:12,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:12,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:12,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:12,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:12,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:12,366 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:12,431 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-11 18:01:12,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 18:01:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:12,433 INFO L225 Difference]: With dead ends: 38 [2024-10-11 18:01:12,434 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 18:01:12,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:12,435 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:12,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:12,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 18:01:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 18:01:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-10-11 18:01:12,445 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 3 [2024-10-11 18:01:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:12,446 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-11 18:01:12,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-10-11 18:01:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:01:12,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:12,447 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1] [2024-10-11 18:01:12,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:01:12,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:12,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash 140793550, now seen corresponding path program 1 times [2024-10-11 18:01:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891465818] [2024-10-11 18:01:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:12,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:12,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:12,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891465818] [2024-10-11 18:01:12,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891465818] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092837280] [2024-10-11 18:01:12,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:12,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:12,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:12,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:12,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:01:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:12,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:01:12,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:12,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:12,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092837280] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:12,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:12,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-10-11 18:01:12,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752477329] [2024-10-11 18:01:12,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:12,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:01:12,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:01:12,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:01:12,960 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:13,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:13,134 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-10-11 18:01:13,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:01:13,135 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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 5 [2024-10-11 18:01:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:13,136 INFO L225 Difference]: With dead ends: 42 [2024-10-11 18:01:13,136 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 18:01:13,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:01:13,137 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:13,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 18:01:13,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 18:01:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-10-11 18:01:13,142 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 5 [2024-10-11 18:01:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:13,142 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-10-11 18:01:13,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-10-11 18:01:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:01:13,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:13,143 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2024-10-11 18:01:13,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:13,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:13,348 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:13,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:13,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1981920903, now seen corresponding path program 1 times [2024-10-11 18:01:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:13,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114198585] [2024-10-11 18:01:13,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:13,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:13,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:13,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114198585] [2024-10-11 18:01:13,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114198585] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:13,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529215630] [2024-10-11 18:01:13,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:13,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:13,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:13,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:13,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:01:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:13,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 18:01:13,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:13,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:13,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529215630] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:13,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:13,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-11 18:01:13,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846675415] [2024-10-11 18:01:13,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:13,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:01:13,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:13,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:01:13,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:13,684 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:13,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:13,789 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-10-11 18:01:13,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:01:13,790 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 18:01:13,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:13,791 INFO L225 Difference]: With dead ends: 54 [2024-10-11 18:01:13,791 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 18:01:13,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:13,792 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:13,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 244 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 18:01:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 18:01:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-10-11 18:01:13,798 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 13 [2024-10-11 18:01:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:13,798 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-10-11 18:01:13,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-10-11 18:01:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:01:13,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:13,800 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2024-10-11 18:01:13,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:01:14,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:14,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:14,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:14,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1687333227, now seen corresponding path program 2 times [2024-10-11 18:01:14,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:14,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702980290] [2024-10-11 18:01:14,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:14,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:01:14,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:14,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702980290] [2024-10-11 18:01:14,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702980290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:14,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:14,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:01:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54532896] [2024-10-11 18:01:14,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:14,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:01:14,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:14,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:01:14,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:01:14,265 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:14,339 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-10-11 18:01:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:14,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 18:01:14,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:14,344 INFO L225 Difference]: With dead ends: 58 [2024-10-11 18:01:14,344 INFO L226 Difference]: Without dead ends: 58 [2024-10-11 18:01:14,345 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-11 18:01:14,345 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:14,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 33 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-11 18:01:14,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-10-11 18:01:14,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:14,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-10-11 18:01:14,354 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 25 [2024-10-11 18:01:14,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:14,355 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-10-11 18:01:14,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:14,355 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-10-11 18:01:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:01:14,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:14,356 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2024-10-11 18:01:14,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:01:14,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:14,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:14,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1687333226, now seen corresponding path program 1 times [2024-10-11 18:01:14,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:14,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111197072] [2024-10-11 18:01:14,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:14,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-11 18:01:14,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:14,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111197072] [2024-10-11 18:01:14,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111197072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:14,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:14,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:14,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789112784] [2024-10-11 18:01:14,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:14,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:01:14,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:14,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:01:14,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:01:14,428 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:14,480 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-10-11 18:01:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:14,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 18:01:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:14,484 INFO L225 Difference]: With dead ends: 55 [2024-10-11 18:01:14,484 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 18:01:14,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:14,485 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:14,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 44 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:14,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 18:01:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 18:01:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-10-11 18:01:14,490 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 25 [2024-10-11 18:01:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:14,491 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-10-11 18:01:14,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:14,491 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-10-11 18:01:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:01:14,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:14,492 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:14,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:01:14,492 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:14,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:14,493 INFO L85 PathProgramCache]: Analyzing trace with hash 767722457, now seen corresponding path program 1 times [2024-10-11 18:01:14,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:14,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820148849] [2024-10-11 18:01:14,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:14,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:01:14,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:14,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820148849] [2024-10-11 18:01:14,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820148849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:14,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:14,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:01:14,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025807099] [2024-10-11 18:01:14,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:14,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:14,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:14,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:14,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:14,598 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-11 18:01:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:14,633 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-10-11 18:01:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:14,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 26 [2024-10-11 18:01:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:14,636 INFO L225 Difference]: With dead ends: 54 [2024-10-11 18:01:14,636 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 18:01:14,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:14,637 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:14,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 30 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:14,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 18:01:14,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 18:01:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-10-11 18:01:14,646 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 26 [2024-10-11 18:01:14,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:14,647 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-10-11 18:01:14,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-11 18:01:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-10-11 18:01:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:01:14,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:14,650 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:14,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:01:14,651 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:14,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:14,651 INFO L85 PathProgramCache]: Analyzing trace with hash 767722458, now seen corresponding path program 1 times [2024-10-11 18:01:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:14,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454164553] [2024-10-11 18:01:14,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:01:14,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:14,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454164553] [2024-10-11 18:01:14,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454164553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:14,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:14,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:01:14,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347692381] [2024-10-11 18:01:14,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:14,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:01:14,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:14,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:01:14,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:01:14,812 INFO L87 Difference]: Start difference. First operand 54 states and 58 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-11 18:01:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:14,860 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-10-11 18:01:14,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:14,861 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 26 [2024-10-11 18:01:14,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:14,861 INFO L225 Difference]: With dead ends: 55 [2024-10-11 18:01:14,861 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 18:01:14,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:01:14,862 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:14,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 31 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:14,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 18:01:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 18:01:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-10-11 18:01:14,874 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 26 [2024-10-11 18:01:14,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:14,875 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-10-11 18:01:14,875 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-11 18:01:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-10-11 18:01:14,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:01:14,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:14,876 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:14,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:01:14,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:14,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash -953003431, now seen corresponding path program 1 times [2024-10-11 18:01:14,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:14,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087676551] [2024-10-11 18:01:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:14,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:01:15,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:15,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087676551] [2024-10-11 18:01:15,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087676551] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:15,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014469240] [2024-10-11 18:01:15,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:15,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:15,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:15,154 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:15,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:01:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:15,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:01:15,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:15,599 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 90 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:15,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:15,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-11 18:01:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 90 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:16,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014469240] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:16,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:16,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 30 [2024-10-11 18:01:16,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682145079] [2024-10-11 18:01:16,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:16,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 18:01:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:16,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 18:01:16,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2024-10-11 18:01:16,122 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 32 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 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-11 18:01:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:16,641 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-10-11 18:01:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:01:16,642 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 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 28 [2024-10-11 18:01:16,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:16,645 INFO L225 Difference]: With dead ends: 61 [2024-10-11 18:01:16,645 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 18:01:16,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=559, Invalid=1603, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 18:01:16,646 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:16,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 78 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:01:16,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 18:01:16,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 18:01:16,654 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-11 18:01:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-10-11 18:01:16,658 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 28 [2024-10-11 18:01:16,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:16,658 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-10-11 18:01:16,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.129032258064516) internal successors, (66), 31 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-11 18:01:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-10-11 18:01:16,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:01:16,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:16,659 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 18:01:16,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:01:16,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:16,861 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:16,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:16,862 INFO L85 PathProgramCache]: Analyzing trace with hash 521664684, now seen corresponding path program 1 times [2024-10-11 18:01:16,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:16,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231864833] [2024-10-11 18:01:16,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:16,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-11 18:01:17,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:17,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231864833] [2024-10-11 18:01:17,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231864833] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:17,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803192180] [2024-10-11 18:01:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:17,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:17,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:17,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:17,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:01:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:17,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:01:17,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:01:17,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:01:17,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803192180] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:17,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:17,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-10-11 18:01:17,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489903695] [2024-10-11 18:01:17,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:17,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:01:17,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:17,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:01:17,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:01:17,594 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:17,803 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-10-11 18:01:17,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:01:17,804 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-11 18:01:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:17,804 INFO L225 Difference]: With dead ends: 61 [2024-10-11 18:01:17,804 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 18:01:17,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:01:17,805 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 86 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:17,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 76 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 18:01:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-10-11 18:01:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-10-11 18:01:17,810 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 29 [2024-10-11 18:01:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:17,810 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-10-11 18:01:17,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-10-11 18:01:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 18:01:17,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:17,811 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:17,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:01:18,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 18:01:18,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:18,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1421362251, now seen corresponding path program 1 times [2024-10-11 18:01:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:18,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028572774] [2024-10-11 18:01:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:18,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:01:18,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:18,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028572774] [2024-10-11 18:01:18,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028572774] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:18,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986864744] [2024-10-11 18:01:18,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:18,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:18,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:18,175 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:18,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:01:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:18,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 18:01:18,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:01:18,321 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 18:01:18,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986864744] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:18,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:18,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-11 18:01:18,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881809733] [2024-10-11 18:01:18,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:18,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:01:18,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:18,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:01:18,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:18,390 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:18,451 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-10-11 18:01:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:01:18,452 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-11 18:01:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:18,452 INFO L225 Difference]: With dead ends: 78 [2024-10-11 18:01:18,452 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 18:01:18,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:18,453 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:18,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 18:01:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 18:01:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-10-11 18:01:18,458 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 39 [2024-10-11 18:01:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:18,458 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-10-11 18:01:18,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-10-11 18:01:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 18:01:18,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:18,459 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:18,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:18,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 18:01:18,661 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:18,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:18,661 INFO L85 PathProgramCache]: Analyzing trace with hash 324958219, now seen corresponding path program 2 times [2024-10-11 18:01:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:18,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495044065] [2024-10-11 18:01:18,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:18,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:18,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:18,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495044065] [2024-10-11 18:01:18,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495044065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:18,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:18,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:01:18,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796389557] [2024-10-11 18:01:18,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:18,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:01:18,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:18,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:01:18,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:01:18,978 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:19,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:19,016 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2024-10-11 18:01:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:19,017 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 57 [2024-10-11 18:01:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:19,018 INFO L225 Difference]: With dead ends: 77 [2024-10-11 18:01:19,018 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 18:01:19,018 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-11 18:01:19,019 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:19,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 18:01:19,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 18:01:19,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.208955223880597) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:19,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2024-10-11 18:01:19,023 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 57 [2024-10-11 18:01:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:19,023 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2024-10-11 18:01:19,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2024-10-11 18:01:19,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 18:01:19,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:19,025 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:19,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:01:19,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:19,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:19,026 INFO L85 PathProgramCache]: Analyzing trace with hash 324958220, now seen corresponding path program 1 times [2024-10-11 18:01:19,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:19,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264682579] [2024-10-11 18:01:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:19,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-10-11 18:01:19,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:19,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264682579] [2024-10-11 18:01:19,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264682579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:19,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:19,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552875697] [2024-10-11 18:01:19,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:19,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:19,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:19,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:19,414 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:19,480 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2024-10-11 18:01:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:19,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 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 57 [2024-10-11 18:01:19,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:19,481 INFO L225 Difference]: With dead ends: 81 [2024-10-11 18:01:19,481 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 18:01:19,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-11 18:01:19,482 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 32 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:19,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 32 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 18:01:19,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-10-11 18:01:19,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-10-11 18:01:19,487 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 57 [2024-10-11 18:01:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:19,488 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-10-11 18:01:19,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-10-11 18:01:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 18:01:19,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:19,492 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:19,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:01:19,492 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:19,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:19,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1483770223, now seen corresponding path program 1 times [2024-10-11 18:01:19,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:19,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264010727] [2024-10-11 18:01:19,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:19,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:19,603 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:19,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:19,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264010727] [2024-10-11 18:01:19,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264010727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:19,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:19,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:01:19,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31331270] [2024-10-11 18:01:19,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:19,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:19,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:19,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:19,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:19,605 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:19,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:19,629 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-10-11 18:01:19,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:19,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-11 18:01:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:19,630 INFO L225 Difference]: With dead ends: 78 [2024-10-11 18:01:19,630 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 18:01:19,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:19,631 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:19,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 18:01:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 18:01:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-10-11 18:01:19,638 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 58 [2024-10-11 18:01:19,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:19,638 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-10-11 18:01:19,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:19,638 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-10-11 18:01:19,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 18:01:19,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:19,639 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:19,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:01:19,639 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:19,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1483770224, now seen corresponding path program 1 times [2024-10-11 18:01:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:19,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751215467] [2024-10-11 18:01:19,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:19,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:19,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:19,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751215467] [2024-10-11 18:01:19,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751215467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:19,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:19,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:01:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305216979] [2024-10-11 18:01:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:19,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:19,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:19,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:19,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:19,826 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:19,856 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-10-11 18:01:19,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:19,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-11 18:01:19,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:19,857 INFO L225 Difference]: With dead ends: 79 [2024-10-11 18:01:19,857 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 18:01:19,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:19,860 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:19,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 18:01:19,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 18:01:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:19,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-10-11 18:01:19,867 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 58 [2024-10-11 18:01:19,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:19,867 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-10-11 18:01:19,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-10-11 18:01:19,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 18:01:19,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:19,868 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:19,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 18:01:19,868 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:19,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash -25899603, now seen corresponding path program 1 times [2024-10-11 18:01:19,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:19,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062456104] [2024-10-11 18:01:19,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:19,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:20,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:20,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062456104] [2024-10-11 18:01:20,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062456104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:20,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919379177] [2024-10-11 18:01:20,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:20,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:20,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:20,301 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:20,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:01:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:20,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:01:20,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:20,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:01:20,885 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-11 18:01:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:20,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:21,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919379177] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:21,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:21,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-10-11 18:01:21,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438208592] [2024-10-11 18:01:21,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:21,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:01:21,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:21,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:01:21,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:01:21,792 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:22,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:22,005 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2024-10-11 18:01:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:01:22,005 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 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 60 [2024-10-11 18:01:22,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:22,006 INFO L225 Difference]: With dead ends: 87 [2024-10-11 18:01:22,006 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 18:01:22,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:01:22,007 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:22,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 75 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 18:01:22,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 18:01:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 86 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-10-11 18:01:22,011 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 60 [2024-10-11 18:01:22,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:22,011 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-10-11 18:01:22,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:22,012 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-10-11 18:01:22,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 18:01:22,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:22,012 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:22,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:22,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 18:01:22,219 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:22,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:22,220 INFO L85 PathProgramCache]: Analyzing trace with hash -802887697, now seen corresponding path program 1 times [2024-10-11 18:01:22,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:22,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817505679] [2024-10-11 18:01:22,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:22,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:22,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:22,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817505679] [2024-10-11 18:01:22,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817505679] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:22,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409277215] [2024-10-11 18:01:22,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:22,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:22,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:22,449 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:22,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:01:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:22,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:01:22,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:22,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:01:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:22,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:22,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409277215] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:22,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:22,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-10-11 18:01:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526828062] [2024-10-11 18:01:22,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:22,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:01:22,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:01:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:01:22,714 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:22,791 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2024-10-11 18:01:22,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:01:22,792 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-11 18:01:22,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:22,792 INFO L225 Difference]: With dead ends: 88 [2024-10-11 18:01:22,793 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 18:01:22,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:01:22,793 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:22,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 18:01:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 18:01:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2024-10-11 18:01:22,797 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 61 [2024-10-11 18:01:22,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:22,797 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2024-10-11 18:01:22,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2024-10-11 18:01:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 18:01:22,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:22,798 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:22,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:23,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:23,003 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:23,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:23,004 INFO L85 PathProgramCache]: Analyzing trace with hash -439665324, now seen corresponding path program 1 times [2024-10-11 18:01:23,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:23,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975944689] [2024-10-11 18:01:23,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:23,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:23,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:23,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975944689] [2024-10-11 18:01:23,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975944689] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:23,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514787690] [2024-10-11 18:01:23,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:23,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:23,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:23,143 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:23,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:01:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:23,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:01:23,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:23,322 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:23,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:23,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514787690] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:23,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:23,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-11 18:01:23,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464219763] [2024-10-11 18:01:23,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:23,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:01:23,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:23,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:01:23,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:01:23,352 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:23,410 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-10-11 18:01:23,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:01:23,411 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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 65 [2024-10-11 18:01:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:23,412 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:01:23,412 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:01:23,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:01:23,413 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:23,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 91 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:01:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 18:01:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.180722891566265) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2024-10-11 18:01:23,416 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 65 [2024-10-11 18:01:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:23,417 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2024-10-11 18:01:23,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2024-10-11 18:01:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 18:01:23,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:23,418 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:23,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 18:01:23,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:01:23,619 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:23,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash 100847820, now seen corresponding path program 2 times [2024-10-11 18:01:23,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:23,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407092159] [2024-10-11 18:01:23,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:24,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:24,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407092159] [2024-10-11 18:01:24,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407092159] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687578319] [2024-10-11 18:01:24,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:01:24,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:24,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:24,070 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:24,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:01:24,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:01:24,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:01:24,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 18:01:24,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:24,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:01:24,643 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-11 18:01:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:24,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:25,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687578319] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:25,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:25,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-10-11 18:01:25,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980813777] [2024-10-11 18:01:25,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:25,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 18:01:25,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:25,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 18:01:25,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:01:25,692 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:26,167 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-10-11 18:01:26,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:01:26,168 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 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 69 [2024-10-11 18:01:26,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:26,169 INFO L225 Difference]: With dead ends: 105 [2024-10-11 18:01:26,170 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 18:01:26,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=238, Invalid=692, Unknown=0, NotChecked=0, Total=930 [2024-10-11 18:01:26,171 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 112 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:26,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 153 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:01:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 18:01:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-11 18:01:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 104 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-10-11 18:01:26,175 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 69 [2024-10-11 18:01:26,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:26,175 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-10-11 18:01:26,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-10-11 18:01:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 18:01:26,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:26,176 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:26,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:26,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:26,381 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:26,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1168684880, now seen corresponding path program 2 times [2024-10-11 18:01:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:26,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551733967] [2024-10-11 18:01:26,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:26,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2024-10-11 18:01:26,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:26,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551733967] [2024-10-11 18:01:26,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551733967] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:26,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313979986] [2024-10-11 18:01:26,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:01:26,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:26,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:26,621 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:26,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:01:26,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 18:01:26,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:01:26,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:01:26,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:26,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:01:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2024-10-11 18:01:26,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:27,213 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2024-10-11 18:01:27,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313979986] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:27,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:27,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-10-11 18:01:27,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370789607] [2024-10-11 18:01:27,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:27,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:01:27,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:27,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:01:27,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:27,215 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:27,332 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2024-10-11 18:01:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:01:27,332 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-11 18:01:27,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:27,333 INFO L225 Difference]: With dead ends: 104 [2024-10-11 18:01:27,333 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 18:01:27,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:01:27,334 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:27,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 97 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:27,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 18:01:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 18:01:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 103 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2024-10-11 18:01:27,337 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 70 [2024-10-11 18:01:27,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:27,337 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2024-10-11 18:01:27,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:27,337 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2024-10-11 18:01:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 18:01:27,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:27,338 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:27,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:27,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:27,542 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:27,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:27,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1377118700, now seen corresponding path program 2 times [2024-10-11 18:01:27,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:27,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434083042] [2024-10-11 18:01:27,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:27,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:27,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:27,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434083042] [2024-10-11 18:01:27,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434083042] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:27,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057171408] [2024-10-11 18:01:27,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:01:27,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:27,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:27,780 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:27,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:01:27,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:01:27,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:01:27,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:01:27,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:27,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:28,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057171408] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:28,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:28,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-10-11 18:01:28,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409297507] [2024-10-11 18:01:28,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:28,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:01:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:28,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:01:28,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:28,056 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:28,111 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2024-10-11 18:01:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:01:28,111 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 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 77 [2024-10-11 18:01:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:28,112 INFO L225 Difference]: With dead ends: 104 [2024-10-11 18:01:28,112 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 18:01:28,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 146 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:28,113 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:28,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 37 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 18:01:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 18:01:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 96 states have (on average 1.125) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2024-10-11 18:01:28,116 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 77 [2024-10-11 18:01:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:28,116 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2024-10-11 18:01:28,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2024-10-11 18:01:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 18:01:28,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:28,117 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:28,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:28,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 18:01:28,318 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:28,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:28,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1984035308, now seen corresponding path program 3 times [2024-10-11 18:01:28,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052062095] [2024-10-11 18:01:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:28,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 127 proven. 28 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-11 18:01:28,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:28,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052062095] [2024-10-11 18:01:28,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052062095] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:28,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944163395] [2024-10-11 18:01:28,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 18:01:28,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:28,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:28,620 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:01:28,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:01:28,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 18:01:28,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:01:28,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 18:01:28,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:29,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:01:29,186 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-11 18:01:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2024-10-11 18:01:29,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:29,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944163395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:29,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:01:29,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 18 [2024-10-11 18:01:29,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167875037] [2024-10-11 18:01:29,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:29,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:01:29,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:29,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:01:29,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:01:29,411 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:29,503 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2024-10-11 18:01:29,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:01:29,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-11 18:01:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:29,504 INFO L225 Difference]: With dead ends: 103 [2024-10-11 18:01:29,504 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 18:01:29,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:01:29,505 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:29,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:29,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 18:01:29,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-10-11 18:01:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 95 states have (on average 1.1157894736842104) internal successors, (106), 101 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2024-10-11 18:01:29,508 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 87 [2024-10-11 18:01:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:29,508 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2024-10-11 18:01:29,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2024-10-11 18:01:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 18:01:29,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:29,509 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:29,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 18:01:29,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:29,714 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2024-10-11 18:01:29,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:29,714 INFO L85 PathProgramCache]: Analyzing trace with hash -307540268, now seen corresponding path program 3 times [2024-10-11 18:01:29,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:29,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627022062] [2024-10-11 18:01:29,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:29,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 18:01:29,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 18:01:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 18:01:29,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 18:01:29,896 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 18:01:29,898 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2024-10-11 18:01:29,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2024-10-11 18:01:29,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2024-10-11 18:01:29,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2024-10-11 18:01:29,902 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2024-10-11 18:01:29,902 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2024-10-11 18:01:29,902 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2024-10-11 18:01:29,902 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2024-10-11 18:01:29,902 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2024-10-11 18:01:29,902 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2024-10-11 18:01:29,902 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2024-10-11 18:01:29,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2024-10-11 18:01:29,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2024-10-11 18:01:29,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2024-10-11 18:01:29,903 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2024-10-11 18:01:29,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2024-10-11 18:01:29,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2024-10-11 18:01:29,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 18:01:29,907 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:30,005 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 18:01:30,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:01:30 BoogieIcfgContainer [2024-10-11 18:01:30,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 18:01:30,010 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 18:01:30,010 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 18:01:30,010 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 18:01:30,011 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:01:11" (3/4) ... [2024-10-11 18:01:30,011 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 18:01:30,089 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 18:01:30,090 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 18:01:30,090 INFO L158 Benchmark]: Toolchain (without parser) took 19418.87ms. Allocated memory was 186.6MB in the beginning and 390.1MB in the end (delta: 203.4MB). Free memory was 117.1MB in the beginning and 174.6MB in the end (delta: -57.5MB). Peak memory consumption was 147.4MB. Max. memory is 16.1GB. [2024-10-11 18:01:30,091 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:01:30,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.60ms. Allocated memory is still 186.6MB. Free memory was 116.9MB in the beginning and 104.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 18:01:30,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.19ms. Allocated memory is still 186.6MB. Free memory was 104.5MB in the beginning and 158.4MB in the end (delta: -53.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-11 18:01:30,091 INFO L158 Benchmark]: Boogie Preprocessor took 76.35ms. Allocated memory is still 186.6MB. Free memory was 158.4MB in the beginning and 156.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:01:30,092 INFO L158 Benchmark]: RCFGBuilder took 574.54ms. Allocated memory is still 186.6MB. Free memory was 156.0MB in the beginning and 135.1MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 18:01:30,092 INFO L158 Benchmark]: TraceAbstraction took 18359.75ms. Allocated memory was 186.6MB in the beginning and 390.1MB in the end (delta: 203.4MB). Free memory was 134.6MB in the beginning and 181.9MB in the end (delta: -47.3MB). Peak memory consumption was 159.2MB. Max. memory is 16.1GB. [2024-10-11 18:01:30,092 INFO L158 Benchmark]: Witness Printer took 80.11ms. Allocated memory is still 390.1MB. Free memory was 181.9MB in the beginning and 174.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 18:01:30,093 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 104.9MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.60ms. Allocated memory is still 186.6MB. Free memory was 116.9MB in the beginning and 104.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.19ms. Allocated memory is still 186.6MB. Free memory was 104.5MB in the beginning and 158.4MB in the end (delta: -53.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.35ms. Allocated memory is still 186.6MB. Free memory was 158.4MB in the beginning and 156.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 574.54ms. Allocated memory is still 186.6MB. Free memory was 156.0MB in the beginning and 135.1MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18359.75ms. Allocated memory was 186.6MB in the beginning and 390.1MB in the end (delta: 203.4MB). Free memory was 134.6MB in the beginning and 181.9MB in the end (delta: -47.3MB). Peak memory consumption was 159.2MB. Max. memory is 16.1GB. * Witness Printer took 80.11ms. Allocated memory is still 390.1MB. Free memory was 181.9MB in the beginning and 174.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L6] static int array[10]; [L6] static int array[10]; [L17] static int numbers2[10]; [L17] static int numbers2[10]; [L36] static int numbers4[10]; [L36] static int numbers4[10]; [L45] CALL getNumbers4() [L35] CALL, EXPR getNumbers3() [L25] CALL, EXPR getNumbers2() [L16] CALL, EXPR getNumbers() [L8] int i = 0; VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}] [L8] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}] [L9] array[i] = i [L8] ++i VAL [array={1:0}, i=10, numbers2={2:0}, numbers4={3:0}] [L8] COND FALSE !(i < 10) VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L12] return array; [L16] RET, EXPR getNumbers() [L16] int* numbers = getNumbers(); [L18] int i = 0; VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L19] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L19] numbers2[i] = numbers[i] [L18] ++i VAL [array={1:0}, i=10, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L18] COND FALSE !(i < 10) VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}, numbers={1:0}] [L21] return numbers2; [L25] RET, EXPR getNumbers2() [L25] int* numbers = getNumbers2(); [L26] int numbers3[10]; [L27] int i = 0; VAL [array={1:0}, i=0, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=1, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=2, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=3, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=4, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=5, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=6, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=7, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=8, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=9, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L28] EXPR numbers[i] VAL [array={1:0}, numbers2={2:0}, numbers4={3:0}] [L28] numbers3[i] = numbers[i] [L27] ++i VAL [array={1:0}, i=10, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L27] COND FALSE !(i < 10) VAL [array={1:0}, numbers2={2:0}, numbers3={10:0}, numbers4={3:0}, numbers={2:0}] [L31] return numbers3; [L31] return numbers3; [L35] RET, EXPR getNumbers3() [L35] int* numbers = getNumbers3(); [L37] int i = 0; VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}, numbers={10:0}] [L37] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers2={2:0}, numbers4={3:0}, numbers={10:0}] [L38] numbers[i] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 23, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 539 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 539 mSDsluCounter, 1479 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1046 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1873 IncrementalHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 433 mSDtfsCounter, 1873 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1235 GetRequests, 1015 SyntacticMatches, 4 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=19, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 1633 NumberOfCodeBlocks, 1499 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2015 ConstructedInterpolants, 108 QuantifiedInterpolants, 16252 SizeOfPredicates, 16 NumberOfNonLiveVariables, 2917 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 45 InterpolantComputations, 11 PerfectInterpolantSequences, 7517/7976 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 18:01:30,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)