./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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_cstpncpy-alloca-2.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 ddb0eb207fb72f46b2f9a0f11e334a77be9b4b455314fd1b26a90347e4178746 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:37:25,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:37:25,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:37:25,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:37:25,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:37:25,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:37:25,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:37:25,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:37:25,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:37:25,665 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:37:25,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:37:25,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:37:25,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:37:25,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:37:25,669 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:37:25,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:37:25,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:37:25,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:37:25,672 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:37:25,672 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:37:25,672 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:37:25,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:37:25,673 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:37:25,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:37:25,674 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:37:25,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:37:25,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:37:25,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:37:25,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:37:25,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:37:25,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:37:25,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:37:25,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:37:25,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:37:25,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:37:25,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:37:25,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:37:25,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:37:25,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:37:25,678 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 -> ddb0eb207fb72f46b2f9a0f11e334a77be9b4b455314fd1b26a90347e4178746 [2024-11-09 07:37:25,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:37:25,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:37:25,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:37:25,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:37:25,951 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:37:25,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i [2024-11-09 07:37:27,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:37:27,621 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:37:27,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i [2024-11-09 07:37:27,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b15b248/9ef002b652ed4b21a85f477b6e061a6e/FLAGf25454935 [2024-11-09 07:37:27,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b15b248/9ef002b652ed4b21a85f477b6e061a6e [2024-11-09 07:37:27,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:37:27,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:37:27,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:37:27,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:37:27,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:37:27,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:37:27" (1/1) ... [2024-11-09 07:37:27,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ede000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:27, skipping insertion in model container [2024-11-09 07:37:27,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:37:27" (1/1) ... [2024-11-09 07:37:27,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:37:28,032 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-09 07:37:28,033 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-09 07:37:28,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:37:28,046 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:37:28,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:37:28,121 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:37:28,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28 WrapperNode [2024-11-09 07:37:28,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:37:28,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:37:28,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:37:28,123 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:37:28,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28" (1/1) ... [2024-11-09 07:37:28,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28" (1/1) ... [2024-11-09 07:37:28,161 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2024-11-09 07:37:28,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:37:28,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:37:28,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:37:28,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:37:28,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28" (1/1) ... [2024-11-09 07:37:28,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28" (1/1) ... [2024-11-09 07:37:28,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28" (1/1) ... [2024-11-09 07:37:28,199 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 [2, 1]. [2024-11-09 07:37:28,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28" (1/1) ... [2024-11-09 07:37:28,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28" (1/1) ... [2024-11-09 07:37:28,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28" (1/1) ... [2024-11-09 07:37:28,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28" (1/1) ... [2024-11-09 07:37:28,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28" (1/1) ... [2024-11-09 07:37:28,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28" (1/1) ... [2024-11-09 07:37:28,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:37:28,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:37:28,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:37:28,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:37:28,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28" (1/1) ... [2024-11-09 07:37:28,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:37:28,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:28,257 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-09 07:37:28,263 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-09 07:37:28,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:37:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:37:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:37:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:37:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:37:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:37:28,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:37:28,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:37:28,409 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:37:28,411 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:37:28,579 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-09 07:37:28,582 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:37:28,593 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:37:28,594 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 07:37:28,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:37:28 BoogieIcfgContainer [2024-11-09 07:37:28,594 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:37:28,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:37:28,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:37:28,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:37:28,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:37:27" (1/3) ... [2024-11-09 07:37:28,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e0e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:37:28, skipping insertion in model container [2024-11-09 07:37:28,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:37:28" (2/3) ... [2024-11-09 07:37:28,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e0e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:37:28, skipping insertion in model container [2024-11-09 07:37:28,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:37:28" (3/3) ... [2024-11-09 07:37:28,601 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-2.i [2024-11-09 07:37:28,614 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:37:28,615 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-09 07:37:28,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:37:28,665 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;@82d1546, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:37:28,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-09 07:37:28,669 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-09 07:37:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:37:28,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:28,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:37:28,675 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-09 07:37:28,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2024-11-09 07:37:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:28,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772823589] [2024-11-09 07:37:28,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:28,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:28,919 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-09 07:37:28,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:28,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772823589] [2024-11-09 07:37:28,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772823589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:28,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:28,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:37:28,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579704612] [2024-11-09 07:37:28,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:28,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:37:28,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:28,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:37:28,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:37:28,964 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-09 07:37:29,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:29,015 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-09 07:37:29,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:37:29,017 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-09 07:37:29,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:29,023 INFO L225 Difference]: With dead ends: 31 [2024-11-09 07:37:29,023 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 07:37:29,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:37:29,027 INFO L432 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-09 07:37:29,027 INFO L433 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-09 07:37:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 07:37:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 07:37:29,061 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-09 07:37:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-09 07:37:29,064 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 6 [2024-11-09 07:37:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:29,064 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-09 07:37:29,064 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-09 07:37:29,064 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-09 07:37:29,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:37:29,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:29,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:37:29,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:37:29,065 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-09 07:37:29,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:29,066 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2024-11-09 07:37:29,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:29,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037301043] [2024-11-09 07:37:29,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:29,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:29,393 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-09 07:37:29,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:29,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037301043] [2024-11-09 07:37:29,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037301043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:29,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:29,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:37:29,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684423225] [2024-11-09 07:37:29,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:29,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:37:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:29,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:37:29,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:37:29,401 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-09 07:37:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:29,442 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-09 07:37:29,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:37:29,443 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-09 07:37:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:29,445 INFO L225 Difference]: With dead ends: 32 [2024-11-09 07:37:29,446 INFO L226 Difference]: Without dead ends: 32 [2024-11-09 07:37:29,446 INFO L431 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-09 07:37:29,447 INFO L432 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-09 07:37:29,449 INFO L433 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-09 07:37:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-09 07:37:29,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 07:37:29,453 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-09 07:37:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-09 07:37:29,455 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 6 [2024-11-09 07:37:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:29,456 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-09 07:37:29,456 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-09 07:37:29,456 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-09 07:37:29,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 07:37:29,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:29,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 07:37:29,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:37:29,457 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-09 07:37:29,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash 889570314, now seen corresponding path program 1 times [2024-11-09 07:37:29,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:29,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442300053] [2024-11-09 07:37:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:29,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:29,678 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-09 07:37:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:29,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442300053] [2024-11-09 07:37:29,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442300053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:29,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:29,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:37:29,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693536636] [2024-11-09 07:37:29,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:29,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:37:29,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:29,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:37:29,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:37:29,683 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-09 07:37:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:29,722 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2024-11-09 07:37:29,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:37:29,723 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-09 07:37:29,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:29,724 INFO L225 Difference]: With dead ends: 31 [2024-11-09 07:37:29,724 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 07:37:29,724 INFO L431 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-09 07:37:29,725 INFO L432 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-09 07:37:29,726 INFO L433 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-09 07:37:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 07:37:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-11-09 07:37:29,731 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-09 07:37:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-09 07:37:29,732 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 6 [2024-11-09 07:37:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:29,732 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-09 07:37:29,735 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-09 07:37:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-09 07:37:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:37:29,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:29,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:29,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:37:29,736 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-09 07:37:29,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:29,737 INFO L85 PathProgramCache]: Analyzing trace with hash 624631599, now seen corresponding path program 1 times [2024-11-09 07:37:29,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:29,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306761461] [2024-11-09 07:37:29,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:29,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:29,899 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-09 07:37:29,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:29,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306761461] [2024-11-09 07:37:29,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306761461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:29,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:29,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:37:29,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931073484] [2024-11-09 07:37:29,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:29,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:37:29,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:29,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:37:29,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:37:29,902 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-09 07:37:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:29,982 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-11-09 07:37:29,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:37:29,982 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-09 07:37:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:29,983 INFO L225 Difference]: With dead ends: 29 [2024-11-09 07:37:29,983 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 07:37:29,984 INFO L431 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-09 07:37:29,985 INFO L432 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-09 07:37:29,985 INFO L433 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-09 07:37:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 07:37:29,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-09 07:37:29,988 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-09 07:37:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-09 07:37:29,989 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 10 [2024-11-09 07:37:29,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:29,989 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-09 07:37:29,989 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-09 07:37:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-09 07:37:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 07:37:29,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:29,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:29,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:37:29,990 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-09 07:37:29,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:29,991 INFO L85 PathProgramCache]: Analyzing trace with hash 624631600, now seen corresponding path program 1 times [2024-11-09 07:37:29,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:29,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816368249] [2024-11-09 07:37:29,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:29,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:30,237 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-09 07:37:30,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:30,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816368249] [2024-11-09 07:37:30,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816368249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:30,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:30,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:37:30,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372460539] [2024-11-09 07:37:30,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:30,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:37:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:30,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:37:30,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:37:30,243 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-09 07:37:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:30,315 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-09 07:37:30,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:37:30,316 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-09 07:37:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:30,317 INFO L225 Difference]: With dead ends: 31 [2024-11-09 07:37:30,317 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 07:37:30,317 INFO L431 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-09 07:37:30,318 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-09 07:37:30,318 INFO L433 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-09 07:37:30,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 07:37:30,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-09 07:37:30,321 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-09 07:37:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-09 07:37:30,321 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 10 [2024-11-09 07:37:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:30,321 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-09 07:37:30,322 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-09 07:37:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-09 07:37:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:37:30,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:30,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:30,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:37:30,323 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-09 07:37:30,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:30,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2109904371, now seen corresponding path program 1 times [2024-11-09 07:37:30,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:30,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725406386] [2024-11-09 07:37:30,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:30,387 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-09 07:37:30,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:30,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725406386] [2024-11-09 07:37:30,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725406386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:30,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:30,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:37:30,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074148870] [2024-11-09 07:37:30,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:30,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:37:30,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:30,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:37:30,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:37:30,391 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-09 07:37:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:30,416 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-09 07:37:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:37:30,417 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-09 07:37:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:30,419 INFO L225 Difference]: With dead ends: 41 [2024-11-09 07:37:30,419 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 07:37:30,419 INFO L431 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-09 07:37:30,420 INFO L432 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-09 07:37:30,420 INFO L433 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-09 07:37:30,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 07:37:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-11-09 07:37:30,427 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-09 07:37:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-09 07:37:30,427 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2024-11-09 07:37:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:30,429 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-09 07:37:30,429 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-09 07:37:30,430 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-09 07:37:30,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:37:30,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:30,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:30,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:37:30,430 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-09 07:37:30,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:30,431 INFO L85 PathProgramCache]: Analyzing trace with hash -2111256910, now seen corresponding path program 1 times [2024-11-09 07:37:30,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:30,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19249423] [2024-11-09 07:37:30,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:30,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:30,707 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-09 07:37:30,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:30,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19249423] [2024-11-09 07:37:30,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19249423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:30,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:30,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:37:30,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290993757] [2024-11-09 07:37:30,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:30,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:37:30,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:30,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:37:30,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:37:30,711 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-09 07:37:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:30,803 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-11-09 07:37:30,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:37:30,803 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-09 07:37:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:30,804 INFO L225 Difference]: With dead ends: 36 [2024-11-09 07:37:30,804 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 07:37:30,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:37:30,805 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:30,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 113 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:37:30,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 07:37:30,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 07:37:30,808 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-09 07:37:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-09 07:37:30,808 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2024-11-09 07:37:30,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:30,808 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-09 07:37:30,809 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-09 07:37:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-09 07:37:30,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:37:30,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:30,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:30,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:37:30,809 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-09 07:37:30,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:30,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2111256911, now seen corresponding path program 1 times [2024-11-09 07:37:30,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:30,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084323053] [2024-11-09 07:37:30,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:30,930 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-09 07:37:30,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:30,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084323053] [2024-11-09 07:37:30,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084323053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:30,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:30,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:37:30,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859288835] [2024-11-09 07:37:30,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:30,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:37:30,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:30,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:37:30,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:37:30,933 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-09 07:37:31,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:31,002 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-11-09 07:37:31,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:37:31,003 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-09 07:37:31,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:31,005 INFO L225 Difference]: With dead ends: 35 [2024-11-09 07:37:31,005 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 07:37:31,005 INFO L431 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-09 07:37:31,006 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:31,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 54 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:31,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 07:37:31,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 07:37:31,010 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-09 07:37:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-09 07:37:31,013 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 11 [2024-11-09 07:37:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:31,013 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-09 07:37:31,013 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-09 07:37:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-09 07:37:31,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:37:31,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:31,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:31,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:37:31,016 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-09 07:37:31,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1375716299, now seen corresponding path program 1 times [2024-11-09 07:37:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467096190] [2024-11-09 07:37:31,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:31,086 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-09 07:37:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467096190] [2024-11-09 07:37:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467096190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:31,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:31,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:37:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195510810] [2024-11-09 07:37:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:31,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:37:31,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:31,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:37:31,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:37:31,088 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-09 07:37:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:31,113 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-09 07:37:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:37:31,113 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-09 07:37:31,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:31,114 INFO L225 Difference]: With dead ends: 40 [2024-11-09 07:37:31,114 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 07:37:31,114 INFO L431 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-09 07:37:31,115 INFO L432 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-09 07:37:31,115 INFO L433 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-09 07:37:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 07:37:31,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2024-11-09 07:37:31,122 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-09 07:37:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-09 07:37:31,126 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 11 [2024-11-09 07:37:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:31,126 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-09 07:37:31,126 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-09 07:37:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-09 07:37:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:37:31,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:31,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:31,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:37:31,128 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-09 07:37:31,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:31,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1374363760, now seen corresponding path program 1 times [2024-11-09 07:37:31,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:31,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545976751] [2024-11-09 07:37:31,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:31,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:31,347 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-09 07:37:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:31,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545976751] [2024-11-09 07:37:31,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545976751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:31,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:31,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:37:31,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207724613] [2024-11-09 07:37:31,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:31,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:37:31,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:31,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:37:31,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:37:31,350 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-09 07:37:31,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:31,406 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-09 07:37:31,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:37:31,407 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-09 07:37:31,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:31,409 INFO L225 Difference]: With dead ends: 36 [2024-11-09 07:37:31,410 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 07:37:31,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:37:31,411 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:31,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 100 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:37:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 07:37:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2024-11-09 07:37:31,418 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-09 07:37:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-09 07:37:31,418 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2024-11-09 07:37:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:31,418 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-09 07:37:31,419 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-09 07:37:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 07:37:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:37:31,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:31,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:31,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:37:31,419 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-09 07:37:31,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash 504787832, now seen corresponding path program 1 times [2024-11-09 07:37:31,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:31,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809437148] [2024-11-09 07:37:31,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:31,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:31,528 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-09 07:37:31,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:31,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809437148] [2024-11-09 07:37:31,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809437148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:31,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:31,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:37:31,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728118022] [2024-11-09 07:37:31,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:31,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:37:31,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:31,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:37:31,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:37:31,531 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-09 07:37:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:31,556 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-09 07:37:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:37:31,557 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-09 07:37:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:31,558 INFO L225 Difference]: With dead ends: 40 [2024-11-09 07:37:31,558 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 07:37:31,558 INFO L431 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-09 07:37:31,559 INFO L432 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-09 07:37:31,559 INFO L433 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-09 07:37:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 07:37:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-09 07:37:31,561 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-09 07:37:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-09 07:37:31,562 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 15 [2024-11-09 07:37:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:31,562 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-09 07:37:31,562 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-09 07:37:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-09 07:37:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:37:31,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:31,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:31,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:37:31,563 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-09 07:37:31,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash 762953270, now seen corresponding path program 1 times [2024-11-09 07:37:31,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:31,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211879203] [2024-11-09 07:37:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:31,924 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-09 07:37:31,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:31,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211879203] [2024-11-09 07:37:31,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211879203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:31,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:31,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:37:31,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174111850] [2024-11-09 07:37:31,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:31,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:37:31,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:31,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:37:31,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:37:31,926 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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-09 07:37:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:32,053 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-11-09 07:37:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:37:32,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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-09 07:37:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:32,058 INFO L225 Difference]: With dead ends: 44 [2024-11-09 07:37:32,058 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 07:37:32,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:37:32,059 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:32,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:37:32,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 07:37:32,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-11-09 07:37:32,062 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-09 07:37:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-09 07:37:32,062 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 15 [2024-11-09 07:37:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:32,062 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-09 07:37:32,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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-09 07:37:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-09 07:37:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:37:32,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:32,063 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:32,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:37:32,066 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-09 07:37:32,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash 762953269, now seen corresponding path program 1 times [2024-11-09 07:37:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:32,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722718612] [2024-11-09 07:37:32,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:32,129 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-09 07:37:32,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:32,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722718612] [2024-11-09 07:37:32,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722718612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:32,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:32,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:37:32,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044616699] [2024-11-09 07:37:32,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:32,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:37:32,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:32,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:37:32,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:37:32,130 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-09 07:37:32,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:32,181 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-11-09 07:37:32,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:37:32,181 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-09 07:37:32,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:32,182 INFO L225 Difference]: With dead ends: 42 [2024-11-09 07:37:32,182 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 07:37:32,182 INFO L431 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-09 07:37:32,183 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:32,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 58 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:37:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 07:37:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-09 07:37:32,188 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-09 07:37:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-11-09 07:37:32,189 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 15 [2024-11-09 07:37:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:32,189 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-11-09 07:37:32,189 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-09 07:37:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-11-09 07:37:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:37:32,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:32,190 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:32,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:37:32,190 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-09 07:37:32,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:32,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1514362387, now seen corresponding path program 1 times [2024-11-09 07:37:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:32,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551888656] [2024-11-09 07:37:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:32,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:32,295 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-09 07:37:32,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:32,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551888656] [2024-11-09 07:37:32,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551888656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:32,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:32,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:37:32,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221528397] [2024-11-09 07:37:32,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:32,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:37:32,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:32,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:37:32,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:37:32,297 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-09 07:37:32,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:32,329 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2024-11-09 07:37:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:37:32,329 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-09 07:37:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:32,330 INFO L225 Difference]: With dead ends: 44 [2024-11-09 07:37:32,330 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 07:37:32,330 INFO L431 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-09 07:37:32,331 INFO L432 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-09 07:37:32,331 INFO L433 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-09 07:37:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 07:37:32,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-09 07:37:32,333 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-09 07:37:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-09 07:37:32,333 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 16 [2024-11-09 07:37:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:32,333 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-09 07:37:32,333 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-09 07:37:32,334 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-09 07:37:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:37:32,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:32,334 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:32,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:37:32,334 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-09 07:37:32,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:32,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2101168401, now seen corresponding path program 1 times [2024-11-09 07:37:32,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:32,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919814857] [2024-11-09 07:37:32,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:32,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:32,528 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-09 07:37:32,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:32,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919814857] [2024-11-09 07:37:32,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919814857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:32,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:32,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:37:32,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249985686] [2024-11-09 07:37:32,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:32,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:37:32,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:32,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:37:32,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:37:32,531 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-09 07:37:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:32,578 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2024-11-09 07:37:32,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:37:32,578 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-09 07:37:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:32,579 INFO L225 Difference]: With dead ends: 61 [2024-11-09 07:37:32,579 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 07:37:32,579 INFO L431 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-09 07:37:32,581 INFO L432 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-09 07:37:32,582 INFO L433 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-09 07:37:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 07:37:32,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-09 07:37:32,587 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-09 07:37:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2024-11-09 07:37:32,587 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 16 [2024-11-09 07:37:32,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:32,588 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2024-11-09 07:37:32,588 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-09 07:37:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-11-09 07:37:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:37:32,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:32,589 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:32,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:37:32,590 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-09 07:37:32,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:32,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1182681645, now seen corresponding path program 1 times [2024-11-09 07:37:32,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:32,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69803944] [2024-11-09 07:37:32,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:32,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:32,940 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-09 07:37:32,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:32,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69803944] [2024-11-09 07:37:32,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69803944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:37:32,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694567085] [2024-11-09 07:37:32,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:32,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:37:32,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:32,945 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-09 07:37:32,946 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-09 07:37:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:33,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:37:33,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:37:33,129 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-09 07:37:33,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:37:33,393 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-09 07:37:33,498 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-09 07:37:33,498 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:37:33,857 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-09 07:37:33,865 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-09 07:37:33,871 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-09 07:37:33,880 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-09 07:37:33,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694567085] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:37:33,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:37:33,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-11-09 07:37:33,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054986563] [2024-11-09 07:37:33,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:37:33,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 07:37:33,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:33,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 07:37:33,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:37:33,883 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-09 07:37:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:34,166 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2024-11-09 07:37:34,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:37:34,167 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-09 07:37:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:34,167 INFO L225 Difference]: With dead ends: 66 [2024-11-09 07:37:34,167 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 07:37:34,168 INFO L431 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-09 07:37:34,168 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:34,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 211 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:37:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 07:37:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-11-09 07:37:34,174 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-09 07:37:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2024-11-09 07:37:34,175 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 16 [2024-11-09 07:37:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:34,175 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2024-11-09 07:37:34,175 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-09 07:37:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2024-11-09 07:37:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:37:34,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:34,176 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:34,196 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-09 07:37:34,376 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-09 07:37:34,377 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-09 07:37:34,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:34,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1991574699, now seen corresponding path program 1 times [2024-11-09 07:37:34,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:34,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103945731] [2024-11-09 07:37:34,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:34,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:35,140 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-09 07:37:35,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:35,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103945731] [2024-11-09 07:37:35,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103945731] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:37:35,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225906995] [2024-11-09 07:37:35,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:35,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:37:35,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:35,142 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-09 07:37:35,144 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-09 07:37:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:35,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 07:37:35,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:37:35,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:37:35,300 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-09 07:37:35,303 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-09 07:37:35,658 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-09 07:37:35,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:37:36,053 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:37:36,162 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-09 07:37:36,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225906995] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:37:36,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:37:36,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2024-11-09 07:37:36,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996179579] [2024-11-09 07:37:36,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:37:36,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 07:37:36,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:36,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 07:37:36,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 07:37:36,164 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 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-09 07:37:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:36,623 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2024-11-09 07:37:36,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:37:36,624 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 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-09 07:37:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:36,624 INFO L225 Difference]: With dead ends: 66 [2024-11-09 07:37:36,624 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 07:37:36,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 07:37:36,625 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:36,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 186 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:37:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 07:37:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-09 07:37:36,628 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-09 07:37:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2024-11-09 07:37:36,628 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 17 [2024-11-09 07:37:36,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:36,629 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2024-11-09 07:37:36,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 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-09 07:37:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2024-11-09 07:37:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:37:36,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:36,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:36,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:37:36,834 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-09 07:37:36,835 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-09 07:37:36,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:36,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1452497020, now seen corresponding path program 1 times [2024-11-09 07:37:36,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:36,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658267010] [2024-11-09 07:37:36,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:36,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:36,939 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-09 07:37:36,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:36,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658267010] [2024-11-09 07:37:36,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658267010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:37:36,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:37:36,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:37:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890861101] [2024-11-09 07:37:36,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:37:36,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:37:36,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:36,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:37:36,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:37:36,941 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-09 07:37:36,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:36,956 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2024-11-09 07:37:36,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:37:36,956 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-09 07:37:36,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:36,957 INFO L225 Difference]: With dead ends: 65 [2024-11-09 07:37:36,957 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 07:37:36,957 INFO L431 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-09 07:37:36,958 INFO L432 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-09 07:37:36,958 INFO L433 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-09 07:37:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 07:37:36,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 07:37:36,959 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-09 07:37:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-09 07:37:36,960 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 18 [2024-11-09 07:37:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:36,960 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-09 07:37:36,960 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-09 07:37:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-09 07:37:36,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:37:36,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:36,961 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:36,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:37:36,961 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-09 07:37:36,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:36,962 INFO L85 PathProgramCache]: Analyzing trace with hash 173916439, now seen corresponding path program 1 times [2024-11-09 07:37:36,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:36,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898027394] [2024-11-09 07:37:36,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:36,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:37,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:37,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898027394] [2024-11-09 07:37:37,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898027394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:37:37,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053785394] [2024-11-09 07:37:37,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:37,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:37:37,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:37,519 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-09 07:37:37,521 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-09 07:37:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:37,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 07:37:37,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:37:37,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:37:37,638 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-09 07:37:37,641 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-09 07:37:38,046 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-09 07:37:38,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:37:38,668 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-09 07:37:38,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053785394] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:37:38,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:37:38,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2024-11-09 07:37:38,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83679226] [2024-11-09 07:37:38,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:37:38,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 07:37:38,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:38,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 07:37:38,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 07:37:38,673 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 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-09 07:37:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:39,814 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-09 07:37:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 07:37:39,815 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 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 18 [2024-11-09 07:37:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:39,815 INFO L225 Difference]: With dead ends: 59 [2024-11-09 07:37:39,815 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 07:37:39,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 07:37:39,817 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:39,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 151 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:37:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 07:37:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-09 07:37:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 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-09 07:37:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-09 07:37:39,819 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 18 [2024-11-09 07:37:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:39,819 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-09 07:37:39,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 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-09 07:37:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-09 07:37:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:37:39,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:39,820 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:39,837 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-09 07:37:40,023 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-09 07:37:40,024 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-09 07:37:40,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:40,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1443389797, now seen corresponding path program 1 times [2024-11-09 07:37:40,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:40,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523181249] [2024-11-09 07:37:40,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:40,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:40,508 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-09 07:37:40,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:40,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523181249] [2024-11-09 07:37:40,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523181249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:37:40,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390420134] [2024-11-09 07:37:40,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:40,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:37:40,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:40,511 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-09 07:37:40,512 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-09 07:37:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:40,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 07:37:40,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:37:40,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:37:40,607 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-09 07:37:40,611 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-09 07:37:41,110 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-09 07:37:41,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:37:41,609 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-09 07:37:41,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390420134] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:37:41,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:37:41,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-11-09 07:37:41,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793441335] [2024-11-09 07:37:41,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:37:41,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 07:37:41,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:41,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 07:37:41,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2024-11-09 07:37:41,611 INFO L87 Difference]: Start difference. First operand 36 states and 39 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-09 07:37:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:42,494 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-09 07:37:42,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 07:37:42,495 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-09 07:37:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:42,495 INFO L225 Difference]: With dead ends: 58 [2024-11-09 07:37:42,495 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 07:37:42,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=261, Invalid=2289, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 07:37:42,497 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 23 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:42,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:37:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 07:37:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2024-11-09 07:37:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 50 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-09 07:37:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2024-11-09 07:37:42,499 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 21 [2024-11-09 07:37:42,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:42,499 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2024-11-09 07:37:42,500 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-09 07:37:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2024-11-09 07:37:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:37:42,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:42,500 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:42,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:37:42,704 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-09 07:37:42,704 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-09 07:37:42,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:42,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1778326742, now seen corresponding path program 2 times [2024-11-09 07:37:42,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:42,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429699114] [2024-11-09 07:37:42,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:42,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:43,302 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-09 07:37:43,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:43,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429699114] [2024-11-09 07:37:43,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429699114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:37:43,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431367040] [2024-11-09 07:37:43,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:37:43,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:37:43,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:43,305 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-09 07:37:43,306 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-09 07:37:43,394 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:37:43,394 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:37:43,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 07:37:43,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:37:43,433 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-09 07:37:43,934 INFO L349 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2024-11-09 07:37:43,935 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-09 07:37:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:44,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:37:44,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 29 treesize of output 25 [2024-11-09 07:37:44,575 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 15 treesize of output 11 [2024-11-09 07:37:44,581 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-09 07:37:44,617 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-09 07:37:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431367040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:37:44,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:37:44,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2024-11-09 07:37:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671552976] [2024-11-09 07:37:44,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:37:44,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:37:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:44,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:37:44,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 07:37:44,620 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 33 states, 32 states have (on average 1.71875) internal successors, (55), 33 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-09 07:37:45,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:45,350 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2024-11-09 07:37:45,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:37:45,350 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.71875) internal successors, (55), 33 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-09 07:37:45,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:45,351 INFO L225 Difference]: With dead ends: 50 [2024-11-09 07:37:45,351 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 07:37:45,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=182, Invalid=1624, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 07:37:45,352 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:45,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 210 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:37:45,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 07:37:45,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-09 07:37:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-09 07:37:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-09 07:37:45,354 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 22 [2024-11-09 07:37:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:45,354 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-09 07:37:45,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.71875) internal successors, (55), 33 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-09 07:37:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-09 07:37:45,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:37:45,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:45,355 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:45,372 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-09 07:37:45,555 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-09 07:37:45,556 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-09 07:37:45,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:45,557 INFO L85 PathProgramCache]: Analyzing trace with hash 706445816, now seen corresponding path program 2 times [2024-11-09 07:37:45,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:45,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273452865] [2024-11-09 07:37:45,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:45,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:46,056 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-09 07:37:46,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:46,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273452865] [2024-11-09 07:37:46,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273452865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:37:46,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528812690] [2024-11-09 07:37:46,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:37:46,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:37:46,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:46,059 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-09 07:37:46,061 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-09 07:37:46,234 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:37:46,235 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:37:46,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 07:37:46,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:37:46,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:37:46,249 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-09 07:37:46,251 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-09 07:37:46,684 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-09 07:37:46,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:37:47,262 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-09 07:37:47,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528812690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:37:47,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:37:47,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2024-11-09 07:37:47,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234364308] [2024-11-09 07:37:47,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:37:47,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 07:37:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:47,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 07:37:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 07:37:47,264 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 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-09 07:37:50,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:50,012 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2024-11-09 07:37:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 07:37:50,012 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 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-09 07:37:50,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:50,013 INFO L225 Difference]: With dead ends: 58 [2024-11-09 07:37:50,013 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 07:37:50,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=282, Invalid=2268, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 07:37:50,014 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:50,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 99 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:37:50,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 07:37:50,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2024-11-09 07:37:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:50,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2024-11-09 07:37:50,017 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 23 [2024-11-09 07:37:50,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:50,017 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-11-09 07:37:50,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 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-09 07:37:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2024-11-09 07:37:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:37:50,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:50,018 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:50,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:37:50,218 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-09 07:37:50,219 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-09 07:37:50,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash 622140914, now seen corresponding path program 1 times [2024-11-09 07:37:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:50,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619387006] [2024-11-09 07:37:50,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:50,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:50,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619387006] [2024-11-09 07:37:50,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619387006] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:37:50,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573638773] [2024-11-09 07:37:50,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:50,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:37:50,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:50,862 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-09 07:37:50,863 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-09 07:37:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:50,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-09 07:37:50,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:37:50,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:37:50,979 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-09 07:37:50,981 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-09 07:37:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:51,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:37:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:52,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573638773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:37:52,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:37:52,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 49 [2024-11-09 07:37:52,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17154076] [2024-11-09 07:37:52,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:37:52,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 07:37:52,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:52,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 07:37:52,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2172, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 07:37:52,278 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 50 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 50 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:37:53,666 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2024-11-09 07:37:53,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-09 07:37:53,667 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 50 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 07:37:53,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:37:53,668 INFO L225 Difference]: With dead ends: 67 [2024-11-09 07:37:53,668 INFO L226 Difference]: Without dead ends: 46 [2024-11-09 07:37:53,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=629, Invalid=4921, Unknown=0, NotChecked=0, Total=5550 [2024-11-09 07:37:53,669 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:37:53,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 272 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:37:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-09 07:37:53,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-09 07:37:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2024-11-09 07:37:53,673 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 30 [2024-11-09 07:37:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:37:53,673 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2024-11-09 07:37:53,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 50 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:37:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2024-11-09 07:37:53,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:37:53,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:37:53,676 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:37:53,691 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-09 07:37:53,876 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-09 07:37:53,877 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-09 07:37:53,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:37:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1933169476, now seen corresponding path program 2 times [2024-11-09 07:37:53,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:37:53,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510536557] [2024-11-09 07:37:53,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:37:53,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:37:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:37:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 17 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:37:55,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:37:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510536557] [2024-11-09 07:37:55,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510536557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:37:55,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079200865] [2024-11-09 07:37:55,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:37:55,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:37:55,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:37:55,071 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-09 07:37:55,072 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-09 07:37:55,197 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:37:55,197 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:37:55,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-09 07:37:55,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:37:55,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:37:55,212 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-09 07:37:55,215 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-09 07:37:55,864 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-09 07:37:55,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:37:56,654 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-09 07:37:56,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079200865] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:37:56,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:37:56,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 16] total 51 [2024-11-09 07:37:56,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304857521] [2024-11-09 07:37:56,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:37:56,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 07:37:56,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:37:56,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 07:37:56,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2437, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 07:37:56,657 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 52 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-09 07:38:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:02,699 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2024-11-09 07:38:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-09 07:38:02,700 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 52 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-09 07:38:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:02,700 INFO L225 Difference]: With dead ends: 91 [2024-11-09 07:38:02,700 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 07:38:02,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2794 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=890, Invalid=10030, Unknown=0, NotChecked=0, Total=10920 [2024-11-09 07:38:02,705 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:02,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 274 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 07:38:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 07:38:02,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 42. [2024-11-09 07:38:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 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-09 07:38:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2024-11-09 07:38:02,709 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2024-11-09 07:38:02,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:02,709 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2024-11-09 07:38:02,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 52 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-09 07:38:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2024-11-09 07:38:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:38:02,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:38:02,712 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:02,726 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-09 07:38:02,912 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-09 07:38:02,913 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-09 07:38:02,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:38:02,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1415368607, now seen corresponding path program 3 times [2024-11-09 07:38:02,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:38:02,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962184788] [2024-11-09 07:38:02,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:38:02,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:38:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:38:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 17 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:04,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:38:04,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962184788] [2024-11-09 07:38:04,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962184788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:38:04,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659996357] [2024-11-09 07:38:04,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:38:04,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:38:04,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:38:04,124 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:38:04,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:38:04,263 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 07:38:04,263 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:38:04,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 130 conjuncts are in the unsatisfiable core [2024-11-09 07:38:04,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:38:04,298 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 07:38:04,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 11 [2024-11-09 07:38:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:05,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:38:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:38:06,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659996357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:38:06,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:38:06,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 18] total 57 [2024-11-09 07:38:06,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909404043] [2024-11-09 07:38:06,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:38:06,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-09 07:38:06,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:38:06,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-09 07:38:06,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3076, Unknown=0, NotChecked=0, Total=3306 [2024-11-09 07:38:06,696 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 58 states, 57 states have (on average 2.017543859649123) internal successors, (115), 58 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:12,743 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-09 07:38:14,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:38:17,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:38:21,718 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-09 07:38:25,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:38:42,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:38:42,614 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2024-11-09 07:38:42,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-09 07:38:42,614 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.017543859649123) internal successors, (115), 58 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-09 07:38:42,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:38:42,615 INFO L225 Difference]: With dead ends: 68 [2024-11-09 07:38:42,615 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 07:38:42,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1928 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=952, Invalid=10176, Unknown=2, NotChecked=0, Total=11130 [2024-11-09 07:38:42,617 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:38:42,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 239 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1005 Invalid, 2 Unknown, 0 Unchecked, 16.1s Time] [2024-11-09 07:38:42,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 07:38:42,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 07:38:42,618 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-09 07:38:42,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 07:38:42,619 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2024-11-09 07:38:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:38:42,619 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 07:38:42,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.017543859649123) internal successors, (115), 58 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:38:42,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 07:38:42,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 07:38:42,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2024-11-09 07:38:42,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2024-11-09 07:38:42,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2024-11-09 07:38:42,623 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2024-11-09 07:38:42,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2024-11-09 07:38:42,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2024-11-09 07:38:42,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2024-11-09 07:38:42,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2024-11-09 07:38:42,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2024-11-09 07:38:42,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 07:38:42,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 07:38:42,832 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:38:42,834 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:38:42,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:38:42 BoogieIcfgContainer [2024-11-09 07:38:42,836 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:38:42,837 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:38:42,837 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:38:42,837 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:38:42,837 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:37:28" (3/4) ... [2024-11-09 07:38:42,839 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:38:42,848 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-09 07:38:42,849 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:38:42,849 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-09 07:38:42,849 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:38:42,942 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:38:42,942 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:38:42,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:38:42,943 INFO L158 Benchmark]: Toolchain (without parser) took 75290.49ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 97.7MB in the beginning and 146.8MB in the end (delta: -49.1MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2024-11-09 07:38:42,943 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:38:42,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.07ms. Allocated memory is still 165.7MB. Free memory was 97.3MB in the beginning and 121.8MB in the end (delta: -24.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 07:38:42,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.81ms. Allocated memory is still 165.7MB. Free memory was 121.8MB in the beginning and 119.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:38:42,943 INFO L158 Benchmark]: Boogie Preprocessor took 52.69ms. Allocated memory is still 165.7MB. Free memory was 119.8MB in the beginning and 117.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:38:42,944 INFO L158 Benchmark]: RCFGBuilder took 378.86ms. Allocated memory is still 165.7MB. Free memory was 117.7MB in the beginning and 103.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 07:38:42,944 INFO L158 Benchmark]: TraceAbstraction took 74240.44ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 102.3MB in the beginning and 151.0MB in the end (delta: -48.7MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2024-11-09 07:38:42,944 INFO L158 Benchmark]: Witness Printer took 105.82ms. Allocated memory is still 239.1MB. Free memory was 151.0MB in the beginning and 146.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:38:42,945 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.20ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.07ms. Allocated memory is still 165.7MB. Free memory was 97.3MB in the beginning and 121.8MB in the end (delta: -24.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.81ms. Allocated memory is still 165.7MB. Free memory was 121.8MB in the beginning and 119.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.69ms. Allocated memory is still 165.7MB. Free memory was 119.8MB in the beginning and 117.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 378.86ms. Allocated memory is still 165.7MB. Free memory was 117.7MB in the beginning and 103.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 74240.44ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 102.3MB in the beginning and 151.0MB in the end (delta: -48.7MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * Witness Printer took 105.82ms. Allocated memory is still 239.1MB. Free memory was 151.0MB in the beginning and 146.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: 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: 74.2s, OverallIterations: 25, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 50.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 20.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 3115 SdHoareTripleChecker+Invalid, 19.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2623 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6047 IncrementalHoareTripleChecker+Invalid, 6227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 492 mSDtfsCounter, 6047 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 857 GetRequests, 258 SyntacticMatches, 4 SemanticMatches, 595 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8198 ImplicationChecksByTransitivity, 40.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=17, InterpolantAutomatonStates: 372, 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, 25 MinimizatonAttempts, 74 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 642 NumberOfCodeBlocks, 642 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 826 ConstructedInterpolants, 20 QuantifiedInterpolants, 12207 SizeOfPredicates, 85 NumberOfNonLiveVariables, 1748 ConjunctsInSsa, 606 ConjunctsInUnsatCore, 43 InterpolantComputations, 16 PerfectInterpolantSequences, 49/553 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-09 07:38:42,993 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