./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 a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:44:22,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:44:22,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:44:22,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:44:22,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:44:22,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:44:22,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:44:22,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:44:22,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:44:22,932 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:44:22,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:44:22,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:44:22,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:44:22,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:44:22,937 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:44:22,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:44:22,938 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:44:22,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:44:22,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:44:22,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:44:22,943 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:44:22,944 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:44:22,944 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:44:22,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:44:22,945 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:44:22,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:44:22,945 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:44:22,945 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:44:22,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:44:22,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:44:22,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:44:22,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:44:22,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:44:22,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:44:22,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:44:22,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:44:22,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:44:22,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:44:22,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:44:22,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:44:22,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:44:22,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:44:22,952 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f3d269e2deae26c7ce036912e3874a49494c634991dfc4135fd1a54005e7fac [2024-10-13 10:44:23,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:44:23,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:44:23,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:44:23,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:44:23,298 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:44:23,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2024-10-13 10:44:24,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:44:24,978 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:44:24,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers4-2.c [2024-10-13 10:44:24,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8669dee01/eac23aa01f4f405d929f16ae1c450081/FLAG2e5478251 [2024-10-13 10:44:24,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8669dee01/eac23aa01f4f405d929f16ae1c450081 [2024-10-13 10:44:24,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:44:25,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:44:25,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:44:25,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:44:25,007 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:44:25,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:44:24" (1/1) ... [2024-10-13 10:44:25,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4790ce3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25, skipping insertion in model container [2024-10-13 10:44:25,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:44:24" (1/1) ... [2024-10-13 10:44:25,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:44:25,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:44:25,257 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:44:25,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:44:25,314 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:44:25,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25 WrapperNode [2024-10-13 10:44:25,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:44:25,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:44:25,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:44:25,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:44:25,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25" (1/1) ... [2024-10-13 10:44:25,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25" (1/1) ... [2024-10-13 10:44:25,354 INFO L138 Inliner]: procedures = 13, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 99 [2024-10-13 10:44:25,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:44:25,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:44:25,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:44:25,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:44:25,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25" (1/1) ... [2024-10-13 10:44:25,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25" (1/1) ... [2024-10-13 10:44:25,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25" (1/1) ... [2024-10-13 10:44:25,381 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-13 10:44:25,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25" (1/1) ... [2024-10-13 10:44:25,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25" (1/1) ... [2024-10-13 10:44:25,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25" (1/1) ... [2024-10-13 10:44:25,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25" (1/1) ... [2024-10-13 10:44:25,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25" (1/1) ... [2024-10-13 10:44:25,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25" (1/1) ... [2024-10-13 10:44:25,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:44:25,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:44:25,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:44:25,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:44:25,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25" (1/1) ... [2024-10-13 10:44:25,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:44:25,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:25,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:44:25,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:44:25,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:44:25,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:44:25,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:44:25,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:44:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 10:44:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 10:44:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:44:25,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:44:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:44:25,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:44:25,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 10:44:25,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 10:44:25,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:44:25,569 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:44:25,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:44:25,854 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-10-13 10:44:25,854 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:44:25,919 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:44:25,919 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-13 10:44:25,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:44:25 BoogieIcfgContainer [2024-10-13 10:44:25,921 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:44:25,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:44:25,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:44:25,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:44:25,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:44:24" (1/3) ... [2024-10-13 10:44:25,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f13d207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:44:25, skipping insertion in model container [2024-10-13 10:44:25,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:44:25" (2/3) ... [2024-10-13 10:44:25,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f13d207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:44:25, skipping insertion in model container [2024-10-13 10:44:25,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:44:25" (3/3) ... [2024-10-13 10:44:25,932 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers4-2.c [2024-10-13 10:44:25,949 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:44:25,950 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-10-13 10:44:26,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:44:26,016 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;@3f54abe0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:44:26,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-10-13 10:44:26,020 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-13 10:44:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:44:26,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:26,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:44:26,028 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-13 10:44:26,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:26,041 INFO L85 PathProgramCache]: Analyzing trace with hash 146394, now seen corresponding path program 1 times [2024-10-13 10:44:26,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:26,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535980819] [2024-10-13 10:44:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:26,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:44:26,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:26,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535980819] [2024-10-13 10:44:26,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535980819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:44:26,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:44:26,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:44:26,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846016648] [2024-10-13 10:44:26,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:44:26,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:44:26,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:26,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:44:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:44:26,332 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-13 10:44:26,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:26,394 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-10-13 10:44:26,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:44:26,397 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-13 10:44:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:26,402 INFO L225 Difference]: With dead ends: 37 [2024-10-13 10:44:26,402 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 10:44:26,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:44:26,405 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.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:44:26,406 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.0s Time] [2024-10-13 10:44:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 10:44:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-13 10:44:26,431 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-13 10:44:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-10-13 10:44:26,433 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 3 [2024-10-13 10:44:26,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:26,433 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-13 10:44:26,434 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-13 10:44:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-10-13 10:44:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:44:26,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:26,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:44:26,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:44:26,435 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-13 10:44:26,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash 146395, now seen corresponding path program 1 times [2024-10-13 10:44:26,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:26,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009048607] [2024-10-13 10:44:26,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:26,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:44:26,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:26,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009048607] [2024-10-13 10:44:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009048607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:44:26,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:44:26,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:44:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671107098] [2024-10-13 10:44:26,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:44:26,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:44:26,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:26,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:44:26,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:44:26,586 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-13 10:44:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:26,643 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-13 10:44:26,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:44:26,644 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-13 10:44:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:26,645 INFO L225 Difference]: With dead ends: 38 [2024-10-13 10:44:26,645 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 10:44:26,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:44:26,647 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-13 10:44:26,647 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-13 10:44:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 10:44:26,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-13 10:44:26,655 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-13 10:44:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-10-13 10:44:26,657 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 3 [2024-10-13 10:44:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:26,657 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-13 10:44:26,657 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-13 10:44:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-10-13 10:44:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:44:26,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:26,658 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1] [2024-10-13 10:44:26,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:44:26,659 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-13 10:44:26,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:26,660 INFO L85 PathProgramCache]: Analyzing trace with hash 140793550, now seen corresponding path program 1 times [2024-10-13 10:44:26,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:26,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193820574] [2024-10-13 10:44:26,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:26,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:26,887 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-13 10:44:26,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:26,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193820574] [2024-10-13 10:44:26,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193820574] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:26,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814942065] [2024-10-13 10:44:26,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:26,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:26,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:26,892 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:26,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:44:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:26,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:44:26,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:27,094 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-13 10:44:27,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:27,190 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-13 10:44:27,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814942065] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:44:27,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:44:27,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2024-10-13 10:44:27,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970284489] [2024-10-13 10:44:27,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:27,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:44:27,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:27,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:44:27,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:44:27,193 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-13 10:44:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:27,391 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-10-13 10:44:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:44:27,392 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-13 10:44:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:27,392 INFO L225 Difference]: With dead ends: 42 [2024-10-13 10:44:27,392 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 10:44:27,393 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-13 10:44:27,394 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-13 10:44:27,394 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-13 10:44:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 10:44:27,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 10:44:27,400 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-13 10:44:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-10-13 10:44:27,402 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 5 [2024-10-13 10:44:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:27,402 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-10-13 10:44:27,403 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-13 10:44:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-10-13 10:44:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:44:27,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:27,404 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2024-10-13 10:44:27,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:44:27,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:27,605 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-13 10:44:27,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:27,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1981920903, now seen corresponding path program 1 times [2024-10-13 10:44:27,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:27,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911154547] [2024-10-13 10:44:27,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:27,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:27,724 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-13 10:44:27,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:27,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911154547] [2024-10-13 10:44:27,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911154547] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:27,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432957888] [2024-10-13 10:44:27,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:27,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:27,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:27,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:27,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:44:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:27,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:44:27,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:27,848 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-13 10:44:27,850 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:27,929 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-13 10:44:27,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432957888] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:44:27,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:44:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-13 10:44:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553298553] [2024-10-13 10:44:27,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:27,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:44:27,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:44:27,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:44:27,932 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-13 10:44:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:28,039 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-10-13 10:44:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:44:28,039 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-13 10:44:28,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:28,040 INFO L225 Difference]: With dead ends: 54 [2024-10-13 10:44:28,040 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 10:44:28,041 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-13 10:44:28,041 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-13 10:44:28,042 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-13 10:44:28,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 10:44:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 10:44:28,049 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-13 10:44:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-10-13 10:44:28,050 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 13 [2024-10-13 10:44:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:28,050 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-10-13 10:44:28,051 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-13 10:44:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-10-13 10:44:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:44:28,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:28,051 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2024-10-13 10:44:28,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 10:44:28,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-13 10:44:28,252 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-13 10:44:28,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1687333227, now seen corresponding path program 2 times [2024-10-13 10:44:28,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:28,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069107092] [2024-10-13 10:44:28,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:28,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:28,496 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-13 10:44:28,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:28,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069107092] [2024-10-13 10:44:28,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069107092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:44:28,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:44:28,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:44:28,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404333528] [2024-10-13 10:44:28,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:44:28,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:44:28,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:28,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:44:28,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:44:28,499 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-13 10:44:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:28,565 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-10-13 10:44:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:44:28,565 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-13 10:44:28,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:28,566 INFO L225 Difference]: With dead ends: 58 [2024-10-13 10:44:28,566 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 10:44:28,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:44:28,568 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.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:44:28,568 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.0s Time] [2024-10-13 10:44:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 10:44:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-10-13 10:44:28,573 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-13 10:44:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-10-13 10:44:28,574 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 25 [2024-10-13 10:44:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:28,576 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-10-13 10:44:28,576 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-13 10:44:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-10-13 10:44:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:44:28,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:28,577 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2024-10-13 10:44:28,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:44:28,577 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-13 10:44:28,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1687333226, now seen corresponding path program 1 times [2024-10-13 10:44:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:28,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013136432] [2024-10-13 10:44:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:28,684 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-13 10:44:28,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:28,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013136432] [2024-10-13 10:44:28,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013136432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:44:28,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:44:28,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:44:28,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754559367] [2024-10-13 10:44:28,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:44:28,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:44:28,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:28,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:44:28,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:44:28,688 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-13 10:44:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:28,738 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-10-13 10:44:28,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:44:28,739 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-13 10:44:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:28,739 INFO L225 Difference]: With dead ends: 55 [2024-10-13 10:44:28,740 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 10:44:28,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:44:28,741 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-13 10:44:28,741 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-13 10:44:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 10:44:28,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-13 10:44:28,749 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-13 10:44:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-10-13 10:44:28,751 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 25 [2024-10-13 10:44:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:28,751 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-10-13 10:44:28,751 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-13 10:44:28,751 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-10-13 10:44:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:44:28,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:28,752 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:28,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:44:28,752 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-13 10:44:28,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:28,753 INFO L85 PathProgramCache]: Analyzing trace with hash 767722457, now seen corresponding path program 1 times [2024-10-13 10:44:28,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:28,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219920060] [2024-10-13 10:44:28,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:28,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:28,868 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-13 10:44:28,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:28,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219920060] [2024-10-13 10:44:28,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219920060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:44:28,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:44:28,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:44:28,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360908042] [2024-10-13 10:44:28,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:44:28,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:44:28,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:28,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:44:28,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:44:28,871 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-13 10:44:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:28,904 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-10-13 10:44:28,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:44:28,904 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-13 10:44:28,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:28,905 INFO L225 Difference]: With dead ends: 54 [2024-10-13 10:44:28,905 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 10:44:28,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:44:28,906 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-13 10:44:28,906 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-13 10:44:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 10:44:28,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 10:44:28,912 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-13 10:44:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-10-13 10:44:28,913 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 26 [2024-10-13 10:44:28,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:28,914 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-10-13 10:44:28,915 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-13 10:44:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-10-13 10:44:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:44:28,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:28,916 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:28,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:44:28,917 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-13 10:44:28,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:28,917 INFO L85 PathProgramCache]: Analyzing trace with hash 767722458, now seen corresponding path program 1 times [2024-10-13 10:44:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:28,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585820587] [2024-10-13 10:44:28,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:28,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:29,085 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-13 10:44:29,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:29,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585820587] [2024-10-13 10:44:29,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585820587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:44:29,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:44:29,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:44:29,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117127303] [2024-10-13 10:44:29,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:44:29,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:44:29,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:29,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:44:29,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:44:29,087 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-13 10:44:29,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:29,131 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-10-13 10:44:29,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:44:29,132 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-13 10:44:29,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:29,133 INFO L225 Difference]: With dead ends: 55 [2024-10-13 10:44:29,133 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 10:44:29,133 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-13 10:44:29,134 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-13 10:44:29,134 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-13 10:44:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 10:44:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-13 10:44:29,141 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-13 10:44:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-10-13 10:44:29,145 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 26 [2024-10-13 10:44:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:29,145 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-10-13 10:44:29,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:44:29,162 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-10-13 10:44:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:44:29,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:29,163 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:29,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:44:29,163 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-13 10:44:29,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:29,164 INFO L85 PathProgramCache]: Analyzing trace with hash -953003431, now seen corresponding path program 1 times [2024-10-13 10:44:29,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:29,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405348569] [2024-10-13 10:44:29,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:29,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:29,403 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-13 10:44:29,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:29,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405348569] [2024-10-13 10:44:29,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405348569] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:29,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546578201] [2024-10-13 10:44:29,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:29,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:29,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:29,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:29,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:44:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:29,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:44:29,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:29,838 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-13 10:44:29,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:29,975 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-13 10:44:30,324 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-13 10:44:30,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546578201] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:44:30,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:44:30,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 30 [2024-10-13 10:44:30,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500017180] [2024-10-13 10:44:30,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:30,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-13 10:44:30,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:30,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-13 10:44:30,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=730, Unknown=0, NotChecked=0, Total=992 [2024-10-13 10:44:30,327 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-13 10:44:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:30,793 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-10-13 10:44:30,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 10:44:30,793 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-13 10:44:30,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:30,796 INFO L225 Difference]: With dead ends: 61 [2024-10-13 10:44:30,797 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 10:44:30,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=559, Invalid=1603, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:44:30,798 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 10:44:30,799 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-13 10:44:30,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 10:44:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-13 10:44:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:44:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-10-13 10:44:30,809 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 28 [2024-10-13 10:44:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:30,810 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-10-13 10:44:30,810 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-13 10:44:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-10-13 10:44:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:44:30,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:30,811 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1] [2024-10-13 10:44:30,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:44:31,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:31,012 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-13 10:44:31,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash 521664684, now seen corresponding path program 1 times [2024-10-13 10:44:31,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:31,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701466315] [2024-10-13 10:44:31,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:31,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:31,224 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-13 10:44:31,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:31,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701466315] [2024-10-13 10:44:31,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701466315] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:31,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908135699] [2024-10-13 10:44:31,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:31,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:31,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:31,228 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:31,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 10:44:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:31,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:44:31,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:31,510 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-13 10:44:31,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:31,647 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-13 10:44:31,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908135699] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:44:31,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:44:31,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-10-13 10:44:31,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513624535] [2024-10-13 10:44:31,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:31,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:44:31,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:31,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:44:31,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:44:31,649 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-13 10:44:31,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:31,854 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-10-13 10:44:31,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:44:31,854 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-13 10:44:31,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:31,855 INFO L225 Difference]: With dead ends: 61 [2024-10-13 10:44:31,855 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 10:44:31,855 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-13 10:44:31,856 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-13 10:44:31,856 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-13 10:44:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 10:44:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-10-13 10:44:31,863 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-13 10:44:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-10-13 10:44:31,864 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 29 [2024-10-13 10:44:31,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:31,864 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-10-13 10:44:31,864 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-13 10:44:31,864 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-10-13 10:44:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 10:44:31,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:31,868 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:31,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 10:44:32,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:32,069 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-13 10:44:32,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:32,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1421362251, now seen corresponding path program 1 times [2024-10-13 10:44:32,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:32,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225916538] [2024-10-13 10:44:32,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:32,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:32,201 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-13 10:44:32,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:32,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225916538] [2024-10-13 10:44:32,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225916538] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:32,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906104413] [2024-10-13 10:44:32,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:32,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:32,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:32,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:32,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 10:44:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:32,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:44:32,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:32,335 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-13 10:44:32,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:32,403 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-13 10:44:32,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906104413] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:44:32,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:44:32,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-13 10:44:32,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111564808] [2024-10-13 10:44:32,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:32,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:44:32,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:32,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:44:32,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:44:32,407 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-13 10:44:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:32,473 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-10-13 10:44:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:44:32,474 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-13 10:44:32,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:32,475 INFO L225 Difference]: With dead ends: 78 [2024-10-13 10:44:32,475 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 10:44:32,475 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-13 10:44:32,476 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-13 10:44:32,476 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-13 10:44:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 10:44:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 10:44:32,482 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-13 10:44:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-10-13 10:44:32,483 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 39 [2024-10-13 10:44:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:32,483 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-10-13 10:44:32,484 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-13 10:44:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-10-13 10:44:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 10:44:32,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:32,485 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:32,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 10:44:32,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 10:44:32,686 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-13 10:44:32,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:32,687 INFO L85 PathProgramCache]: Analyzing trace with hash 324958219, now seen corresponding path program 2 times [2024-10-13 10:44:32,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:32,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409294635] [2024-10-13 10:44:32,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:32,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:32,984 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-13 10:44:32,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:32,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409294635] [2024-10-13 10:44:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409294635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:44:32,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:44:32,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:44:32,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145276712] [2024-10-13 10:44:32,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:44:32,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:44:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:32,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:44:32,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:44:32,987 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-13 10:44:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:33,023 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2024-10-13 10:44:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:44:33,024 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-13 10:44:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:33,026 INFO L225 Difference]: With dead ends: 77 [2024-10-13 10:44:33,026 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 10:44:33,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:44:33,027 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-13 10:44:33,027 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-13 10:44:33,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 10:44:33,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 10:44:33,035 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-13 10:44:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2024-10-13 10:44:33,035 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 57 [2024-10-13 10:44:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:33,035 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2024-10-13 10:44:33,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:44:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2024-10-13 10:44:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 10:44:33,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:33,039 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:33,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:44:33,040 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-13 10:44:33,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash 324958220, now seen corresponding path program 1 times [2024-10-13 10:44:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:33,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134978023] [2024-10-13 10:44:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:33,416 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-13 10:44:33,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134978023] [2024-10-13 10:44:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134978023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:44:33,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:44:33,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:44:33,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476015702] [2024-10-13 10:44:33,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:44:33,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:44:33,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:33,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:44:33,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:44:33,419 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-13 10:44:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:33,477 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2024-10-13 10:44:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:44:33,478 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-13 10:44:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:33,478 INFO L225 Difference]: With dead ends: 81 [2024-10-13 10:44:33,479 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 10:44:33,479 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-13 10:44:33,479 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-13 10:44:33,480 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-13 10:44:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 10:44:33,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-10-13 10:44:33,484 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-13 10:44:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-10-13 10:44:33,484 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 57 [2024-10-13 10:44:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:33,485 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-10-13 10:44:33,485 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-13 10:44:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-10-13 10:44:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 10:44:33,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:33,489 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:33,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:44:33,489 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-13 10:44:33,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:33,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1483770223, now seen corresponding path program 1 times [2024-10-13 10:44:33,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:33,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147984798] [2024-10-13 10:44:33,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:33,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:33,587 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-13 10:44:33,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:33,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147984798] [2024-10-13 10:44:33,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147984798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:44:33,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:44:33,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:44:33,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861744859] [2024-10-13 10:44:33,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:44:33,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:44:33,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:44:33,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:44:33,590 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-13 10:44:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:33,613 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-10-13 10:44:33,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:44:33,614 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-13 10:44:33,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:33,615 INFO L225 Difference]: With dead ends: 78 [2024-10-13 10:44:33,615 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 10:44:33,615 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-13 10:44:33,615 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-13 10:44:33,616 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-13 10:44:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 10:44:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 10:44:33,618 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-13 10:44:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-10-13 10:44:33,619 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 58 [2024-10-13 10:44:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:33,619 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-10-13 10:44:33,619 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-13 10:44:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-10-13 10:44:33,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 10:44:33,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:33,620 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:33,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:44:33,621 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-13 10:44:33,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:33,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1483770224, now seen corresponding path program 1 times [2024-10-13 10:44:33,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:33,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743999284] [2024-10-13 10:44:33,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:33,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:33,800 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-13 10:44:33,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:33,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743999284] [2024-10-13 10:44:33,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743999284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:44:33,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:44:33,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:44:33,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390760147] [2024-10-13 10:44:33,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:44:33,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:44:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:33,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:44:33,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:44:33,803 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-13 10:44:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:33,833 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-10-13 10:44:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:44:33,834 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-13 10:44:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:33,834 INFO L225 Difference]: With dead ends: 79 [2024-10-13 10:44:33,834 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 10:44:33,835 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-13 10:44:33,835 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-13 10:44:33,835 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-13 10:44:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 10:44:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-13 10:44:33,841 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-13 10:44:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-10-13 10:44:33,841 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 58 [2024-10-13 10:44:33,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:33,842 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-10-13 10:44:33,842 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-13 10:44:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-10-13 10:44:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 10:44:33,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:33,843 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:33,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:44:33,843 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-13 10:44:33,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:33,844 INFO L85 PathProgramCache]: Analyzing trace with hash -25899603, now seen corresponding path program 1 times [2024-10-13 10:44:33,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:33,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043575777] [2024-10-13 10:44:33,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:33,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:34,206 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-13 10:44:34,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:34,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043575777] [2024-10-13 10:44:34,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043575777] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:34,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81713315] [2024-10-13 10:44:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:34,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:34,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:34,209 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:34,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 10:44:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:34,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 10:44:34,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:34,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:44:34,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:44:34,852 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-13 10:44:34,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:35,676 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-13 10:44:35,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81713315] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:44:35,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:44:35,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-10-13 10:44:35,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542739409] [2024-10-13 10:44:35,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:35,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:44:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:35,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:44:35,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:44:35,681 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-13 10:44:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:35,886 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2024-10-13 10:44:35,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:44:35,887 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-13 10:44:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:35,887 INFO L225 Difference]: With dead ends: 87 [2024-10-13 10:44:35,887 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 10:44:35,888 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-13 10:44:35,889 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-13 10:44:35,889 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-13 10:44:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 10:44:35,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 10:44:35,892 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-13 10:44:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2024-10-13 10:44:35,893 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 60 [2024-10-13 10:44:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:35,894 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2024-10-13 10:44:35,894 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-13 10:44:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2024-10-13 10:44:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-13 10:44:35,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:35,896 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:35,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 10:44:36,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 10:44:36,097 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-13 10:44:36,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash -802887697, now seen corresponding path program 1 times [2024-10-13 10:44:36,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:36,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604531343] [2024-10-13 10:44:36,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:36,320 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-13 10:44:36,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:36,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604531343] [2024-10-13 10:44:36,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604531343] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:36,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366596047] [2024-10-13 10:44:36,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:36,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:36,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:36,323 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:36,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 10:44:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:36,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:44:36,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:36,471 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-13 10:44:36,514 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-13 10:44:36,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:36,563 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-13 10:44:36,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366596047] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:44:36,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:44:36,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-10-13 10:44:36,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30128320] [2024-10-13 10:44:36,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:36,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:44:36,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:36,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:44:36,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:44:36,567 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-13 10:44:36,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:36,639 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2024-10-13 10:44:36,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:44:36,639 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-13 10:44:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:36,640 INFO L225 Difference]: With dead ends: 88 [2024-10-13 10:44:36,640 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 10:44:36,640 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-13 10:44:36,641 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-13 10:44:36,641 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-13 10:44:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 10:44:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 10:44:36,646 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-13 10:44:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2024-10-13 10:44:36,646 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 61 [2024-10-13 10:44:36,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:36,647 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2024-10-13 10:44:36,647 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-13 10:44:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2024-10-13 10:44:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 10:44:36,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:36,647 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:36,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 10:44:36,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:36,848 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-13 10:44:36,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:36,849 INFO L85 PathProgramCache]: Analyzing trace with hash -439665324, now seen corresponding path program 1 times [2024-10-13 10:44:36,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:36,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221663450] [2024-10-13 10:44:36,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:36,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:36,954 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-13 10:44:36,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:36,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221663450] [2024-10-13 10:44:36,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221663450] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:36,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820284221] [2024-10-13 10:44:36,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:36,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:36,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:36,957 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:36,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 10:44:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:37,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:44:37,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:37,143 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-13 10:44:37,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:37,169 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-13 10:44:37,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820284221] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:44:37,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:44:37,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-13 10:44:37,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225496751] [2024-10-13 10:44:37,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:37,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:44:37,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:37,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:44:37,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:44:37,172 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-13 10:44:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:37,226 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-10-13 10:44:37,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:44:37,227 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-13 10:44:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:37,227 INFO L225 Difference]: With dead ends: 92 [2024-10-13 10:44:37,227 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 10:44:37,228 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-13 10:44:37,228 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-13 10:44:37,228 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-13 10:44:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 10:44:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-13 10:44:37,230 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-13 10:44:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2024-10-13 10:44:37,231 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 65 [2024-10-13 10:44:37,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:37,231 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2024-10-13 10:44:37,231 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-13 10:44:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2024-10-13 10:44:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 10:44:37,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:37,232 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:37,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 10:44:37,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-13 10:44:37,433 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-13 10:44:37,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 100847820, now seen corresponding path program 2 times [2024-10-13 10:44:37,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:37,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973330735] [2024-10-13 10:44:37,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:37,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:37,842 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-13 10:44:37,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:37,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973330735] [2024-10-13 10:44:37,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973330735] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:37,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656857822] [2024-10-13 10:44:37,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:44:37,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:37,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:37,845 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:37,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 10:44:37,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:44:37,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:44:37,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:44:38,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:38,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:44:38,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:44:38,569 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-13 10:44:38,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:39,407 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-13 10:44:39,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656857822] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:44:39,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:44:39,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2024-10-13 10:44:39,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270470892] [2024-10-13 10:44:39,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:39,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-13 10:44:39,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:39,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-13 10:44:39,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:44:39,409 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-13 10:44:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:39,896 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-10-13 10:44:39,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:44:39,897 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-13 10:44:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:39,899 INFO L225 Difference]: With dead ends: 105 [2024-10-13 10:44:39,899 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 10:44:39,900 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-13 10:44:39,900 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-13 10:44:39,901 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-13 10:44:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 10:44:39,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 10:44:39,904 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-13 10:44:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-10-13 10:44:39,905 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 69 [2024-10-13 10:44:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:39,905 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-10-13 10:44:39,905 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-13 10:44:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-10-13 10:44:39,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 10:44:39,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:39,906 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:39,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 10:44:40,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:40,111 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-13 10:44:40,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:40,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1168684880, now seen corresponding path program 2 times [2024-10-13 10:44:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:40,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515277447] [2024-10-13 10:44:40,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:40,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:40,363 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-13 10:44:40,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:40,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515277447] [2024-10-13 10:44:40,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515277447] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:40,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166237098] [2024-10-13 10:44:40,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:44:40,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:40,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:40,366 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:40,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 10:44:40,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:44:40,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:44:40,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 10:44:40,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:40,550 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-13 10:44:40,633 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-13 10:44:40,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:40,951 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-13 10:44:40,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166237098] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:44:40,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:44:40,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-10-13 10:44:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815537151] [2024-10-13 10:44:40,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:40,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:44:40,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:40,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:44:40,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:44:40,953 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-13 10:44:41,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:41,075 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2024-10-13 10:44:41,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:44:41,076 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-13 10:44:41,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:41,076 INFO L225 Difference]: With dead ends: 104 [2024-10-13 10:44:41,076 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 10:44:41,077 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-13 10:44:41,077 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-13 10:44:41,077 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-13 10:44:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 10:44:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-13 10:44:41,080 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-13 10:44:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2024-10-13 10:44:41,080 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 70 [2024-10-13 10:44:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:41,080 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2024-10-13 10:44:41,081 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-13 10:44:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2024-10-13 10:44:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 10:44:41,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:41,081 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:41,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-13 10:44:41,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:41,282 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-13 10:44:41,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:41,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1377118700, now seen corresponding path program 2 times [2024-10-13 10:44:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:41,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595293317] [2024-10-13 10:44:41,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:41,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:41,479 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-13 10:44:41,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:41,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595293317] [2024-10-13 10:44:41,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595293317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:41,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106856644] [2024-10-13 10:44:41,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:44:41,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:41,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:41,482 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:41,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 10:44:41,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:44:41,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:44:41,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:44:41,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:41,675 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-13 10:44:41,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:44:41,745 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-13 10:44:41,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106856644] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:44:41,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:44:41,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-10-13 10:44:41,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474204824] [2024-10-13 10:44:41,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:44:41,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:44:41,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:41,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:44:41,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:44:41,747 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-13 10:44:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:41,803 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2024-10-13 10:44:41,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:44:41,803 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-13 10:44:41,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:41,805 INFO L225 Difference]: With dead ends: 104 [2024-10-13 10:44:41,805 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 10:44:41,805 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-13 10:44:41,806 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-13 10:44:41,806 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-13 10:44:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 10:44:41,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-13 10:44:41,809 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-13 10:44:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2024-10-13 10:44:41,809 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 77 [2024-10-13 10:44:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:41,809 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2024-10-13 10:44:41,810 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-13 10:44:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2024-10-13 10:44:41,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 10:44:41,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:41,810 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:41,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-13 10:44:42,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-13 10:44:42,011 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-13 10:44:42,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:42,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1984035308, now seen corresponding path program 3 times [2024-10-13 10:44:42,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:42,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304607940] [2024-10-13 10:44:42,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:42,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:44:42,285 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-13 10:44:42,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:44:42,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304607940] [2024-10-13 10:44:42,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304607940] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:44:42,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657887047] [2024-10-13 10:44:42,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:44:42,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:44:42,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:44:42,287 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:44:42,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-13 10:44:42,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:44:42,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:44:42,416 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 10:44:42,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:44:42,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:44:42,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:44:43,006 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-13 10:44:43,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:44:43,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657887047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:44:43,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:44:43,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 18 [2024-10-13 10:44:43,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957686112] [2024-10-13 10:44:43,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:44:43,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:44:43,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:44:43,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:44:43,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:44:43,008 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-13 10:44:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:44:43,118 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2024-10-13 10:44:43,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:44:43,121 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-13 10:44:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:44:43,122 INFO L225 Difference]: With dead ends: 103 [2024-10-13 10:44:43,122 INFO L226 Difference]: Without dead ends: 103 [2024-10-13 10:44:43,122 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-13 10:44:43,123 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-13 10:44:43,123 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-13 10:44:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-13 10:44:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2024-10-13 10:44:43,126 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-13 10:44:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2024-10-13 10:44:43,127 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 87 [2024-10-13 10:44:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:44:43,127 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2024-10-13 10:44:43,127 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-13 10:44:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2024-10-13 10:44:43,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-13 10:44:43,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:44:43,128 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:43,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-13 10:44:43,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-13 10:44:43,333 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-13 10:44:43,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:44:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash -307540268, now seen corresponding path program 3 times [2024-10-13 10:44:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:44:43,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955885521] [2024-10-13 10:44:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:44:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:44:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:44:43,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 10:44:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 10:44:43,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 10:44:43,532 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 10:44:43,534 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2024-10-13 10:44:43,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2024-10-13 10:44:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2024-10-13 10:44:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2024-10-13 10:44:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2024-10-13 10:44:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2024-10-13 10:44:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2024-10-13 10:44:43,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2024-10-13 10:44:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2024-10-13 10:44:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2024-10-13 10:44:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2024-10-13 10:44:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2024-10-13 10:44:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2024-10-13 10:44:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2024-10-13 10:44:43,537 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2024-10-13 10:44:43,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2024-10-13 10:44:43,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2024-10-13 10:44:43,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 10:44:43,542 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:44:43,622 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:44:43,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:44:43 BoogieIcfgContainer [2024-10-13 10:44:43,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:44:43,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:44:43,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:44:43,626 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:44:43,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:44:25" (3/4) ... [2024-10-13 10:44:43,628 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 10:44:43,723 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:44:43,723 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:44:43,724 INFO L158 Benchmark]: Toolchain (without parser) took 18723.68ms. Allocated memory was 142.6MB in the beginning and 337.6MB in the end (delta: 195.0MB). Free memory was 72.7MB in the beginning and 123.7MB in the end (delta: -51.1MB). Peak memory consumption was 145.2MB. Max. memory is 16.1GB. [2024-10-13 10:44:43,724 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 142.6MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:44:43,724 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.68ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 115.7MB in the end (delta: -43.3MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-10-13 10:44:43,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.46ms. Allocated memory is still 142.6MB. Free memory was 115.7MB in the beginning and 113.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:44:43,725 INFO L158 Benchmark]: Boogie Preprocessor took 42.71ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:44:43,725 INFO L158 Benchmark]: RCFGBuilder took 522.61ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 105.6MB in the end (delta: 6.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 10:44:43,729 INFO L158 Benchmark]: TraceAbstraction took 17700.05ms. Allocated memory was 142.6MB in the beginning and 337.6MB in the end (delta: 195.0MB). Free memory was 104.9MB in the beginning and 131.1MB in the end (delta: -26.2MB). Peak memory consumption was 170.7MB. Max. memory is 16.1GB. [2024-10-13 10:44:43,730 INFO L158 Benchmark]: Witness Printer took 97.32ms. Allocated memory is still 337.6MB. Free memory was 131.1MB in the beginning and 123.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 10:44:43,731 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.21ms. Allocated memory is still 142.6MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.68ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 115.7MB in the end (delta: -43.3MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.46ms. Allocated memory is still 142.6MB. Free memory was 115.7MB in the beginning and 113.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.71ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.61ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 105.6MB in the end (delta: 6.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17700.05ms. Allocated memory was 142.6MB in the beginning and 337.6MB in the end (delta: 195.0MB). Free memory was 104.9MB in the beginning and 131.1MB in the end (delta: -26.2MB). Peak memory consumption was 170.7MB. Max. memory is 16.1GB. * Witness Printer took 97.32ms. Allocated memory is still 337.6MB. Free memory was 131.1MB in the beginning and 123.7MB 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: 17.6s, 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.5s 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 1633 NumberOfCodeBlocks, 1499 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2015 ConstructedInterpolants, 108 QuantifiedInterpolants, 16239 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-13 10:44:43,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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)