./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/openbsd_cstrncpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash a15d7a8babeb47c5803852aa414fd44c9c2ce5952463596f56bd26c728f7d82b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:15:20,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:15:20,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-12 13:15:20,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:15:20,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:15:20,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:15:20,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:15:20,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:15:20,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:15:20,949 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:15:20,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:15:20,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:15:20,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:15:20,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:15:20,953 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:15:20,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:15:20,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:15:20,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:15:20,954 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:15:20,954 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:15:20,955 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:15:20,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:15:20,955 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:15:20,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:15:20,956 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:15:20,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:15:20,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:15:20,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:15:20,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:15:20,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:15:20,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:15:20,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:15:20,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:15:20,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:15:20,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:15:20,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:15:20,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:15:20,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:15:20,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:15:20,961 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a15d7a8babeb47c5803852aa414fd44c9c2ce5952463596f56bd26c728f7d82b [2024-11-12 13:15:21,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:15:21,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:15:21,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:15:21,238 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:15:21,238 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:15:21,239 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-alloca-1.i [2024-11-12 13:15:22,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:15:23,024 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:15:23,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrncpy-alloca-1.i [2024-11-12 13:15:23,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a872eef4c/38804d0fb31342cc8d3b1dcd6b1126f8/FLAGd4acadcbf [2024-11-12 13:15:23,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a872eef4c/38804d0fb31342cc8d3b1dcd6b1126f8 [2024-11-12 13:15:23,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:15:23,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:15:23,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:15:23,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:15:23,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:15:23,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:15:23" (1/1) ... [2024-11-12 13:15:23,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c96958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:23, skipping insertion in model container [2024-11-12 13:15:23,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:15:23" (1/1) ... [2024-11-12 13:15:23,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:15:23,424 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:15:23,425 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:15:23,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:15:23,437 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:15:23,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:15:23,505 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:15:23,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:23 WrapperNode [2024-11-12 13:15:23,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:15:23,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:15:23,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:15:23,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:15:23,515 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:15:23" (1/1) ... [2024-11-12 13:15:23,526 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:15:23" (1/1) ... [2024-11-12 13:15:23,544 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2024-11-12 13:15:23,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:15:23,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:15:23,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:15:23,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:15:23,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:23" (1/1) ... [2024-11-12 13:15:23,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:23" (1/1) ... [2024-11-12 13:15:23,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:23" (1/1) ... [2024-11-12 13:15:23,573 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [1, 2]. [2024-11-12 13:15:23,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:23" (1/1) ... [2024-11-12 13:15:23,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:23" (1/1) ... [2024-11-12 13:15:23,578 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:23" (1/1) ... [2024-11-12 13:15:23,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:23" (1/1) ... [2024-11-12 13:15:23,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:23" (1/1) ... [2024-11-12 13:15:23,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:23" (1/1) ... [2024-11-12 13:15:23,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:15:23,594 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:15:23,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:15:23,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:15:23,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:23" (1/1) ... [2024-11-12 13:15:23,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:15:23,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:15:23,633 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:15:23,636 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:15:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 13:15:23,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 13:15:23,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:15:23,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 13:15:23,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 13:15:23,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:15:23,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:15:23,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:15:23,805 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:15:23,808 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:15:24,094 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-12 13:15:24,098 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:15:24,112 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:15:24,112 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 13:15:24,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:15:24 BoogieIcfgContainer [2024-11-12 13:15:24,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:15:24,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:15:24,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:15:24,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:15:24,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:15:23" (1/3) ... [2024-11-12 13:15:24,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc2af75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:15:24, skipping insertion in model container [2024-11-12 13:15:24,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:23" (2/3) ... [2024-11-12 13:15:24,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc2af75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:15:24, skipping insertion in model container [2024-11-12 13:15:24,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:15:24" (3/3) ... [2024-11-12 13:15:24,123 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca-1.i [2024-11-12 13:15:24,143 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:15:24,143 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-12 13:15:24,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:15:24,203 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;@6b9d7ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:15:24,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-12 13:15:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:24,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:15:24,216 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:24,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:15:24,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:24,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2024-11-12 13:15:24,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:24,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656469993] [2024-11-12 13:15:24,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:24,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:24,523 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:15:24,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656469993] [2024-11-12 13:15:24,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656469993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:24,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:24,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:15:24,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873531903] [2024-11-12 13:15:24,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:24,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:15:24,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:24,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:15:24,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:15:24,570 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:24,624 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-12 13:15:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:15:24,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-12 13:15:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:24,633 INFO L225 Difference]: With dead ends: 31 [2024-11-12 13:15:24,634 INFO L226 Difference]: Without dead ends: 29 [2024-11-12 13:15:24,635 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:15:24,638 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:24,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:24,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-12 13:15:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-12 13:15:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 28 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:15:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-12 13:15:24,674 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 6 [2024-11-12 13:15:24,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:24,674 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-12 13:15:24,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-12 13:15:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:15:24,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:24,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:15:24,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:15:24,677 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:24,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:24,677 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2024-11-12 13:15:24,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:24,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484706887] [2024-11-12 13:15:24,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:24,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:24,959 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:15:24,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:24,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484706887] [2024-11-12 13:15:24,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484706887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:24,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:24,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:15:24,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042082679] [2024-11-12 13:15:24,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:24,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:15:24,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:24,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:15:24,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:15:24,967 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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:15:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:25,014 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-12 13:15:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:15:25,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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:15:25,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:25,016 INFO L225 Difference]: With dead ends: 32 [2024-11-12 13:15:25,016 INFO L226 Difference]: Without dead ends: 32 [2024-11-12 13:15:25,016 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:15:25,018 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:25,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-12 13:15:25,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-12 13:15:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:15:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-12 13:15:25,026 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 6 [2024-11-12 13:15:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:25,027 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-12 13:15:25,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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:15:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-12 13:15:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-12 13:15:25,028 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:25,028 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-12 13:15:25,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:15:25,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:25,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:25,033 INFO L85 PathProgramCache]: Analyzing trace with hash 889570314, now seen corresponding path program 1 times [2024-11-12 13:15:25,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:25,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125031870] [2024-11-12 13:15:25,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:25,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:25,248 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:15:25,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125031870] [2024-11-12 13:15:25,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125031870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:25,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:25,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:15:25,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289704791] [2024-11-12 13:15:25,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:25,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:15:25,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:25,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:15:25,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:15:25,251 INFO L87 Difference]: Start difference. First operand 32 states and 38 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:15:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:25,287 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-11-12 13:15:25,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:15:25,287 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:15:25,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:25,288 INFO L225 Difference]: With dead ends: 31 [2024-11-12 13:15:25,288 INFO L226 Difference]: Without dead ends: 31 [2024-11-12 13:15:25,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:15:25,290 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:25,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:25,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-12 13:15:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-11-12 13:15:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-12 13:15:25,295 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 6 [2024-11-12 13:15:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:25,296 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-12 13:15:25,297 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:15:25,297 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-12 13:15:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 13:15:25,298 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:25,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:25,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:15:25,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:25,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:25,302 INFO L85 PathProgramCache]: Analyzing trace with hash 624631599, now seen corresponding path program 1 times [2024-11-12 13:15:25,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:25,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391886926] [2024-11-12 13:15:25,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:25,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:25,452 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:15:25,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:25,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391886926] [2024-11-12 13:15:25,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391886926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:25,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:25,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:15:25,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143804817] [2024-11-12 13:15:25,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:25,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:15:25,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:25,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:15:25,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:15:25,457 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:25,549 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-11-12 13:15:25,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:15:25,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-12 13:15:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:25,550 INFO L225 Difference]: With dead ends: 29 [2024-11-12 13:15:25,550 INFO L226 Difference]: Without dead ends: 29 [2024-11-12 13:15:25,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:15:25,552 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:25,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 75 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:15:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-12 13:15:25,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-12 13:15:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-12 13:15:25,555 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 10 [2024-11-12 13:15:25,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:25,556 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-12 13:15:25,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-12 13:15:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 13:15:25,557 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:25,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:25,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:15:25,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:25,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:25,558 INFO L85 PathProgramCache]: Analyzing trace with hash 624631600, now seen corresponding path program 1 times [2024-11-12 13:15:25,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:25,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392451692] [2024-11-12 13:15:25,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:25,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:25,793 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:15:25,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:25,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392451692] [2024-11-12 13:15:25,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392451692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:25,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:25,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:15:25,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645660885] [2024-11-12 13:15:25,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:25,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:15:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:25,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:15:25,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:15:25,796 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:25,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:25,867 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-12 13:15:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:15:25,868 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-12 13:15:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:25,869 INFO L225 Difference]: With dead ends: 31 [2024-11-12 13:15:25,869 INFO L226 Difference]: Without dead ends: 31 [2024-11-12 13:15:25,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:15:25,870 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:25,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 146 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:15:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-12 13:15:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-12 13:15:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 28 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:15:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-12 13:15:25,880 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 10 [2024-11-12 13:15:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:25,881 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-12 13:15:25,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-12 13:15:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:15:25,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:25,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:25,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:15:25,883 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:25,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2109904371, now seen corresponding path program 1 times [2024-11-12 13:15:25,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:25,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535418051] [2024-11-12 13:15:25,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:25,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:25,980 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:15:25,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:25,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535418051] [2024-11-12 13:15:25,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535418051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:25,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:25,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:15:25,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528908994] [2024-11-12 13:15:25,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:25,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:15:25,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:25,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:15:25,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:15:25,982 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:15:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:26,007 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-12 13:15:26,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:15:26,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:15:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:26,009 INFO L225 Difference]: With dead ends: 41 [2024-11-12 13:15:26,009 INFO L226 Difference]: Without dead ends: 41 [2024-11-12 13:15:26,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:15:26,010 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:26,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 76 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-12 13:15:26,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-11-12 13:15:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:15:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-12 13:15:26,018 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2024-11-12 13:15:26,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:26,019 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-12 13:15:26,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:15:26,019 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-12 13:15:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:15:26,019 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:26,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:26,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:15:26,020 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:26,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:26,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2111256910, now seen corresponding path program 1 times [2024-11-12 13:15:26,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:26,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060507312] [2024-11-12 13:15:26,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:26,300 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:15:26,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:26,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060507312] [2024-11-12 13:15:26,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060507312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:26,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:26,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:15:26,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034059978] [2024-11-12 13:15:26,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:26,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:15:26,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:26,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:15:26,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:15:26,302 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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:15:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:26,444 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-11-12 13:15:26,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:15:26,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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:15:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:26,445 INFO L225 Difference]: With dead ends: 52 [2024-11-12 13:15:26,445 INFO L226 Difference]: Without dead ends: 52 [2024-11-12 13:15:26,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:15:26,446 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:26,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 111 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:15:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-12 13:15:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 36. [2024-11-12 13:15:26,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-12 13:15:26,455 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2024-11-12 13:15:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:26,455 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-12 13:15:26,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 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:15:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-12 13:15:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:15:26,456 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:26,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:26,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:15:26,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:26,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:26,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2111256911, now seen corresponding path program 1 times [2024-11-12 13:15:26,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:26,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729185479] [2024-11-12 13:15:26,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:26,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:26,537 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:15:26,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:26,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729185479] [2024-11-12 13:15:26,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729185479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:26,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:26,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:15:26,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255284752] [2024-11-12 13:15:26,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:26,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:15:26,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:15:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:15:26,540 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:15:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:26,600 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-11-12 13:15:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:15:26,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:15:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:26,601 INFO L225 Difference]: With dead ends: 35 [2024-11-12 13:15:26,602 INFO L226 Difference]: Without dead ends: 35 [2024-11-12 13:15:26,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:15:26,604 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:26,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 56 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-12 13:15:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-12 13:15:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-12 13:15:26,611 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 11 [2024-11-12 13:15:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:26,612 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-12 13:15:26,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:15:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-12 13:15:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:15:26,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:26,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:26,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:15:26,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:26,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1375716299, now seen corresponding path program 1 times [2024-11-12 13:15:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:26,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192576959] [2024-11-12 13:15:26,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:26,690 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:15:26,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192576959] [2024-11-12 13:15:26,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192576959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:26,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:26,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:15:26,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045921289] [2024-11-12 13:15:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:26,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:15:26,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:26,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:15:26,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:15:26,692 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:15:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:26,710 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-12 13:15:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:15:26,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:15:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:26,711 INFO L225 Difference]: With dead ends: 40 [2024-11-12 13:15:26,712 INFO L226 Difference]: Without dead ends: 40 [2024-11-12 13:15:26,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:15:26,713 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:26,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-12 13:15:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-11-12 13:15:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-12 13:15:26,716 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 11 [2024-11-12 13:15:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:26,716 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-12 13:15:26,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:15:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-12 13:15:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:15:26,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:26,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:26,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 13:15:26,717 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:26,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:26,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1374363760, now seen corresponding path program 1 times [2024-11-12 13:15:26,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:26,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101042628] [2024-11-12 13:15:26,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:26,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:26,907 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:15:26,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:26,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101042628] [2024-11-12 13:15:26,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101042628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:26,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:26,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 13:15:26,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184467163] [2024-11-12 13:15:26,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:26,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:15:26,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:26,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:15:26,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:15:26,910 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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:15:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:27,003 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-12 13:15:27,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:15:27,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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:15:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:27,004 INFO L225 Difference]: With dead ends: 36 [2024-11-12 13:15:27,005 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 13:15:27,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:15:27,006 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:27,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 90 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:15:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 13:15:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2024-11-12 13:15:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-12 13:15:27,009 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2024-11-12 13:15:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:27,009 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-12 13:15:27,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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:15:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-12 13:15:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:15:27,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:27,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:27,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:15:27,011 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:27,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash 504787832, now seen corresponding path program 1 times [2024-11-12 13:15:27,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:27,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212309446] [2024-11-12 13:15:27,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:27,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:27,118 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:15:27,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:27,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212309446] [2024-11-12 13:15:27,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212309446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:27,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:27,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:15:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537790902] [2024-11-12 13:15:27,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:27,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:15:27,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:27,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:15:27,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:15:27,121 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:27,149 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-12 13:15:27,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:15:27,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 13:15:27,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:27,150 INFO L225 Difference]: With dead ends: 40 [2024-11-12 13:15:27,150 INFO L226 Difference]: Without dead ends: 40 [2024-11-12 13:15:27,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:15:27,151 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:27,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:27,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-12 13:15:27,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-12 13:15:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:15:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-12 13:15:27,154 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 15 [2024-11-12 13:15:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:27,154 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-12 13:15:27,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-12 13:15:27,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:15:27,155 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:27,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:27,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 13:15:27,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:27,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:27,156 INFO L85 PathProgramCache]: Analyzing trace with hash 762953270, now seen corresponding path program 1 times [2024-11-12 13:15:27,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:27,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389218082] [2024-11-12 13:15:27,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:27,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:27,631 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:15:27,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:27,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389218082] [2024-11-12 13:15:27,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389218082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:27,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:27,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 13:15:27,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069786314] [2024-11-12 13:15:27,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:27,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 13:15:27,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:27,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 13:15:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:15:27,634 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:27,822 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-11-12 13:15:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:15:27,823 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 13:15:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:27,825 INFO L225 Difference]: With dead ends: 44 [2024-11-12 13:15:27,826 INFO L226 Difference]: Without dead ends: 44 [2024-11-12 13:15:27,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:15:27,827 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:27,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 101 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:15:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-12 13:15:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-11-12 13:15:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 42 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:15:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-12 13:15:27,831 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 15 [2024-11-12 13:15:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:27,833 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-12 13:15:27,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-12 13:15:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:15:27,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:27,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:27,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 13:15:27,835 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:27,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 762953269, now seen corresponding path program 1 times [2024-11-12 13:15:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:27,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293966443] [2024-11-12 13:15:27,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:27,900 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:15:27,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:27,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293966443] [2024-11-12 13:15:27,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293966443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:27,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:27,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:15:27,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174875793] [2024-11-12 13:15:27,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:27,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:15:27,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:27,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:15:27,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:15:27,903 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:27,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:27,951 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-11-12 13:15:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:15:27,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-12 13:15:27,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:27,952 INFO L225 Difference]: With dead ends: 42 [2024-11-12 13:15:27,952 INFO L226 Difference]: Without dead ends: 42 [2024-11-12 13:15:27,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:15:27,953 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:27,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 60 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:27,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-12 13:15:27,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-12 13:15:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-11-12 13:15:27,959 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 15 [2024-11-12 13:15:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:27,960 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-11-12 13:15:27,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-11-12 13:15:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 13:15:27,961 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:27,961 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:27,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 13:15:27,961 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:27,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:27,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1514362387, now seen corresponding path program 1 times [2024-11-12 13:15:27,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:27,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359770006] [2024-11-12 13:15:27,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:27,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:28,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:28,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359770006] [2024-11-12 13:15:28,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359770006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:28,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:28,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:15:28,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726491433] [2024-11-12 13:15:28,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:28,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:15:28,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:28,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:15:28,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:15:28,056 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 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:15:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:28,076 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-12 13:15:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:15:28,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 13:15:28,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:28,078 INFO L225 Difference]: With dead ends: 44 [2024-11-12 13:15:28,079 INFO L226 Difference]: Without dead ends: 44 [2024-11-12 13:15:28,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:15:28,079 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:28,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 86 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-12 13:15:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-12 13:15:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.275) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:15:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-12 13:15:28,085 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 16 [2024-11-12 13:15:28,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:28,086 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-12 13:15:28,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 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:15:28,086 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-12 13:15:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 13:15:28,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:28,086 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:28,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 13:15:28,086 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:28,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2101168401, now seen corresponding path program 1 times [2024-11-12 13:15:28,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:28,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282802050] [2024-11-12 13:15:28,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:28,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:28,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:28,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282802050] [2024-11-12 13:15:28,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282802050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:28,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:28,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 13:15:28,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581663794] [2024-11-12 13:15:28,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:28,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:15:28,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:28,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:15:28,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:15:28,274 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 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:15:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:28,320 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2024-11-12 13:15:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:15:28,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 13:15:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:28,321 INFO L225 Difference]: With dead ends: 61 [2024-11-12 13:15:28,321 INFO L226 Difference]: Without dead ends: 61 [2024-11-12 13:15:28,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-12 13:15:28,323 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:28,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 137 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-12 13:15:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-12 13:15:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2024-11-12 13:15:28,329 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 16 [2024-11-12 13:15:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:28,329 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2024-11-12 13:15:28,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 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:15:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-11-12 13:15:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 13:15:28,330 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:28,330 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:28,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 13:15:28,330 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:28,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1182681645, now seen corresponding path program 1 times [2024-11-12 13:15:28,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:28,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133551942] [2024-11-12 13:15:28,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:28,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:28,658 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:15:28,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:28,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133551942] [2024-11-12 13:15:28,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133551942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:15:28,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31368289] [2024-11-12 13:15:28,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:28,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:15:28,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:15:28,661 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:15:28,663 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:15:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:28,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 13:15:28,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:15:28,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-12 13:15:29,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:15:29,096 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 20 treesize of output 17 [2024-11-12 13:15:29,195 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:15:29,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:15:29,570 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 15 treesize of output 13 [2024-11-12 13:15:29,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-11-12 13:15:29,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-12 13:15:29,593 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:15:29,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31368289] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:15:29,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:15:29,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-11-12 13:15:29,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914746055] [2024-11-12 13:15:29,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:15:29,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 13:15:29,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:29,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 13:15:29,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-11-12 13:15:29,595 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 23 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:29,887 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2024-11-12 13:15:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:15:29,887 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 13:15:29,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:29,888 INFO L225 Difference]: With dead ends: 66 [2024-11-12 13:15:29,888 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 13:15:29,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2024-11-12 13:15:29,889 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:29,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 226 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:15:29,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 13:15:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-11-12 13:15:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 64 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2024-11-12 13:15:29,892 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 16 [2024-11-12 13:15:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:29,892 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2024-11-12 13:15:29,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2024-11-12 13:15:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-12 13:15:29,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:29,893 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:29,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 13:15:30,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-12 13:15:30,098 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:30,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1991574699, now seen corresponding path program 1 times [2024-11-12 13:15:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:30,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427427770] [2024-11-12 13:15:30,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:30,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:30,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:30,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427427770] [2024-11-12 13:15:30,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427427770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:15:30,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569911477] [2024-11-12 13:15:30,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:30,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:15:30,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:15:30,517 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:15:30,519 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:15:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:30,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-12 13:15:30,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:15:30,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:15:30,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-12 13:15:30,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-12 13:15:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:30,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:15:31,344 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:15:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:31,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569911477] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:15:31,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:15:31,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2024-11-12 13:15:31,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730681262] [2024-11-12 13:15:31,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:15:31,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-12 13:15:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:31,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-12 13:15:31,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2024-11-12 13:15:31,458 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:31,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:31,808 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2024-11-12 13:15:31,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:15:31,809 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-12 13:15:31,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:31,809 INFO L225 Difference]: With dead ends: 66 [2024-11-12 13:15:31,809 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 13:15:31,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 13:15:31,811 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:31,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 167 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:15:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 13:15:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-12 13:15:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:15:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2024-11-12 13:15:31,814 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 17 [2024-11-12 13:15:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:31,814 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2024-11-12 13:15:31,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 32 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2024-11-12 13:15:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:15:31,815 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:31,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:31,832 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:15:32,019 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,SelfDestructingSolverStorable16 [2024-11-12 13:15:32,020 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:32,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:32,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1452497020, now seen corresponding path program 1 times [2024-11-12 13:15:32,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:32,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529199020] [2024-11-12 13:15:32,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:32,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:32,106 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:15:32,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:32,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529199020] [2024-11-12 13:15:32,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529199020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:32,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:32,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:15:32,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360562500] [2024-11-12 13:15:32,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:32,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:15:32,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:32,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:15:32,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:15:32,108 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 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:15:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:32,124 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2024-11-12 13:15:32,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:15:32,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-12 13:15:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:32,125 INFO L225 Difference]: With dead ends: 65 [2024-11-12 13:15:32,125 INFO L226 Difference]: Without dead ends: 41 [2024-11-12 13:15:32,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:15:32,125 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:32,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 42 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-12 13:15:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-12 13:15:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:15:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-12 13:15:32,128 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 18 [2024-11-12 13:15:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:32,128 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-12 13:15:32,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 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:15:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-12 13:15:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:15:32,129 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:32,129 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:32,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 13:15:32,129 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:32,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:32,130 INFO L85 PathProgramCache]: Analyzing trace with hash 173916439, now seen corresponding path program 1 times [2024-11-12 13:15:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:32,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789035113] [2024-11-12 13:15:32,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:32,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:32,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:32,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789035113] [2024-11-12 13:15:32,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789035113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:15:32,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452515199] [2024-11-12 13:15:32,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:32,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:15:32,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:15:32,591 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:15:32,593 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:15:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:32,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-12 13:15:32,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:15:32,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:15:32,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-12 13:15:32,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-12 13:15:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:33,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:15:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:33,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452515199] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:15:33,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:15:33,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-11-12 13:15:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285698771] [2024-11-12 13:15:33,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:15:33,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-12 13:15:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:33,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-12 13:15:33,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2024-11-12 13:15:33,523 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:15:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:35,132 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2024-11-12 13:15:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-12 13:15:35,133 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 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 18 [2024-11-12 13:15:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:35,133 INFO L225 Difference]: With dead ends: 68 [2024-11-12 13:15:35,133 INFO L226 Difference]: Without dead ends: 50 [2024-11-12 13:15:35,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=241, Invalid=1651, Unknown=0, NotChecked=0, Total=1892 [2024-11-12 13:15:35,135 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:35,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 155 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:15:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-12 13:15:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2024-11-12 13:15:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:15:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2024-11-12 13:15:35,137 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2024-11-12 13:15:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:35,137 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2024-11-12 13:15:35,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:15:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2024-11-12 13:15:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:15:35,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:35,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:35,155 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:15:35,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:15:35,343 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:35,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:35,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1443389797, now seen corresponding path program 1 times [2024-11-12 13:15:35,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:35,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91444188] [2024-11-12 13:15:35,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:35,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:35,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91444188] [2024-11-12 13:15:35,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91444188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:15:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424527406] [2024-11-12 13:15:35,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:35,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:15:35,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:15:35,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:15:35,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 13:15:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:35,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-12 13:15:35,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:15:35,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:15:35,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-12 13:15:35,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-12 13:15:36,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:36,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:15:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:36,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424527406] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:15:36,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:15:36,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-11-12 13:15:36,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002994766] [2024-11-12 13:15:36,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:15:36,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-12 13:15:36,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:36,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-12 13:15:36,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2024-11-12 13:15:36,913 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:37,935 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2024-11-12 13:15:37,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 13:15:37,936 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-12 13:15:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:37,937 INFO L225 Difference]: With dead ends: 58 [2024-11-12 13:15:37,937 INFO L226 Difference]: Without dead ends: 55 [2024-11-12 13:15:37,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=219, Invalid=1851, Unknown=0, NotChecked=0, Total=2070 [2024-11-12 13:15:37,938 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:37,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 106 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:15:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-12 13:15:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2024-11-12 13:15:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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:15:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2024-11-12 13:15:37,941 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 21 [2024-11-12 13:15:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:37,941 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2024-11-12 13:15:37,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2024-11-12 13:15:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:15:37,942 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:37,942 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:37,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 13:15:38,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:15:38,146 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:38,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:38,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1778326742, now seen corresponding path program 2 times [2024-11-12 13:15:38,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:38,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015628571] [2024-11-12 13:15:38,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:38,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:38,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:38,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015628571] [2024-11-12 13:15:38,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015628571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:15:38,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651305151] [2024-11-12 13:15:38,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:15:38,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:15:38,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:15:38,669 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:15:38,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 13:15:38,755 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:15:38,756 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:15:38,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-12 13:15:38,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:15:38,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-11-12 13:15:39,753 INFO L349 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2024-11-12 13:15:39,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2024-11-12 13:15:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:39,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:15:40,388 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 29 treesize of output 25 [2024-11-12 13:15:40,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-11-12 13:15:40,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-12 13:15:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:40,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651305151] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:15:40,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:15:40,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2024-11-12 13:15:40,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133470653] [2024-11-12 13:15:40,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:15:40,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-12 13:15:40,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:40,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-12 13:15:40,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=895, Unknown=1, NotChecked=0, Total=992 [2024-11-12 13:15:40,436 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 32 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:15:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:41,045 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2024-11-12 13:15:41,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:15:41,046 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 32 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 22 [2024-11-12 13:15:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:41,046 INFO L225 Difference]: With dead ends: 47 [2024-11-12 13:15:41,046 INFO L226 Difference]: Without dead ends: 47 [2024-11-12 13:15:41,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=168, Invalid=1471, Unknown=1, NotChecked=0, Total=1640 [2024-11-12 13:15:41,049 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:41,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 207 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:15:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-12 13:15:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-12 13:15:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:15:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2024-11-12 13:15:41,051 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 22 [2024-11-12 13:15:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:41,052 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2024-11-12 13:15:41,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 32 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:15:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2024-11-12 13:15:41,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 13:15:41,053 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:41,053 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:41,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 13:15:41,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:15:41,254 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:41,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:41,255 INFO L85 PathProgramCache]: Analyzing trace with hash 706445816, now seen corresponding path program 2 times [2024-11-12 13:15:41,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:41,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230385831] [2024-11-12 13:15:41,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:41,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:41,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230385831] [2024-11-12 13:15:41,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230385831] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:15:41,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329229102] [2024-11-12 13:15:41,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:15:41,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:15:41,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:15:41,682 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:15:41,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 13:15:41,771 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:15:41,771 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:15:41,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-12 13:15:41,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:15:41,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:15:41,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-12 13:15:41,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-12 13:15:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:42,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:15:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:42,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329229102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:15:42,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:15:42,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2024-11-12 13:15:42,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355844761] [2024-11-12 13:15:42,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:15:42,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-12 13:15:42,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:42,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-12 13:15:42,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2024-11-12 13:15:42,748 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:43,340 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2024-11-12 13:15:43,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-12 13:15:43,340 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-12 13:15:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:43,341 INFO L225 Difference]: With dead ends: 48 [2024-11-12 13:15:43,341 INFO L226 Difference]: Without dead ends: 48 [2024-11-12 13:15:43,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=270, Invalid=1892, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 13:15:43,342 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 32 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:43,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:15:43,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-12 13:15:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-11-12 13:15:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2024-11-12 13:15:43,344 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 23 [2024-11-12 13:15:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:43,345 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2024-11-12 13:15:43,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2024-11-12 13:15:43,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:15:43,345 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:43,345 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:43,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 13:15:43,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:15:43,550 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:43,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1907547678, now seen corresponding path program 1 times [2024-11-12 13:15:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842657184] [2024-11-12 13:15:43,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:44,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:44,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842657184] [2024-11-12 13:15:44,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842657184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:15:44,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385497486] [2024-11-12 13:15:44,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:44,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:15:44,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:15:44,295 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:15:44,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 13:15:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:44,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-12 13:15:44,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:15:44,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:15:44,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-12 13:15:44,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-12 13:15:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:44,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:15:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:45,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385497486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:15:45,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:15:45,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 49 [2024-11-12 13:15:45,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74573431] [2024-11-12 13:15:45,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:15:45,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 13:15:45,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:45,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 13:15:45,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2172, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 13:15:45,693 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 50 states, 49 states have (on average 1.816326530612245) internal successors, (89), 50 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:46,622 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2024-11-12 13:15:46,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-12 13:15:46,623 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.816326530612245) internal successors, (89), 50 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-12 13:15:46,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:46,623 INFO L225 Difference]: With dead ends: 58 [2024-11-12 13:15:46,624 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 13:15:46,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=531, Invalid=3891, Unknown=0, NotChecked=0, Total=4422 [2024-11-12 13:15:46,625 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:46,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 347 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:15:46,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 13:15:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-11-12 13:15:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2024-11-12 13:15:46,631 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 33 [2024-11-12 13:15:46,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:46,631 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2024-11-12 13:15:46,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.816326530612245) internal successors, (89), 50 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2024-11-12 13:15:46,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-12 13:15:46,632 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:46,632 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:46,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 13:15:46,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:15:46,833 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:46,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:46,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1933169476, now seen corresponding path program 2 times [2024-11-12 13:15:46,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:46,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204347922] [2024-11-12 13:15:46,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:46,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:47,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:47,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204347922] [2024-11-12 13:15:47,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204347922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:15:47,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69343099] [2024-11-12 13:15:47,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:15:47,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:15:47,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:15:47,601 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:15:47,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 13:15:47,710 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:15:47,711 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:15:47,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-12 13:15:47,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:15:47,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:15:47,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-12 13:15:47,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-12 13:15:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:48,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:15:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:49,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69343099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:15:49,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:15:49,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 47 [2024-11-12 13:15:49,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519285149] [2024-11-12 13:15:49,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:15:49,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-12 13:15:49,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:49,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-12 13:15:49,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2001, Unknown=0, NotChecked=0, Total=2256 [2024-11-12 13:15:49,209 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 48 states, 47 states have (on average 2.276595744680851) internal successors, (107), 48 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:15:53,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 13:15:57,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 13:15:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:58,011 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2024-11-12 13:15:58,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 13:15:58,011 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.276595744680851) internal successors, (107), 48 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-12 13:15:58,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:58,011 INFO L225 Difference]: With dead ends: 49 [2024-11-12 13:15:58,011 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 13:15:58,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=460, Invalid=3446, Unknown=0, NotChecked=0, Total=3906 [2024-11-12 13:15:58,013 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:58,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 297 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 601 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2024-11-12 13:15:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 13:15:58,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 13:15:58,013 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:15:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 13:15:58,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-11-12 13:15:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:58,014 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 13:15:58,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.276595744680851) internal successors, (107), 48 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:15:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 13:15:58,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 13:15:58,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2024-11-12 13:15:58,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2024-11-12 13:15:58,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2024-11-12 13:15:58,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2024-11-12 13:15:58,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2024-11-12 13:15:58,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2024-11-12 13:15:58,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2024-11-12 13:15:58,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2024-11-12 13:15:58,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2024-11-12 13:15:58,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-12 13:15:58,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-12 13:15:58,222 INFO L421 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:58,224 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 13:15:58,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:15:58 BoogieIcfgContainer [2024-11-12 13:15:58,229 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 13:15:58,229 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 13:15:58,230 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 13:15:58,230 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 13:15:58,230 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:15:24" (3/4) ... [2024-11-12 13:15:58,232 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 13:15:58,239 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-12 13:15:58,240 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 13:15:58,240 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-12 13:15:58,240 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 13:15:58,323 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 13:15:58,323 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 13:15:58,323 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 13:15:58,324 INFO L158 Benchmark]: Toolchain (without parser) took 35272.69ms. Allocated memory was 157.3MB in the beginning and 276.8MB in the end (delta: 119.5MB). Free memory was 98.9MB in the beginning and 178.5MB in the end (delta: -79.6MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2024-11-12 13:15:58,324 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 157.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:15:58,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.30ms. Allocated memory is still 157.3MB. Free memory was 98.5MB in the beginning and 80.0MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 13:15:58,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.78ms. Allocated memory is still 157.3MB. Free memory was 80.0MB in the beginning and 77.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:15:58,325 INFO L158 Benchmark]: Boogie Preprocessor took 47.63ms. Allocated memory is still 157.3MB. Free memory was 77.8MB in the beginning and 75.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:15:58,326 INFO L158 Benchmark]: RCFGBuilder took 518.76ms. Allocated memory is still 157.3MB. Free memory was 75.8MB in the beginning and 121.4MB in the end (delta: -45.6MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-12 13:15:58,326 INFO L158 Benchmark]: TraceAbstraction took 34112.85ms. Allocated memory was 157.3MB in the beginning and 276.8MB in the end (delta: 119.5MB). Free memory was 120.6MB in the beginning and 183.4MB in the end (delta: -62.8MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2024-11-12 13:15:58,326 INFO L158 Benchmark]: Witness Printer took 94.02ms. Allocated memory is still 276.8MB. Free memory was 183.4MB in the beginning and 178.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 13:15:58,327 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.24ms. Allocated memory is still 157.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.30ms. Allocated memory is still 157.3MB. Free memory was 98.5MB in the beginning and 80.0MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.78ms. Allocated memory is still 157.3MB. Free memory was 80.0MB in the beginning and 77.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.63ms. Allocated memory is still 157.3MB. Free memory was 77.8MB in the beginning and 75.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 518.76ms. Allocated memory is still 157.3MB. Free memory was 75.8MB in the beginning and 121.4MB in the end (delta: -45.6MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 34112.85ms. Allocated memory was 157.3MB in the beginning and 276.8MB in the end (delta: 119.5MB). Free memory was 120.6MB in the beginning and 183.4MB in the end (delta: -62.8MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. * Witness Printer took 94.02ms. Allocated memory is still 276.8MB. Free memory was 183.4MB in the beginning and 178.5MB in the end (delta: 4.9MB). 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: 563]: 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, 32 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 34.0s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 2972 SdHoareTripleChecker+Invalid, 10.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2490 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4119 IncrementalHoareTripleChecker+Invalid, 4244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 482 mSDtfsCounter, 4119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 218 SyntacticMatches, 5 SemanticMatches, 431 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4079 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=17, InterpolantAutomatonStates: 264, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 63 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 566 NumberOfCodeBlocks, 566 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 715 ConstructedInterpolants, 20 QuantifiedInterpolants, 9465 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1429 ConjunctsInSsa, 476 ConjunctsInUnsatCore, 40 InterpolantComputations, 16 PerfectInterpolantSequences, 39/331 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 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-12 13:15:58,364 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