./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-dietlibc/strcspn.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc 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-dietlibc/strcspn.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 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:33:55,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:33:55,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-19 06:33:55,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:33:55,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:33:55,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:33:55,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:33:55,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:33:55,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:33:55,407 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:33:55,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:33:55,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:33:55,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:33:55,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:33:55,409 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:33:55,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:33:55,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:33:55,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:33:55,410 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:33:55,412 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:33:55,412 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:33:55,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:33:55,415 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:33:55,415 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:33:55,415 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:33:55,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:33:55,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:33:55,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:33:55,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:33:55,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:33:55,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:33:55,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:33:55,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:33:55,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:33:55,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:33:55,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:33:55,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:33:55,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:33:55,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:33:55,418 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 -> 3537cd0bed922b783c5bc2cf1d153661eb68e22062217013fbb7937014c3d604 [2024-11-19 06:33:55,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:33:55,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:33:55,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:33:55,725 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:33:55,725 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:33:55,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strcspn.i [2024-11-19 06:33:57,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:33:57,495 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:33:57,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strcspn.i [2024-11-19 06:33:57,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac791459c/caa65ee459474ecd9e0ecb28d90632b0/FLAGe6382ee47 [2024-11-19 06:33:57,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac791459c/caa65ee459474ecd9e0ecb28d90632b0 [2024-11-19 06:33:57,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:33:57,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:33:57,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:33:57,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:33:57,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:33:57,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:33:57" (1/1) ... [2024-11-19 06:33:57,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b19abf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:57, skipping insertion in model container [2024-11-19 06:33:57,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:33:57" (1/1) ... [2024-11-19 06:33:57,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:33:57,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:33:57,982 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:33:58,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:33:58,055 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:33:58,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58 WrapperNode [2024-11-19 06:33:58,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:33:58,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:33:58,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:33:58,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:33:58,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58" (1/1) ... [2024-11-19 06:33:58,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58" (1/1) ... [2024-11-19 06:33:58,100 INFO L138 Inliner]: procedures = 113, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-11-19 06:33:58,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:33:58,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:33:58,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:33:58,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:33:58,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58" (1/1) ... [2024-11-19 06:33:58,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58" (1/1) ... [2024-11-19 06:33:58,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58" (1/1) ... [2024-11-19 06:33:58,131 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [3, 3]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-19 06:33:58,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58" (1/1) ... [2024-11-19 06:33:58,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58" (1/1) ... [2024-11-19 06:33:58,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58" (1/1) ... [2024-11-19 06:33:58,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58" (1/1) ... [2024-11-19 06:33:58,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58" (1/1) ... [2024-11-19 06:33:58,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58" (1/1) ... [2024-11-19 06:33:58,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:33:58,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:33:58,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:33:58,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:33:58,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58" (1/1) ... [2024-11-19 06:33:58,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:33:58,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:33:58,184 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-19 06:33:58,187 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-19 06:33:58,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:33:58,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:33:58,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:33:58,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:33:58,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:33:58,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:33:58,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:33:58,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:33:58,344 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:33:58,346 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:33:58,573 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-19 06:33:58,573 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:33:58,586 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:33:58,586 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:33:58,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:33:58 BoogieIcfgContainer [2024-11-19 06:33:58,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:33:58,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:33:58,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:33:58,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:33:58,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:33:57" (1/3) ... [2024-11-19 06:33:58,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416c7082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:33:58, skipping insertion in model container [2024-11-19 06:33:58,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:33:58" (2/3) ... [2024-11-19 06:33:58,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416c7082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:33:58, skipping insertion in model container [2024-11-19 06:33:58,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:33:58" (3/3) ... [2024-11-19 06:33:58,594 INFO L112 eAbstractionObserver]: Analyzing ICFG strcspn.i [2024-11-19 06:33:58,609 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:33:58,609 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-19 06:33:58,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:33:58,656 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;@63d1c6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:33:58,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-19 06:33:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.9090909090909092) 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-19 06:33:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:33:58,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:58,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:33:58,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:33:58,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:58,671 INFO L85 PathProgramCache]: Analyzing trace with hash 925667, now seen corresponding path program 1 times [2024-11-19 06:33:58,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:58,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760291756] [2024-11-19 06:33:58,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:58,828 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-19 06:33:58,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760291756] [2024-11-19 06:33:58,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760291756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:58,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:58,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:33:58,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464786466] [2024-11-19 06:33:58,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:58,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:33:58,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:58,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:33:58,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:33:58,873 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.9090909090909092) 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:58,931 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2024-11-19 06:33:58,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:33:58,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:33:58,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:58,942 INFO L225 Difference]: With dead ends: 37 [2024-11-19 06:33:58,942 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 06:33:58,944 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-19 06:33:58,947 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:58,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:33:58,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 06:33:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-19 06:33:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 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-19 06:33:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-19 06:33:58,974 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 4 [2024-11-19 06:33:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:58,974 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-19 06:33:58,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-19 06:33:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:33:58,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:58,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:33:58,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:33:58,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:33:58,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:58,976 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-19 06:33:58,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:58,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754520469] [2024-11-19 06:33:58,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:58,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:59,081 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-19 06:33:59,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:59,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754520469] [2024-11-19 06:33:59,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754520469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:59,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:59,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:33:59,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458716625] [2024-11-19 06:33:59,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:59,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:33:59,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:59,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:33:59,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:33:59,085 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:59,135 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-19 06:33:59,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:33:59,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:33:59,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:59,136 INFO L225 Difference]: With dead ends: 33 [2024-11-19 06:33:59,137 INFO L226 Difference]: Without dead ends: 33 [2024-11-19 06:33:59,137 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-19 06:33:59,138 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:59,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 43 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:33:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-19 06:33:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-19 06:33:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-19 06:33:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-11-19 06:33:59,148 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 4 [2024-11-19 06:33:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:59,148 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-11-19 06:33:59,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-11-19 06:33:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:33:59,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:59,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:33:59,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:33:59,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:33:59,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:59,151 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2024-11-19 06:33:59,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:59,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332872937] [2024-11-19 06:33:59,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:59,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:59,422 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-19 06:33:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:59,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332872937] [2024-11-19 06:33:59,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332872937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:59,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:59,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:33:59,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815622011] [2024-11-19 06:33:59,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:59,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:33:59,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:59,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:33:59,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:33:59,430 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:59,488 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-19 06:33:59,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:33:59,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:33:59,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:59,492 INFO L225 Difference]: With dead ends: 32 [2024-11-19 06:33:59,492 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 06:33:59,493 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-19 06:33:59,494 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:59,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:33:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 06:33:59,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-19 06:33:59,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 31 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-19 06:33:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-19 06:33:59,498 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 4 [2024-11-19 06:33:59,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:59,499 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-19 06:33:59,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:59,499 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-19 06:33:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:33:59,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:59,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:59,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:33:59,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:33:59,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782697, now seen corresponding path program 1 times [2024-11-19 06:33:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:59,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535517496] [2024-11-19 06:33:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:59,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:59,597 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-19 06:33:59,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:59,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535517496] [2024-11-19 06:33:59,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535517496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:59,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:59,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:33:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592935194] [2024-11-19 06:33:59,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:59,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:33:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:59,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:33:59,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:33:59,600 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:59,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:59,637 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-19 06:33:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:33:59,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:33:59,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:59,638 INFO L225 Difference]: With dead ends: 31 [2024-11-19 06:33:59,638 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 06:33:59,638 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-19 06:33:59,640 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 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-19 06:33:59,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:33:59,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 06:33:59,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 06:33:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.619047619047619) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-19 06:33:59,647 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 7 [2024-11-19 06:33:59,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:59,647 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-19 06:33:59,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-19 06:33:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:33:59,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:59,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:59,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:33:59,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:33:59,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:59,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782698, now seen corresponding path program 1 times [2024-11-19 06:33:59,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:59,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626277710] [2024-11-19 06:33:59,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:59,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:59,850 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-19 06:33:59,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:59,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626277710] [2024-11-19 06:33:59,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626277710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:59,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:59,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:33:59,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698522535] [2024-11-19 06:33:59,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:33:59,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:33:59,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:33:59,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:33:59,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:33:59,858 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:33:59,874 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-19 06:33:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:33:59,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:33:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:33:59,878 INFO L225 Difference]: With dead ends: 30 [2024-11-19 06:33:59,878 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 06:33:59,879 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-19 06:33:59,880 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:33:59,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:33:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 06:33:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-19 06:33:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 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-19 06:33:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-19 06:33:59,885 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 7 [2024-11-19 06:33:59,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:33:59,885 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-19 06:33:59,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:33:59,886 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-19 06:33:59,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:33:59,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:33:59,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:33:59,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:33:59,888 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:33:59,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:33:59,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782686, now seen corresponding path program 1 times [2024-11-19 06:33:59,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:33:59,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091292150] [2024-11-19 06:33:59,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:33:59,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:33:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:33:59,998 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-19 06:33:59,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:33:59,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091292150] [2024-11-19 06:33:59,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091292150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:33:59,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:33:59,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:33:59,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299089409] [2024-11-19 06:33:59,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:34:00,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:34:00,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:00,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:34:00,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:34:00,000 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:00,041 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-11-19 06:34:00,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:34:00,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:34:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:00,043 INFO L225 Difference]: With dead ends: 31 [2024-11-19 06:34:00,043 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 06:34:00,043 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-19 06:34:00,044 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:00,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:34:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 06:34:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-19 06:34:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 29 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-19 06:34:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-19 06:34:00,048 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 7 [2024-11-19 06:34:00,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:00,048 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-19 06:34:00,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-19 06:34:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:34:00,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:00,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:34:00,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:34:00,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:34:00,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:00,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383917, now seen corresponding path program 1 times [2024-11-19 06:34:00,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:00,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176434150] [2024-11-19 06:34:00,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:34:00,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:34:00,149 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-19 06:34:00,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:00,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176434150] [2024-11-19 06:34:00,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176434150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:34:00,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:34:00,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:34:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264172799] [2024-11-19 06:34:00,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:34:00,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:34:00,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:00,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:34:00,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:34:00,152 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:00,191 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-19 06:34:00,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:34:00,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:34:00,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:00,192 INFO L225 Difference]: With dead ends: 28 [2024-11-19 06:34:00,192 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 06:34:00,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-19 06:34:00,193 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:00,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 28 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:34:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 06:34:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-19 06:34:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-19 06:34:00,196 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 9 [2024-11-19 06:34:00,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:00,197 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-19 06:34:00,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-19 06:34:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:34:00,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:00,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:34:00,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:34:00,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:34:00,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:00,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383918, now seen corresponding path program 1 times [2024-11-19 06:34:00,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:00,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031897633] [2024-11-19 06:34:00,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:34:00,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:34:00,364 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-19 06:34:00,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:00,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031897633] [2024-11-19 06:34:00,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031897633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:34:00,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:34:00,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:34:00,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341789121] [2024-11-19 06:34:00,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:34:00,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:34:00,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:00,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:34:00,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:34:00,367 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:00,443 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-11-19 06:34:00,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:34:00,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:34:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:00,444 INFO L225 Difference]: With dead ends: 44 [2024-11-19 06:34:00,444 INFO L226 Difference]: Without dead ends: 44 [2024-11-19 06:34:00,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:34:00,446 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:00,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 74 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:34:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-19 06:34:00,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2024-11-19 06:34:00,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 35 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-19 06:34:00,455 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 9 [2024-11-19 06:34:00,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:00,455 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-19 06:34:00,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-11-19 06:34:00,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:34:00,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:00,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:34:00,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:34:00,456 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:34:00,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:00,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1621618095, now seen corresponding path program 1 times [2024-11-19 06:34:00,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:00,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314888556] [2024-11-19 06:34:00,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:34:00,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:34:00,527 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-19 06:34:00,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:00,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314888556] [2024-11-19 06:34:00,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314888556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:34:00,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:34:00,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:34:00,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311271445] [2024-11-19 06:34:00,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:34:00,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:34:00,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:00,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:34:00,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:34:00,531 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) 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-19 06:34:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:00,564 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-19 06:34:00,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:34:00,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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-19 06:34:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:00,568 INFO L225 Difference]: With dead ends: 34 [2024-11-19 06:34:00,568 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 06:34:00,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:34:00,569 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:00,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:34:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 06:34:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-19 06:34:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-19 06:34:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-19 06:34:00,576 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 11 [2024-11-19 06:34:00,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:00,577 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-19 06:34:00,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) 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-19 06:34:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-19 06:34:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:34:00,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:00,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:34:00,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:34:00,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:34:00,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:00,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1621618094, now seen corresponding path program 1 times [2024-11-19 06:34:00,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:00,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122495112] [2024-11-19 06:34:00,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:34:00,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:34:00,827 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-19 06:34:00,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:00,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122495112] [2024-11-19 06:34:00,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122495112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:34:00,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:34:00,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:34:00,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810730189] [2024-11-19 06:34:00,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:34:00,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:34:00,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:00,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:34:00,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:34:00,830 INFO L87 Difference]: Start difference. First operand 34 states and 41 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-19 06:34:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:00,893 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-11-19 06:34:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:34:00,894 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-19 06:34:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:00,895 INFO L225 Difference]: With dead ends: 54 [2024-11-19 06:34:00,895 INFO L226 Difference]: Without dead ends: 54 [2024-11-19 06:34:00,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:34:00,896 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:00,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:34:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-19 06:34:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2024-11-19 06:34:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 41 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-11-19 06:34:00,903 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 11 [2024-11-19 06:34:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:00,903 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-19 06:34:00,903 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-19 06:34:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-19 06:34:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:34:00,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:00,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:34:00,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:34:00,904 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:34:00,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash 698109586, now seen corresponding path program 1 times [2024-11-19 06:34:00,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:00,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560530570] [2024-11-19 06:34:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:34:00,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:34:01,092 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-19 06:34:01,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:01,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560530570] [2024-11-19 06:34:01,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560530570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:34:01,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:34:01,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:34:01,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473066483] [2024-11-19 06:34:01,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:34:01,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:34:01,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:01,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:34:01,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:34:01,094 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:01,130 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-11-19 06:34:01,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:34:01,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-19 06:34:01,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:01,135 INFO L225 Difference]: With dead ends: 41 [2024-11-19 06:34:01,135 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 06:34:01,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:34:01,135 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:01,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 49 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:34:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 06:34:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 06:34:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-19 06:34:01,144 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 13 [2024-11-19 06:34:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:01,144 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-19 06:34:01,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-19 06:34:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:34:01,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:01,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:34:01,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:34:01,146 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:34:01,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:01,146 INFO L85 PathProgramCache]: Analyzing trace with hash 897154592, now seen corresponding path program 1 times [2024-11-19 06:34:01,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:01,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319016945] [2024-11-19 06:34:01,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:34:01,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:34:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:01,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:01,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319016945] [2024-11-19 06:34:01,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319016945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:34:01,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40792616] [2024-11-19 06:34:01,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:34:01,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:34:01,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:34:01,576 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-19 06:34:01,578 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-19 06:34:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:34:01,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 06:34:01,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:34:01,760 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-19 06:34:01,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:34:01,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:34:01,878 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:34:01,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-11-19 06:34:02,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:34:02,011 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 18 treesize of output 19 [2024-11-19 06:34:02,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:02,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:34:02,489 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:34:02,492 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-19 06:34:02,504 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:34:02,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2024-11-19 06:34:02,511 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 13 treesize of output 11 [2024-11-19 06:34:02,517 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 22 treesize of output 20 [2024-11-19 06:34:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:02,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40792616] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:34:02,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:34:02,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-11-19 06:34:02,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704466499] [2024-11-19 06:34:02,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:34:02,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 06:34:02,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:02,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 06:34:02,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:34:02,535 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 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-19 06:34:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:02,882 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-19 06:34:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:34:02,883 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 06:34:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:02,883 INFO L225 Difference]: With dead ends: 57 [2024-11-19 06:34:02,884 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 06:34:02,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:34:02,885 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 80 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:02,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 133 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:34:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 06:34:02,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2024-11-19 06:34:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 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-19 06:34:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-19 06:34:02,888 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 15 [2024-11-19 06:34:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:02,888 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-19 06:34:02,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 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-19 06:34:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-19 06:34:02,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 06:34:02,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:02,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:34:02,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:34:03,092 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,SelfDestructingSolverStorable11 [2024-11-19 06:34:03,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:34:03,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:03,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1080800794, now seen corresponding path program 1 times [2024-11-19 06:34:03,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:03,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230451639] [2024-11-19 06:34:03,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:34:03,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:34:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:03,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:03,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230451639] [2024-11-19 06:34:03,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230451639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:34:03,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957346239] [2024-11-19 06:34:03,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:34:03,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:34:03,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:34:03,434 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-19 06:34:03,435 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-19 06:34:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:34:03,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 06:34:03,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:34:03,531 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-19 06:34:03,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:34:03,666 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 18 treesize of output 15 [2024-11-19 06:34:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:03,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:34:04,001 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 13 treesize of output 11 [2024-11-19 06:34:04,004 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 14 treesize of output 12 [2024-11-19 06:34:04,009 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 21 treesize of output 17 [2024-11-19 06:34:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:04,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957346239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:34:04,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:34:04,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-11-19 06:34:04,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166807909] [2024-11-19 06:34:04,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:34:04,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 06:34:04,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:04,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 06:34:04,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:34:04,047 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-19 06:34:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:04,410 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2024-11-19 06:34:04,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:34:04,411 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 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-19 06:34:04,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:04,411 INFO L225 Difference]: With dead ends: 78 [2024-11-19 06:34:04,411 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 06:34:04,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:34:04,412 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 114 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:04,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 138 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:34:04,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 06:34:04,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 45. [2024-11-19 06:34:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 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-19 06:34:04,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-11-19 06:34:04,417 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 17 [2024-11-19 06:34:04,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:04,417 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-11-19 06:34:04,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-19 06:34:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-11-19 06:34:04,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:34:04,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:04,418 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:34:04,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:34:04,625 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,SelfDestructingSolverStorable12 [2024-11-19 06:34:04,626 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:34:04,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:04,626 INFO L85 PathProgramCache]: Analyzing trace with hash 834958674, now seen corresponding path program 2 times [2024-11-19 06:34:04,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:04,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278042021] [2024-11-19 06:34:04,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:34:04,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:04,646 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:34:04,646 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:34:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:05,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:05,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278042021] [2024-11-19 06:34:05,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278042021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:34:05,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743451733] [2024-11-19 06:34:05,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:34:05,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:34:05,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:34:05,053 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-19 06:34:05,055 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-19 06:34:05,126 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:34:05,127 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:34:05,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-19 06:34:05,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:34:05,158 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-19 06:34:05,234 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:34:05,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-11-19 06:34:05,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:34:05,895 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-19 06:34:05,895 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 28 treesize of output 23 [2024-11-19 06:34:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:05,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:34:06,505 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-19 06:34:06,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:34:06,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 23 [2024-11-19 06:34:06,526 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 49 treesize of output 45 [2024-11-19 06:34:06,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:34:06,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2024-11-19 06:34:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:06,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743451733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:34:06,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:34:06,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2024-11-19 06:34:06,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799794719] [2024-11-19 06:34:06,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:34:06,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 06:34:06,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:06,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 06:34:06,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=661, Unknown=1, NotChecked=0, Total=756 [2024-11-19 06:34:06,639 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-19 06:34:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:11,560 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2024-11-19 06:34:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:34:11,561 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 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-19 06:34:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:11,563 INFO L225 Difference]: With dead ends: 99 [2024-11-19 06:34:11,563 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 06:34:11,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=199, Invalid=1279, Unknown=4, NotChecked=0, Total=1482 [2024-11-19 06:34:11,565 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 142 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 4 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:11,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 301 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 473 Invalid, 13 Unknown, 0 Unchecked, 3.7s Time] [2024-11-19 06:34:11,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 06:34:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 79. [2024-11-19 06:34:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 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-19 06:34:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2024-11-19 06:34:11,573 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 21 [2024-11-19 06:34:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:11,576 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2024-11-19 06:34:11,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-19 06:34:11,576 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2024-11-19 06:34:11,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 06:34:11,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:11,577 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:34:11,595 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-19 06:34:11,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:34:11,778 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:34:11,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:11,778 INFO L85 PathProgramCache]: Analyzing trace with hash -828013958, now seen corresponding path program 2 times [2024-11-19 06:34:11,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:11,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35953910] [2024-11-19 06:34:11,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:34:11,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:11,803 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:34:11,803 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:34:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:12,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:12,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35953910] [2024-11-19 06:34:12,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35953910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:34:12,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451035141] [2024-11-19 06:34:12,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:34:12,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:34:12,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:34:12,243 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-19 06:34:12,244 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-19 06:34:12,311 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:34:12,311 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:34:12,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 06:34:12,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:34:12,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:34:12,339 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-19 06:34:12,851 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 06:34:12,851 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 29 treesize of output 20 [2024-11-19 06:34:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:12,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:34:13,306 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-19 06:34:13,313 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 29 treesize of output 23 [2024-11-19 06:34:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:13,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451035141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:34:13,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:34:13,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 31 [2024-11-19 06:34:13,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607311737] [2024-11-19 06:34:13,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:34:13,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 06:34:13,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:13,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 06:34:13,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2024-11-19 06:34:13,372 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:14,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:14,427 INFO L93 Difference]: Finished difference Result 275 states and 305 transitions. [2024-11-19 06:34:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 06:34:14,427 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-19 06:34:14,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:14,428 INFO L225 Difference]: With dead ends: 275 [2024-11-19 06:34:14,428 INFO L226 Difference]: Without dead ends: 275 [2024-11-19 06:34:14,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=430, Invalid=2222, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 06:34:14,429 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 266 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:14,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 221 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:34:14,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-19 06:34:14,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 172. [2024-11-19 06:34:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.1529411764705881) internal successors, (196), 171 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-19 06:34:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 196 transitions. [2024-11-19 06:34:14,437 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 196 transitions. Word has length 23 [2024-11-19 06:34:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:14,438 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 196 transitions. [2024-11-19 06:34:14,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:34:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2024-11-19 06:34:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:34:14,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:14,439 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:34:14,458 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-19 06:34:14,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 06:34:14,644 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:34:14,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:14,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1529251018, now seen corresponding path program 3 times [2024-11-19 06:34:14,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:14,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148633181] [2024-11-19 06:34:14,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:34:14,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:14,669 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-19 06:34:14,669 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:34:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:15,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:15,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148633181] [2024-11-19 06:34:15,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148633181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:34:15,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358756066] [2024-11-19 06:34:15,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:34:15,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:34:15,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:34:15,240 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-19 06:34:15,242 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-19 06:34:15,322 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-19 06:34:15,322 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:34:15,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-19 06:34:15,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:34:15,344 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-19 06:34:15,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:34:15,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 06:34:15,403 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:34:15,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-11-19 06:34:16,029 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-11-19 06:34:16,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2024-11-19 06:34:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 06:34:16,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:34:17,351 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 53 treesize of output 45 [2024-11-19 06:34:17,357 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:34:17,361 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-19 06:34:17,369 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 06:34:17,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 12 [2024-11-19 06:34:17,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:34:17,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 125 [2024-11-19 06:34:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:34:17,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358756066] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:34:17,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:34:17,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 17] total 35 [2024-11-19 06:34:17,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005099879] [2024-11-19 06:34:17,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:34:17,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-19 06:34:17,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:17,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-19 06:34:17,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 06:34:17,519 INFO L87 Difference]: Start difference. First operand 172 states and 196 transitions. Second operand has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-19 06:34:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:18,276 INFO L93 Difference]: Finished difference Result 174 states and 194 transitions. [2024-11-19 06:34:18,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:34:18,277 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-19 06:34:18,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:18,278 INFO L225 Difference]: With dead ends: 174 [2024-11-19 06:34:18,278 INFO L226 Difference]: Without dead ends: 174 [2024-11-19 06:34:18,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=425, Invalid=2025, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:34:18,280 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 234 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:18,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 153 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:34:18,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-19 06:34:18,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 50. [2024-11-19 06:34:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 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-19 06:34:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-19 06:34:18,287 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 33 [2024-11-19 06:34:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:18,289 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-19 06:34:18,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.257142857142857) internal successors, (79), 36 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-19 06:34:18,289 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-19 06:34:18,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 06:34:18,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:34:18,291 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:34:18,309 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-19 06:34:18,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 06:34:18,492 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2024-11-19 06:34:18,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:34:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash 41398838, now seen corresponding path program 3 times [2024-11-19 06:34:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:34:18,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109509746] [2024-11-19 06:34:18,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:34:18,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:34:18,510 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 06:34:18,511 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:34:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 06:34:18,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:34:18,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109509746] [2024-11-19 06:34:18,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109509746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:34:18,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932436870] [2024-11-19 06:34:18,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:34:18,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:34:18,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:34:18,870 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-19 06:34:18,872 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-19 06:34:18,949 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 06:34:18,950 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:34:18,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 06:34:18,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:34:18,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-19 06:34:18,994 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 18 treesize of output 14 [2024-11-19 06:34:19,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:34:19,419 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 22 treesize of output 23 [2024-11-19 06:34:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 06:34:19,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:34:19,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-19 06:34:19,900 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 26 treesize of output 20 [2024-11-19 06:34:19,940 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-19 06:34:19,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932436870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:34:19,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:34:19,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-11-19 06:34:19,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392883122] [2024-11-19 06:34:19,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:34:19,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 06:34:19,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:34:19,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 06:34:19,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2024-11-19 06:34:19,944 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-19 06:34:20,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:34:20,390 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-11-19 06:34:20,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:34:20,392 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 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-19 06:34:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:34:20,392 INFO L225 Difference]: With dead ends: 61 [2024-11-19 06:34:20,392 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 06:34:20,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 06:34:20,393 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 64 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:34:20,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 167 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:34:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 06:34:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 06:34:20,394 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-19 06:34:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 06:34:20,394 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2024-11-19 06:34:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:34:20,394 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 06:34:20,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-19 06:34:20,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 06:34:20,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 06:34:20,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 13 remaining) [2024-11-19 06:34:20,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2024-11-19 06:34:20,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2024-11-19 06:34:20,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2024-11-19 06:34:20,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2024-11-19 06:34:20,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2024-11-19 06:34:20,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2024-11-19 06:34:20,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2024-11-19 06:34:20,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2024-11-19 06:34:20,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 13 remaining) [2024-11-19 06:34:20,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2024-11-19 06:34:20,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2024-11-19 06:34:20,402 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2024-11-19 06:34:20,420 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-19 06:34:20,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 06:34:20,606 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:34:20,608 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:34:20,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:34:20 BoogieIcfgContainer [2024-11-19 06:34:20,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:34:20,613 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:34:20,613 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:34:20,613 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:34:20,614 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:33:58" (3/4) ... [2024-11-19 06:34:20,616 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 06:34:20,623 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-19 06:34:20,623 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 06:34:20,623 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-19 06:34:20,623 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 06:34:20,715 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:34:20,716 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 06:34:20,716 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:34:20,716 INFO L158 Benchmark]: Toolchain (without parser) took 23184.49ms. Allocated memory was 184.5MB in the beginning and 281.0MB in the end (delta: 96.5MB). Free memory was 114.1MB in the beginning and 116.1MB in the end (delta: -1.9MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-11-19 06:34:20,716 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 109.1MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:34:20,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.75ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 150.1MB in the end (delta: -36.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-11-19 06:34:20,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.02ms. Allocated memory is still 184.5MB. Free memory was 150.1MB in the beginning and 148.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:34:20,717 INFO L158 Benchmark]: Boogie Preprocessor took 46.80ms. Allocated memory is still 184.5MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:34:20,718 INFO L158 Benchmark]: RCFGBuilder took 438.61ms. Allocated memory is still 184.5MB. Free memory was 145.9MB in the beginning and 131.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 06:34:20,718 INFO L158 Benchmark]: TraceAbstraction took 22023.14ms. Allocated memory was 184.5MB in the beginning and 281.0MB in the end (delta: 96.5MB). Free memory was 130.5MB in the beginning and 120.9MB in the end (delta: 9.6MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2024-11-19 06:34:20,718 INFO L158 Benchmark]: Witness Printer took 103.21ms. Allocated memory is still 281.0MB. Free memory was 120.9MB in the beginning and 116.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 06:34:20,719 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 109.1MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.75ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 150.1MB in the end (delta: -36.1MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.02ms. Allocated memory is still 184.5MB. Free memory was 150.1MB in the beginning and 148.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.80ms. Allocated memory is still 184.5MB. Free memory was 148.0MB in the beginning and 145.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 438.61ms. Allocated memory is still 184.5MB. Free memory was 145.9MB in the beginning and 131.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 22023.14ms. Allocated memory was 184.5MB in the beginning and 281.0MB in the end (delta: 96.5MB). Free memory was 130.5MB in the beginning and 120.9MB in the end (delta: 9.6MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. * Witness Printer took 103.21ms. Allocated memory is still 281.0MB. Free memory was 120.9MB in the beginning and 116.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -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: 517]: 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, 36 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 1010 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1010 mSDsluCounter, 1712 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1313 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2319 IncrementalHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 399 mSDtfsCounter, 2319 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 201 SyntacticMatches, 6 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1692 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=15, InterpolantAutomatonStates: 132, 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, 17 MinimizatonAttempts, 317 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 386 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 507 ConstructedInterpolants, 112 QuantifiedInterpolants, 8791 SizeOfPredicates, 40 NumberOfNonLiveVariables, 772 ConjunctsInSsa, 201 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 137/369 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 13 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 06:34:20,758 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