./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-15/cstrchr_reverse_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/termination-15/cstrchr_reverse_alloca.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 c2261b8075e5a5018e09c71b2ef98f1a55d20ac7ba7a361137d9c5ebaba61150 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:15:55,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:15:55,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-12 13:15:55,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:15:55,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:15:55,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:15:55,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:15:55,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:15:55,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:15:55,573 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:15:55,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:15:55,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:15:55,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:15:55,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:15:55,575 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:15:55,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:15:55,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:15:55,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:15:55,578 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:15:55,579 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:15:55,582 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:15:55,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:15:55,583 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:15:55,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:15:55,584 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:15:55,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:15:55,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:15:55,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:15:55,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:15:55,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:15:55,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:15:55,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:15:55,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:15:55,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:15:55,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:15:55,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:15:55,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:15:55,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:15:55,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:15:55,589 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 -> c2261b8075e5a5018e09c71b2ef98f1a55d20ac7ba7a361137d9c5ebaba61150 [2024-11-12 13:15:55,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:15:55,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:15:55,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:15:55,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:15:55,884 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:15:55,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrchr_reverse_alloca.i [2024-11-12 13:15:57,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:15:57,624 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:15:57,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrchr_reverse_alloca.i [2024-11-12 13:15:57,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d097eb940/5b01d4f45afe47ae94733c8e897b0014/FLAG3602df0bc [2024-11-12 13:15:57,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d097eb940/5b01d4f45afe47ae94733c8e897b0014 [2024-11-12 13:15:57,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:15:57,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:15:57,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:15:57,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:15:57,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:15:57,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:15:57" (1/1) ... [2024-11-12 13:15:57,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@327fe20c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:57, skipping insertion in model container [2024-11-12 13:15:57,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:15:57" (1/1) ... [2024-11-12 13:15:57,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:15:58,033 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:15:58,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:15:58,048 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:15:58,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:15:58,133 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:15:58,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58 WrapperNode [2024-11-12 13:15:58,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:15:58,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:15:58,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:15:58,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:15:58,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58" (1/1) ... [2024-11-12 13:15:58,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58" (1/1) ... [2024-11-12 13:15:58,180 INFO L138 Inliner]: procedures = 152, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2024-11-12 13:15:58,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:15:58,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:15:58,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:15:58,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:15:58,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58" (1/1) ... [2024-11-12 13:15:58,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58" (1/1) ... [2024-11-12 13:15:58,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58" (1/1) ... [2024-11-12 13:15:58,209 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 1 writes are split as follows [1]. [2024-11-12 13:15:58,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58" (1/1) ... [2024-11-12 13:15:58,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58" (1/1) ... [2024-11-12 13:15:58,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58" (1/1) ... [2024-11-12 13:15:58,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58" (1/1) ... [2024-11-12 13:15:58,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58" (1/1) ... [2024-11-12 13:15:58,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58" (1/1) ... [2024-11-12 13:15:58,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:15:58,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:15:58,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:15:58,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:15:58,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58" (1/1) ... [2024-11-12 13:15:58,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:15:58,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:15:58,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 13:15:58,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 13:15:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 13:15:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 13:15:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 13:15:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:15:58,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:15:58,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:15:58,386 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:15:58,387 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:15:58,524 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-12 13:15:58,524 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:15:58,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:15:58,536 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 13:15:58,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:15:58 BoogieIcfgContainer [2024-11-12 13:15:58,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:15:58,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:15:58,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:15:58,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:15:58,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:15:57" (1/3) ... [2024-11-12 13:15:58,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da8c4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:15:58, skipping insertion in model container [2024-11-12 13:15:58,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:58" (2/3) ... [2024-11-12 13:15:58,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7da8c4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:15:58, skipping insertion in model container [2024-11-12 13:15:58,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:15:58" (3/3) ... [2024-11-12 13:15:58,548 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrchr_reverse_alloca.i [2024-11-12 13:15:58,565 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:15:58,565 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-12 13:15:58,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:15:58,607 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;@7dfc8a82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:15:58,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-12 13:15:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 26 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-12 13:15:58,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:15:58,617 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:58,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:15:58,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:58,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:58,625 INFO L85 PathProgramCache]: Analyzing trace with hash 28693828, now seen corresponding path program 1 times [2024-11-12 13:15:58,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:58,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479595298] [2024-11-12 13:15:58,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:58,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:58,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:58,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479595298] [2024-11-12 13:15:58,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479595298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:58,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:58,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:15:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176659549] [2024-11-12 13:15:58,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:58,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:15:58,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:58,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:15:58,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:15:58,927 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 26 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:58,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:58,978 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-12 13:15:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:15:58,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 13:15:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:58,988 INFO L225 Difference]: With dead ends: 26 [2024-11-12 13:15:58,988 INFO L226 Difference]: Without dead ends: 24 [2024-11-12 13:15:58,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:15:58,996 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:58,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-12 13:15:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-12 13:15:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.625) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-12 13:15:59,029 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 5 [2024-11-12 13:15:59,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:59,030 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-12 13:15:59,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:59,031 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-12 13:15:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:15:59,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:59,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:15:59,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 13:15:59,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:59,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2024-11-12 13:15:59,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:59,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521203883] [2024-11-12 13:15:59,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:59,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:59,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:59,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521203883] [2024-11-12 13:15:59,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521203883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:59,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:59,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:15:59,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455756836] [2024-11-12 13:15:59,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:59,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:15:59,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:59,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:15:59,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:15:59,272 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:59,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:59,339 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-11-12 13:15:59,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:15:59,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 13:15:59,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:59,340 INFO L225 Difference]: With dead ends: 27 [2024-11-12 13:15:59,340 INFO L226 Difference]: Without dead ends: 27 [2024-11-12 13:15:59,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:15:59,342 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:59,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 59 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:59,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-12 13:15:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-11-12 13:15:59,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-12 13:15:59,346 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 5 [2024-11-12 13:15:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:59,347 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-12 13:15:59,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-12 13:15:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 13:15:59,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:59,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 13:15:59,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 13:15:59,348 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:59,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:59,349 INFO L85 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2024-11-12 13:15:59,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:59,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098829876] [2024-11-12 13:15:59,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:59,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:59,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:59,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098829876] [2024-11-12 13:15:59,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098829876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:59,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:59,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:15:59,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37564186] [2024-11-12 13:15:59,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:59,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:15:59,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:59,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:15:59,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:15:59,512 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:59,565 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2024-11-12 13:15:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:15:59,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 13:15:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:59,566 INFO L225 Difference]: With dead ends: 25 [2024-11-12 13:15:59,566 INFO L226 Difference]: Without dead ends: 25 [2024-11-12 13:15:59,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:15:59,568 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:59,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 71 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-12 13:15:59,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-11-12 13:15:59,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.5625) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-11-12 13:15:59,575 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 5 [2024-11-12 13:15:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:59,575 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-11-12 13:15:59,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-11-12 13:15:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:15:59,576 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:59,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:59,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 13:15:59,577 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:59,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:59,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1804964393, now seen corresponding path program 1 times [2024-11-12 13:15:59,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:59,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998589763] [2024-11-12 13:15:59,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:59,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:15:59,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:59,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998589763] [2024-11-12 13:15:59,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998589763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:59,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:59,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:15:59,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398992523] [2024-11-12 13:15:59,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:59,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:15:59,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:59,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:15:59,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:15:59,632 INFO L87 Difference]: Start difference. First operand 23 states and 25 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-12 13:15:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:59,678 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-12 13:15:59,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:15:59,680 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-12 13:15:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:59,681 INFO L225 Difference]: With dead ends: 20 [2024-11-12 13:15:59,682 INFO L226 Difference]: Without dead ends: 20 [2024-11-12 13:15:59,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:15:59,683 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:59,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 21 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-12 13:15:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-12 13:15:59,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:59,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-12 13:15:59,691 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 7 [2024-11-12 13:15:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:59,691 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-12 13:15:59,692 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-12 13:15:59,692 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-12 13:15:59,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:15:59,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:59,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:59,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 13:15:59,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:59,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:59,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1804964394, now seen corresponding path program 1 times [2024-11-12 13:15:59,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:59,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617900484] [2024-11-12 13:15:59,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:59,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:15: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-12 13:15:59,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:15:59,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617900484] [2024-11-12 13:15:59,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617900484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:15:59,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:15:59,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:15:59,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472190872] [2024-11-12 13:15:59,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:15:59,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 13:15:59,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:15:59,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 13:15:59,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 13:15:59,855 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-12 13:15:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:15:59,917 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-11-12 13:15:59,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:15:59,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-12 13:15:59,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:15:59,919 INFO L225 Difference]: With dead ends: 22 [2024-11-12 13:15:59,919 INFO L226 Difference]: Without dead ends: 22 [2024-11-12 13:15:59,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:15:59,921 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:15:59,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 35 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:15:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-12 13:15:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-12 13:15:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:15:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-12 13:15:59,927 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 7 [2024-11-12 13:15:59,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:15:59,928 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-12 13:15:59,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-12 13:15:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-12 13:15:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 13:15:59,928 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:15:59,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:15:59,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 13:15:59,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:15:59,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:15:59,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1806811436, now seen corresponding path program 1 times [2024-11-12 13:15:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:15:59,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598115204] [2024-11-12 13:15:59,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:15:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:15:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:16:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:16:00,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:16:00,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598115204] [2024-11-12 13:16:00,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598115204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:16:00,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:16:00,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 13:16:00,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511623923] [2024-11-12 13:16:00,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:16:00,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 13:16:00,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:16:00,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 13:16:00,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:16:00,267 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 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-12 13:16:00,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:16:00,317 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-11-12 13:16:00,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:16:00,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 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-12 13:16:00,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:16:00,319 INFO L225 Difference]: With dead ends: 23 [2024-11-12 13:16:00,319 INFO L226 Difference]: Without dead ends: 23 [2024-11-12 13:16:00,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 13:16:00,320 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:16:00,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 39 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:16:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-12 13:16:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2024-11-12 13:16:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:16:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-12 13:16:00,327 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 7 [2024-11-12 13:16:00,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:16:00,328 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-12 13:16:00,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 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-12 13:16:00,329 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-12 13:16:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:16:00,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:16:00,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:16:00,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 13:16:00,330 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:16:00,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:16:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1531298047, now seen corresponding path program 1 times [2024-11-12 13:16:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:16:00,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768970477] [2024-11-12 13:16:00,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:16:00,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:16:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:16:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:16:00,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:16:00,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768970477] [2024-11-12 13:16:00,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768970477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:16:00,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:16:00,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:16:00,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363692711] [2024-11-12 13:16:00,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:16:00,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:16:00,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:16:00,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:16:00,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:16:00,365 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:16:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:16:00,377 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2024-11-12 13:16:00,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:16:00,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 13:16:00,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:16:00,378 INFO L225 Difference]: With dead ends: 20 [2024-11-12 13:16:00,378 INFO L226 Difference]: Without dead ends: 20 [2024-11-12 13:16:00,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:16:00,380 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:16:00,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:16:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-12 13:16:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-12 13:16:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:16:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-12 13:16:00,386 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 11 [2024-11-12 13:16:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:16:00,386 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-12 13:16:00,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:16:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-12 13:16:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:16:00,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:16:00,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:16:00,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 13:16:00,388 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:16:00,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:16:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1590499358, now seen corresponding path program 1 times [2024-11-12 13:16:00,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:16:00,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126413483] [2024-11-12 13:16:00,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:16:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:16:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:16:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:16:00,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:16:00,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126413483] [2024-11-12 13:16:00,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126413483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:16:00,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:16:00,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 13:16:00,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626347641] [2024-11-12 13:16:00,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:16:00,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:16:00,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:16:00,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:16:00,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:16:00,615 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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-12 13:16:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:16:00,695 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-12 13:16:00,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 13:16:00,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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-12 13:16:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:16:00,697 INFO L225 Difference]: With dead ends: 29 [2024-11-12 13:16:00,697 INFO L226 Difference]: Without dead ends: 29 [2024-11-12 13:16:00,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:16:00,699 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:16:00,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:16:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-12 13:16:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-12 13:16:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:16:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-12 13:16:00,706 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2024-11-12 13:16:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:16:00,707 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-12 13:16:00,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 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-12 13:16:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-12 13:16:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:16:00,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:16:00,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:16:00,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 13:16:00,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:16:00,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:16:00,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2003403360, now seen corresponding path program 1 times [2024-11-12 13:16:00,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:16:00,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723160795] [2024-11-12 13:16:00,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:16:00,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:16:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:16:00,991 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-12 13:16:00,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:16:00,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723160795] [2024-11-12 13:16:00,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723160795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:16:00,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811654514] [2024-11-12 13:16:00,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:16:00,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:16:00,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:16:00,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:16:00,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 13:16:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:16:01,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 13:16:01,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:16:01,134 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-12 13:16:01,163 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 11 treesize of output 7 [2024-11-12 13:16:01,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:16:01,267 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 15 treesize of output 15 [2024-11-12 13:16:01,360 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-12 13:16:01,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:16:01,620 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 10 treesize of output 8 [2024-11-12 13:16:01,634 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-12 13:16:01,717 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-12 13:16:01,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811654514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:16:01,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:16:01,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2024-11-12 13:16:01,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659886565] [2024-11-12 13:16:01,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:16:01,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 13:16:01,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:16:01,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 13:16:01,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-11-12 13:16:01,720 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:16:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:16:02,042 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-12 13:16:02,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 13:16:02,043 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-12 13:16:02,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:16:02,044 INFO L225 Difference]: With dead ends: 45 [2024-11-12 13:16:02,045 INFO L226 Difference]: Without dead ends: 45 [2024-11-12 13:16:02,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2024-11-12 13:16:02,047 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 52 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:16:02,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 94 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:16:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-12 13:16:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2024-11-12 13:16:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.2) internal successors, (36), 31 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-12 13:16:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-12 13:16:02,056 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 13 [2024-11-12 13:16:02,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:16:02,056 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-12 13:16:02,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:16:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-12 13:16:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 13:16:02,056 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:16:02,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:16:02,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 13:16:02,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:16:02,258 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:16:02,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:16:02,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2053675818, now seen corresponding path program 1 times [2024-11-12 13:16:02,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:16:02,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370107689] [2024-11-12 13:16:02,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:16:02,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:16:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:16:02,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:16:02,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:16:02,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370107689] [2024-11-12 13:16:02,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370107689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:16:02,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:16:02,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:16:02,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249519302] [2024-11-12 13:16:02,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:16:02,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:16:02,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:16:02,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:16:02,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:16:02,331 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:16:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:16:02,347 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-12 13:16:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:16:02,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2024-11-12 13:16:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:16:02,348 INFO L225 Difference]: With dead ends: 31 [2024-11-12 13:16:02,348 INFO L226 Difference]: Without dead ends: 20 [2024-11-12 13:16:02,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:16:02,349 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:16:02,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:16:02,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-12 13:16:02,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-12 13:16:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:16:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-11-12 13:16:02,354 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 14 [2024-11-12 13:16:02,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:16:02,355 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-11-12 13:16:02,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:16:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-11-12 13:16:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-12 13:16:02,356 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:16:02,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:16:02,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 13:16:02,357 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-12 13:16:02,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:16:02,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1985024788, now seen corresponding path program 2 times [2024-11-12 13:16:02,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 13:16:02,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483609211] [2024-11-12 13:16:02,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:16:02,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 13:16:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:16:02,728 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-12 13:16:02,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 13:16:02,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483609211] [2024-11-12 13:16:02,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483609211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:16:02,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064313310] [2024-11-12 13:16:02,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:16:02,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 13:16:02,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:16:02,731 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 13:16:02,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 13:16:02,796 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:16:02,797 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:16:02,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-12 13:16:02,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:16:02,809 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-12 13:16:02,814 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 11 treesize of output 7 [2024-11-12 13:16:02,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:16:02,906 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 15 treesize of output 15 [2024-11-12 13:16:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:16:03,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:16:03,343 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 10 treesize of output 8 [2024-11-12 13:16:03,346 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-12 13:16:03,367 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-12 13:16:03,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064313310] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:16:03,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 13:16:03,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-11-12 13:16:03,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984835988] [2024-11-12 13:16:03,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 13:16:03,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 13:16:03,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 13:16:03,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 13:16:03,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2024-11-12 13:16:03,369 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 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-12 13:16:03,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:16:03,645 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2024-11-12 13:16:03,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 13:16:03,646 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 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 19 [2024-11-12 13:16:03,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:16:03,646 INFO L225 Difference]: With dead ends: 24 [2024-11-12 13:16:03,646 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 13:16:03,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=933, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 13:16:03,648 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:16:03,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 58 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:16:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 13:16:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 13:16:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:16:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 13:16:03,649 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2024-11-12 13:16:03,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:16:03,649 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 13:16:03,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 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-12 13:16:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 13:16:03,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 13:16:03,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2024-11-12 13:16:03,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2024-11-12 13:16:03,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2024-11-12 13:16:03,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2024-11-12 13:16:03,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2024-11-12 13:16:03,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2024-11-12 13:16:03,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2024-11-12 13:16:03,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2024-11-12 13:16:03,656 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2024-11-12 13:16:03,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 13:16:03,856 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,SelfDestructingSolverStorable10 [2024-11-12 13:16:03,860 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:16:03,862 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 13:16:03,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:16:03 BoogieIcfgContainer [2024-11-12 13:16:03,865 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 13:16:03,866 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 13:16:03,866 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 13:16:03,866 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 13:16:03,867 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:15:58" (3/4) ... [2024-11-12 13:16:03,869 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 13:16:03,876 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-12 13:16:03,877 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 13:16:03,877 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-12 13:16:03,877 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 13:16:03,962 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 13:16:03,963 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 13:16:03,963 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 13:16:03,963 INFO L158 Benchmark]: Toolchain (without parser) took 6309.27ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 142.1MB in the beginning and 71.5MB in the end (delta: 70.6MB). Peak memory consumption was 107.9MB. Max. memory is 16.1GB. [2024-11-12 13:16:03,964 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 174.1MB. Free memory was 144.9MB in the beginning and 144.7MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:16:03,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.59ms. Allocated memory is still 174.1MB. Free memory was 142.1MB in the beginning and 121.8MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 13:16:03,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.81ms. Allocated memory is still 174.1MB. Free memory was 121.8MB in the beginning and 119.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:16:03,964 INFO L158 Benchmark]: Boogie Preprocessor took 47.08ms. Allocated memory is still 174.1MB. Free memory was 119.8MB in the beginning and 117.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 13:16:03,964 INFO L158 Benchmark]: RCFGBuilder took 308.24ms. Allocated memory is still 174.1MB. Free memory was 117.8MB in the beginning and 105.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 13:16:03,964 INFO L158 Benchmark]: TraceAbstraction took 5324.38ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 104.3MB in the beginning and 76.4MB in the end (delta: 28.0MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2024-11-12 13:16:03,965 INFO L158 Benchmark]: Witness Printer took 97.03ms. Allocated memory is still 209.7MB. Free memory was 76.4MB in the beginning and 71.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 13:16:03,968 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.23ms. Allocated memory is still 174.1MB. Free memory was 144.9MB in the beginning and 144.7MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.59ms. Allocated memory is still 174.1MB. Free memory was 142.1MB in the beginning and 121.8MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.81ms. Allocated memory is still 174.1MB. Free memory was 121.8MB in the beginning and 119.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.08ms. Allocated memory is still 174.1MB. Free memory was 119.8MB in the beginning and 117.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 308.24ms. Allocated memory is still 174.1MB. Free memory was 117.8MB in the beginning and 105.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5324.38ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 104.3MB in the beginning and 76.4MB in the end (delta: 28.0MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. * Witness Printer took 97.03ms. Allocated memory is still 209.7MB. Free memory was 76.4MB in the beginning and 71.5MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 370]: 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, 27 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 519 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 354 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 637 IncrementalHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 165 mSDtfsCounter, 637 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=9, InterpolantAutomatonStates: 72, 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, 11 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 155 ConstructedInterpolants, 7 QuantifiedInterpolants, 1446 SizeOfPredicates, 8 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 3/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-12 13:16:03,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE