./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-regression/test24-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/ldv-regression/test24-1.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 61e163c7079e2ec105ad677de51f27ac7eccc49ef492909c4fa51ebc02ead9b7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:18:32,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:18:32,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:18:32,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:18:32,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:18:32,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:18:32,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:18:32,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:18:32,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:18:32,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:18:32,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:18:32,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:18:32,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:18:32,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:18:32,167 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:18:32,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:18:32,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:18:32,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:18:32,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:18:32,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:18:32,172 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:18:32,175 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:18:32,176 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:18:32,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:18:32,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:18:32,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:18:32,177 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:18:32,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:18:32,177 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:18:32,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:18:32,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:18:32,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:18:32,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:18:32,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:18:32,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:18:32,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:18:32,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:18:32,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:18:32,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:18:32,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:18:32,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:18:32,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:18:32,182 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 -> 61e163c7079e2ec105ad677de51f27ac7eccc49ef492909c4fa51ebc02ead9b7 [2024-11-12 13:18:32,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:18:32,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:18:32,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:18:32,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:18:32,458 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:18:32,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test24-1.c [2024-11-12 13:18:33,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:18:34,048 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:18:34,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test24-1.c [2024-11-12 13:18:34,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db736dc0/89ffca4fa90d4c1a8f1f9262695e2391/FLAGc0a5149bc [2024-11-12 13:18:34,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db736dc0/89ffca4fa90d4c1a8f1f9262695e2391 [2024-11-12 13:18:34,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:18:34,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:18:34,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:18:34,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:18:34,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:18:34,080 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478987e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34, skipping insertion in model container [2024-11-12 13:18:34,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:18:34,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:18:34,349 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:18:34,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:18:34,391 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:18:34,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34 WrapperNode [2024-11-12 13:18:34,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:18:34,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:18:34,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:18:34,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:18:34,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,428 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-12 13:18:34,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:18:34,429 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:18:34,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:18:34,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:18:34,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,470 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-12 13:18:34,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:18:34,494 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:18:34,494 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:18:34,494 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:18:34,495 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34" (1/1) ... [2024-11-12 13:18:34,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:18:34,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:18:34,526 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-11-12 13:18:34,529 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-11-12 13:18:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:18:34,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 13:18:34,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 13:18:34,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 13:18:34,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:18:34,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 13:18:34,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:18:34,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:18:34,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 13:18:34,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 13:18:34,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:18:34,650 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:18:34,652 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:18:34,809 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-12 13:18:34,809 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:18:34,823 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:18:34,823 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 13:18:34,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:18:34 BoogieIcfgContainer [2024-11-12 13:18:34,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:18:34,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:18:34,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:18:34,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:18:34,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:18:34" (1/3) ... [2024-11-12 13:18:34,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8df9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:18:34, skipping insertion in model container [2024-11-12 13:18:34,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:18:34" (2/3) ... [2024-11-12 13:18:34,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8df9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:18:34, skipping insertion in model container [2024-11-12 13:18:34,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:18:34" (3/3) ... [2024-11-12 13:18:34,833 INFO L112 eAbstractionObserver]: Analyzing ICFG test24-1.c [2024-11-12 13:18:34,849 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:18:34,849 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-12 13:18:34,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:18:34,902 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;@d8073e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:18:34,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-12 13:18:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.7) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-12 13:18:34,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:18:34,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-12 13:18:34,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-12 13:18:34,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:18:34,919 INFO L85 PathProgramCache]: Analyzing trace with hash 925605, now seen corresponding path program 1 times [2024-11-12 13:18:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:18:34,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549330604] [2024-11-12 13:18:34,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:34,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:18:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:18:35,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:18:35,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549330604] [2024-11-12 13:18:35,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549330604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:18:35,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:18:35,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:18:35,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566782964] [2024-11-12 13:18:35,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:18:35,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:18:35,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:18:35,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:18:35,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:18:35,193 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.7) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:18:35,231 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2024-11-12 13:18:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:18:35,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-12 13:18:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:18:35,239 INFO L225 Difference]: With dead ends: 29 [2024-11-12 13:18:35,239 INFO L226 Difference]: Without dead ends: 27 [2024-11-12 13:18:35,240 INFO L434 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-11-12 13:18:35,243 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:18:35,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:18:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-12 13:18:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-12 13:18:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-12 13:18:35,276 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 4 [2024-11-12 13:18:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:18:35,276 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-12 13:18:35,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-12 13:18:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-12 13:18:35,277 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:18:35,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-12 13:18:35,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:18:35,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-12 13:18:35,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:18:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash 925606, now seen corresponding path program 1 times [2024-11-12 13:18:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:18:35,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011799146] [2024-11-12 13:18:35,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:35,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:18:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:35,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:18:35,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:18:35,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011799146] [2024-11-12 13:18:35,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011799146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:18:35,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:18:35,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:18:35,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474736216] [2024-11-12 13:18:35,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:18:35,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:18:35,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:18:35,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:18:35,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:18:35,494 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:35,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:18:35,554 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-11-12 13:18:35,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:18:35,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-12 13:18:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:18:35,557 INFO L225 Difference]: With dead ends: 27 [2024-11-12 13:18:35,557 INFO L226 Difference]: Without dead ends: 27 [2024-11-12 13:18:35,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:18:35,559 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:18:35,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:18:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-12 13:18:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-12 13:18:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.5) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-11-12 13:18:35,567 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 4 [2024-11-12 13:18:35,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:18:35,568 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-11-12 13:18:35,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-11-12 13:18:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:18:35,569 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:18:35,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:18:35,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:18:35,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-12 13:18:35,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:18:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash 28730511, now seen corresponding path program 1 times [2024-11-12 13:18:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:18:35,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997600209] [2024-11-12 13:18:35,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:35,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:18:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:18:35,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:18:35,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997600209] [2024-11-12 13:18:35,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997600209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:18:35,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:18:35,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:18:35,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549460314] [2024-11-12 13:18:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:18:35,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:18:35,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:18:35,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:18:35,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:18:35,724 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:35,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:18:35,766 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-12 13:18:35,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:18:35,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 13:18:35,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:18:35,768 INFO L225 Difference]: With dead ends: 25 [2024-11-12 13:18:35,768 INFO L226 Difference]: Without dead ends: 23 [2024-11-12 13:18:35,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:18:35,769 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:18:35,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:18:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-12 13:18:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-12 13:18:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.4375) internal successors, (23), 22 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-11-12 13:18:35,773 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 5 [2024-11-12 13:18:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:18:35,773 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-11-12 13:18:35,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-11-12 13:18:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:18:35,774 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:18:35,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:18:35,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:18:35,774 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-12 13:18:35,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:18:35,775 INFO L85 PathProgramCache]: Analyzing trace with hash 889505734, now seen corresponding path program 1 times [2024-11-12 13:18:35,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:18:35,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657414870] [2024-11-12 13:18:35,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:35,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:18:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:18:35,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:18:35,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657414870] [2024-11-12 13:18:35,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657414870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:18:35,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:18:35,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:18:35,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492040894] [2024-11-12 13:18:35,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:18:35,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:18:35,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:18:35,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:18:35,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:18:35,855 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:35,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:18:35,894 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-11-12 13:18:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:18:35,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 13:18:35,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:18:35,895 INFO L225 Difference]: With dead ends: 22 [2024-11-12 13:18:35,896 INFO L226 Difference]: Without dead ends: 22 [2024-11-12 13:18:35,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:18:35,897 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:18:35,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:18:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-12 13:18:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-12 13:18:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:35,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2024-11-12 13:18:35,900 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 6 [2024-11-12 13:18:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:18:35,900 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2024-11-12 13:18:35,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2024-11-12 13:18:35,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:18:35,901 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:18:35,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:18:35,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:18:35,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-12 13:18:35,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:18:35,902 INFO L85 PathProgramCache]: Analyzing trace with hash 889505735, now seen corresponding path program 1 times [2024-11-12 13:18:35,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:18:35,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908772209] [2024-11-12 13:18:35,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:35,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:18:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:18:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:18:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908772209] [2024-11-12 13:18:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908772209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:18:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:18:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:18:36,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367398976] [2024-11-12 13:18:36,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:18:36,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:18:36,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:18:36,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:18:36,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:18:36,065 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:18:36,100 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-11-12 13:18:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:18:36,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 13:18:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:18:36,101 INFO L225 Difference]: With dead ends: 21 [2024-11-12 13:18:36,101 INFO L226 Difference]: Without dead ends: 21 [2024-11-12 13:18:36,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:18:36,103 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:18:36,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 34 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:18:36,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-12 13:18:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-12 13:18:36,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-12 13:18:36,106 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 6 [2024-11-12 13:18:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:18:36,107 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-12 13:18:36,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 6 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-12 13:18:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 13:18:36,108 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:18:36,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:18:36,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:18:36,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-12 13:18:36,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:18:36,109 INFO L85 PathProgramCache]: Analyzing trace with hash 116517931, now seen corresponding path program 1 times [2024-11-12 13:18:36,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:18:36,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383650828] [2024-11-12 13:18:36,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:36,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:18:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:18:36,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:18:36,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383650828] [2024-11-12 13:18:36,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383650828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:18:36,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:18:36,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:18:36,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057560432] [2024-11-12 13:18:36,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:18:36,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:18:36,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:18:36,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:18:36,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:18:36,185 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-11-12 13:18:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:18:36,220 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-11-12 13:18:36,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:18:36,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 13:18:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:18:36,223 INFO L225 Difference]: With dead ends: 20 [2024-11-12 13:18:36,223 INFO L226 Difference]: Without dead ends: 20 [2024-11-12 13:18:36,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:18:36,224 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 35 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-11-12 13:18:36,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 35 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:18:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-12 13:18:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-12 13:18:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-11-12 13:18:36,227 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 8 [2024-11-12 13:18:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:18:36,227 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-11-12 13:18:36,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-11-12 13:18:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-11-12 13:18:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 13:18:36,228 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:18:36,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:18:36,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:18:36,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-12 13:18:36,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:18:36,229 INFO L85 PathProgramCache]: Analyzing trace with hash 116517932, now seen corresponding path program 1 times [2024-11-12 13:18:36,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:18:36,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627259916] [2024-11-12 13:18:36,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:36,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:18:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:18:36,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:18:36,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627259916] [2024-11-12 13:18:36,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627259916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:18:36,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:18:36,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:18:36,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597683142] [2024-11-12 13:18:36,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:18:36,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:18:36,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:18:36,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:18:36,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:18:36,479 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 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-11-12 13:18:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:18:36,556 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-11-12 13:18:36,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:18:36,557 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 13:18:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:18:36,557 INFO L225 Difference]: With dead ends: 19 [2024-11-12 13:18:36,557 INFO L226 Difference]: Without dead ends: 19 [2024-11-12 13:18:36,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:18:36,558 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:18:36,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 38 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:18:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-12 13:18:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-12 13:18:36,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2024-11-12 13:18:36,564 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 8 [2024-11-12 13:18:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:18:36,564 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2024-11-12 13:18:36,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 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-11-12 13:18:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2024-11-12 13:18:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:18:36,564 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:18:36,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:18:36,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:18:36,565 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-12 13:18:36,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:18:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash 852100496, now seen corresponding path program 1 times [2024-11-12 13:18:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:18:36,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345784313] [2024-11-12 13:18:36,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:18:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:18:36,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:18:37,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345784313] [2024-11-12 13:18:37,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345784313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:18:37,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:18:37,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:18:37,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279064162] [2024-11-12 13:18:37,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:18:37,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:18:37,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:18:37,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:18:37,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:18:37,001 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:18:37,141 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-11-12 13:18:37,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:18:37,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 13:18:37,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:18:37,142 INFO L225 Difference]: With dead ends: 21 [2024-11-12 13:18:37,143 INFO L226 Difference]: Without dead ends: 21 [2024-11-12 13:18:37,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-12 13:18:37,144 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:18:37,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 22 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:18:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-12 13:18:37,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-12 13:18:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-12 13:18:37,148 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 11 [2024-11-12 13:18:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:18:37,148 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-12 13:18:37,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-12 13:18:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:18:37,149 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:18:37,149 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:18:37,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:18:37,150 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-12 13:18:37,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:18:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1468665257, now seen corresponding path program 1 times [2024-11-12 13:18:37,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:18:37,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172233938] [2024-11-12 13:18:37,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:18:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:18:37,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:18:37,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172233938] [2024-11-12 13:18:37,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172233938] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:18:37,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541658634] [2024-11-12 13:18:37,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:37,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:18:37,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:18:37,552 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-11-12 13:18:37,554 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-11-12 13:18:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:37,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 13:18:37,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:18:37,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-12 13:18:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:18:37,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:18:37,893 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2024-11-12 13:18:37,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-12 13:18:37,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:18:37,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541658634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:18:37,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:18:37,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2024-11-12 13:18:37,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793702898] [2024-11-12 13:18:37,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:18:37,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 13:18:37,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:18:37,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 13:18:37,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:18:37,918 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:18:38,454 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2024-11-12 13:18:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:18:38,455 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-12 13:18:38,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:18:38,456 INFO L225 Difference]: With dead ends: 26 [2024-11-12 13:18:38,456 INFO L226 Difference]: Without dead ends: 26 [2024-11-12 13:18:38,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2024-11-12 13:18:38,457 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:18:38,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 84 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:18:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-12 13:18:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-12 13:18:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 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-11-12 13:18:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-11-12 13:18:38,460 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2024-11-12 13:18:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:18:38,460 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-11-12 13:18:38,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:38,461 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-11-12 13:18:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:18:38,461 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:18:38,461 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:18:38,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 13:18:38,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:18:38,666 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-12 13:18:38,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:18:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1163463125, now seen corresponding path program 1 times [2024-11-12 13:18:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:18:38,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847282403] [2024-11-12 13:18:38,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:18:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:18:38,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:18:38,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847282403] [2024-11-12 13:18:38,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847282403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:18:38,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831259068] [2024-11-12 13:18:38,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:38,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:18:38,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:18:38,743 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-11-12 13:18:38,744 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-11-12 13:18:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:38,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 13:18:38,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:18:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-12 13:18:38,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:18:38,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831259068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:18:38,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 13:18:38,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-12 13:18:38,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626159112] [2024-11-12 13:18:38,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:18:38,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:18:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:18:38,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:18:38,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:18:38,829 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:38,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:18:38,861 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2024-11-12 13:18:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:18:38,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-12 13:18:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:18:38,862 INFO L225 Difference]: With dead ends: 25 [2024-11-12 13:18:38,862 INFO L226 Difference]: Without dead ends: 25 [2024-11-12 13:18:38,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:18:38,863 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:18:38,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:18:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-12 13:18:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-12 13:18:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-11-12 13:18:38,866 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 19 [2024-11-12 13:18:38,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:18:38,866 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-11-12 13:18:38,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-11-12 13:18:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:18:38,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:18:38,867 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:18:38,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 13:18:39,071 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,SelfDestructingSolverStorable9 [2024-11-12 13:18:39,072 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2024-11-12 13:18:39,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:18:39,073 INFO L85 PathProgramCache]: Analyzing trace with hash 248502555, now seen corresponding path program 1 times [2024-11-12 13:18:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:18:39,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086793506] [2024-11-12 13:18:39,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:39,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:18:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-12 13:18:39,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:18:39,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086793506] [2024-11-12 13:18:39,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086793506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:18:39,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724436921] [2024-11-12 13:18:39,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:18:39,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:18:39,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:18:39,567 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-11-12 13:18:39,568 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-11-12 13:18:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:18:39,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 13:18:39,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:18:39,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-12 13:18:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:18:39,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:18:40,017 INFO L349 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2024-11-12 13:18:40,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-12 13:18:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:18:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724436921] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:18:40,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:18:40,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 30 [2024-11-12 13:18:40,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801562283] [2024-11-12 13:18:40,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:18:40,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-12 13:18:40,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:18:40,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-12 13:18:40,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2024-11-12 13:18:40,032 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:18:40,859 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2024-11-12 13:18:40,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-12 13:18:40,859 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-12 13:18:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:18:40,862 INFO L225 Difference]: With dead ends: 34 [2024-11-12 13:18:40,862 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 13:18:40,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=589, Invalid=2491, Unknown=0, NotChecked=0, Total=3080 [2024-11-12 13:18:40,864 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:18:40,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:18:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 13:18:40,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 13:18:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 13:18:40,865 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2024-11-12 13:18:40,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:18:40,865 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 13:18:40,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:18:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 13:18:40,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 13:18:40,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 10 remaining) [2024-11-12 13:18:40,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2024-11-12 13:18:40,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2024-11-12 13:18:40,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2024-11-12 13:18:40,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2024-11-12 13:18:40,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2024-11-12 13:18:40,870 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 10 remaining) [2024-11-12 13:18:40,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2024-11-12 13:18:40,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (1 of 10 remaining) [2024-11-12 13:18:40,871 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2024-11-12 13:18:40,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 13:18:41,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:18:41,079 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:18:41,080 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 13:18:41,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:18:41 BoogieIcfgContainer [2024-11-12 13:18:41,082 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 13:18:41,083 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 13:18:41,083 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 13:18:41,083 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 13:18:41,083 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:18:34" (3/4) ... [2024-11-12 13:18:41,085 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 13:18:41,091 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-12 13:18:41,091 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-12 13:18:41,091 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 13:18:41,092 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 13:18:41,175 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 13:18:41,176 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 13:18:41,176 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 13:18:41,177 INFO L158 Benchmark]: Toolchain (without parser) took 7105.23ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 88.2MB in the beginning and 57.6MB in the end (delta: 30.6MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2024-11-12 13:18:41,180 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory was 84.5MB in the beginning and 84.4MB in the end (delta: 59.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:18:41,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.51ms. Allocated memory is still 155.2MB. Free memory was 88.1MB in the beginning and 117.2MB in the end (delta: -29.2MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-11-12 13:18:41,180 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.09ms. Allocated memory is still 155.2MB. Free memory was 117.2MB in the beginning and 115.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:18:41,181 INFO L158 Benchmark]: Boogie Preprocessor took 63.34ms. Allocated memory is still 155.2MB. Free memory was 115.7MB in the beginning and 113.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:18:41,181 INFO L158 Benchmark]: RCFGBuilder took 330.18ms. Allocated memory is still 155.2MB. Free memory was 113.7MB in the beginning and 100.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 13:18:41,181 INFO L158 Benchmark]: TraceAbstraction took 6256.14ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 99.7MB in the beginning and 62.3MB in the end (delta: 37.5MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2024-11-12 13:18:41,181 INFO L158 Benchmark]: Witness Printer took 93.63ms. Allocated memory is still 190.8MB. Free memory was 61.8MB in the beginning and 57.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 13:18:41,183 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.16ms. Allocated memory is still 121.6MB. Free memory was 84.5MB in the beginning and 84.4MB in the end (delta: 59.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.51ms. Allocated memory is still 155.2MB. Free memory was 88.1MB in the beginning and 117.2MB in the end (delta: -29.2MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.09ms. Allocated memory is still 155.2MB. Free memory was 117.2MB in the beginning and 115.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.34ms. Allocated memory is still 155.2MB. Free memory was 115.7MB in the beginning and 113.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 330.18ms. Allocated memory is still 155.2MB. Free memory was 113.7MB in the beginning and 100.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6256.14ms. Allocated memory was 155.2MB in the beginning and 190.8MB in the end (delta: 35.7MB). Free memory was 99.7MB in the beginning and 62.3MB in the end (delta: 37.5MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. * Witness Printer took 93.63ms. Allocated memory is still 190.8MB. Free memory was 61.8MB in the beginning and 57.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 16]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 394 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 255 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 709 IncrementalHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 139 mSDtfsCounter, 709 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 1550 SizeOfPredicates, 13 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 43/106 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 - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-12 13:18:41,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE