./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cmemset-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cmemset-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eba94063d18105b44b9503ed48a138d00b9b850cd51aae19571aab60c15e268e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:31:55,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:31:55,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:31:55,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:31:55,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:31:55,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:31:55,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:31:55,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:31:55,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:31:55,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:31:55,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:31:55,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:31:55,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:31:55,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:31:55,446 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:31:55,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:31:55,447 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:31:55,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:31:55,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:31:55,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:31:55,448 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:31:55,449 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:31:55,449 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:31:55,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:31:55,450 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:31:55,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:31:55,451 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:31:55,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:31:55,452 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:31:55,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:31:55,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:31:55,453 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:31:55,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:31:55,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:31:55,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:31:55,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:31:55,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:31:55,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:31:55,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:31:55,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:31:55,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:31:55,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:31:55,456 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eba94063d18105b44b9503ed48a138d00b9b850cd51aae19571aab60c15e268e [2024-11-19 06:31:55,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:31:55,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:31:55,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:31:55,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:31:55,767 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:31:55,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cmemset-alloca-1.i [2024-11-19 06:31:57,241 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:31:57,462 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:31:57,463 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cmemset-alloca-1.i [2024-11-19 06:31:57,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f124390/a3788a678010438ea1b8d991e8253f4c/FLAG7eaf799eb [2024-11-19 06:31:57,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f124390/a3788a678010438ea1b8d991e8253f4c [2024-11-19 06:31:57,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:31:57,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:31:57,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:31:57,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:31:57,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:31:57,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:57,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545ff2f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57, skipping insertion in model container [2024-11-19 06:31:57,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:57,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:31:57,838 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-19 06:31:57,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:31:57,856 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:31:57,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:31:57,936 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:31:57,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57 WrapperNode [2024-11-19 06:31:57,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:31:57,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:31:57,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:31:57,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:31:57,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:57,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:57,988 INFO L138 Inliner]: procedures = 116, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2024-11-19 06:31:57,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:31:57,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:31:57,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:31:57,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:31:58,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:58,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:58,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:58,029 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 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-19 06:31:58,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:58,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:58,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:58,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:58,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:58,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:58,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:31:58,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:31:58,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:31:58,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:31:58,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57" (1/1) ... [2024-11-19 06:31:58,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:31:58,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:31:58,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:31:58,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:31:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:31:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:31:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:31:58,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:31:58,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:31:58,286 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:31:58,288 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:31:58,455 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-19 06:31:58,459 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:31:58,472 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:31:58,473 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 06:31:58,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:31:58 BoogieIcfgContainer [2024-11-19 06:31:58,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:31:58,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:31:58,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:31:58,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:31:58,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:31:57" (1/3) ... [2024-11-19 06:31:58,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b05277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:31:58, skipping insertion in model container [2024-11-19 06:31:58,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:31:57" (2/3) ... [2024-11-19 06:31:58,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b05277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:31:58, skipping insertion in model container [2024-11-19 06:31:58,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:31:58" (3/3) ... [2024-11-19 06:31:58,484 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cmemset-alloca-1.i [2024-11-19 06:31:58,501 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:31:58,502 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 06:31:58,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:31:58,559 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;@1a1e5525, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:31:58,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 06:31:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:31:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:31:58,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:31:58,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:31:58,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:31:58,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:31:58,581 INFO L85 PathProgramCache]: Analyzing trace with hash 121322254, now seen corresponding path program 1 times [2024-11-19 06:31:58,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:31:58,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263377242] [2024-11-19 06:31:58,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:31:58,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:31:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:31:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:31:58,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:31:58,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263377242] [2024-11-19 06:31:58,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263377242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:31:58,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:31:58,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:31:58,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552940807] [2024-11-19 06:31:58,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:31:58,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:31:58,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:31:59,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:31:59,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:31:59,009 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:31:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:31:59,100 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2024-11-19 06:31:59,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:31:59,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 06:31:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:31:59,110 INFO L225 Difference]: With dead ends: 18 [2024-11-19 06:31:59,110 INFO L226 Difference]: Without dead ends: 16 [2024-11-19 06:31:59,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:31:59,114 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:31:59,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 37 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:31:59,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-19 06:31:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-19 06:31:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:31:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-11-19 06:31:59,140 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 8 [2024-11-19 06:31:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:31:59,141 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-11-19 06:31:59,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:31:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-11-19 06:31:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:31:59,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:31:59,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:31:59,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:31:59,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:31:59,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:31:59,143 INFO L85 PathProgramCache]: Analyzing trace with hash 121322255, now seen corresponding path program 1 times [2024-11-19 06:31:59,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:31:59,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937297823] [2024-11-19 06:31:59,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:31:59,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:31:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:31:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:31:59,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:31:59,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937297823] [2024-11-19 06:31:59,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937297823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:31:59,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:31:59,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:31:59,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744843926] [2024-11-19 06:31:59,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:31:59,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:31:59,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:31:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:31:59,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:31:59,560 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:31:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:31:59,645 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-19 06:31:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:31:59,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 06:31:59,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:31:59,646 INFO L225 Difference]: With dead ends: 27 [2024-11-19 06:31:59,646 INFO L226 Difference]: Without dead ends: 27 [2024-11-19 06:31:59,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:31:59,648 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:31:59,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 61 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:31:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-19 06:31:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2024-11-19 06:31:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 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-19 06:31:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-19 06:31:59,657 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 8 [2024-11-19 06:31:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:31:59,658 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-19 06:31:59,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:31:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-19 06:31:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:31:59,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:31:59,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:31:59,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:31:59,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:31:59,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:31:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash 123169297, now seen corresponding path program 1 times [2024-11-19 06:31:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:31:59,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198899670] [2024-11-19 06:31:59,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:31:59,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:31:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:31:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:31:59,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:31:59,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198899670] [2024-11-19 06:31:59,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198899670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:31:59,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:31:59,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:31:59,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498320060] [2024-11-19 06:31:59,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:31:59,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:31:59,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:31:59,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:31:59,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:31:59,990 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:32:00,067 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-11-19 06:32:00,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:32:00,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 06:32:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:32:00,068 INFO L225 Difference]: With dead ends: 22 [2024-11-19 06:32:00,068 INFO L226 Difference]: Without dead ends: 22 [2024-11-19 06:32:00,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:32:00,070 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:32:00,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 45 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:32:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-19 06:32:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2024-11-19 06:32:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.3125) internal successors, (21), 17 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-19 06:32:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-19 06:32:00,078 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 8 [2024-11-19 06:32:00,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:32:00,079 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-19 06:32:00,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-19 06:32:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:32:00,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:32:00,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:32:00,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:32:00,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:32:00,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:32:00,082 INFO L85 PathProgramCache]: Analyzing trace with hash -533363702, now seen corresponding path program 1 times [2024-11-19 06:32:00,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:32:00,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285981646] [2024-11-19 06:32:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:32:00,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:32:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:32:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:32:00,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:32:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285981646] [2024-11-19 06:32:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285981646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:32:00,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:32:00,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:32:00,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267335220] [2024-11-19 06:32:00,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:32:00,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:32:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:32:00,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:32:00,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:32:00,153 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:32:00,171 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-11-19 06:32:00,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:32:00,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:32:00,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:32:00,172 INFO L225 Difference]: With dead ends: 23 [2024-11-19 06:32:00,172 INFO L226 Difference]: Without dead ends: 23 [2024-11-19 06:32:00,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:32:00,174 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:32:00,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 43 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:32:00,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-19 06:32:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2024-11-19 06:32:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-19 06:32:00,177 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2024-11-19 06:32:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:32:00,178 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-19 06:32:00,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:00,178 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-19 06:32:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:32:00,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:32:00,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:32:00,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:32:00,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:32:00,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:32:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash -476105400, now seen corresponding path program 1 times [2024-11-19 06:32:00,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:32:00,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730980743] [2024-11-19 06:32:00,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:32:00,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:32:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:32:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:32:00,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:32:00,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730980743] [2024-11-19 06:32:00,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730980743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:32:00,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:32:00,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:32:00,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722646040] [2024-11-19 06:32:00,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:32:00,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:32:00,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:32:00,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:32:00,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:32:00,274 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:32:00,305 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-11-19 06:32:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:32:00,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:32:00,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:32:00,307 INFO L225 Difference]: With dead ends: 21 [2024-11-19 06:32:00,308 INFO L226 Difference]: Without dead ends: 21 [2024-11-19 06:32:00,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:32:00,309 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:32:00,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:32:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-19 06:32:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-11-19 06:32:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.25) internal successors, (20), 17 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-19 06:32:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-11-19 06:32:00,318 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2024-11-19 06:32:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:32:00,318 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-11-19 06:32:00,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-11-19 06:32:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:32:00,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:32:00,321 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:32:00,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:32:00,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:32:00,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:32:00,322 INFO L85 PathProgramCache]: Analyzing trace with hash 837397877, now seen corresponding path program 1 times [2024-11-19 06:32:00,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:32:00,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320743015] [2024-11-19 06:32:00,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:32:00,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:32:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:32:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:32:00,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:32:00,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320743015] [2024-11-19 06:32:00,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320743015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:32:00,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:32:00,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:32:00,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549367608] [2024-11-19 06:32:00,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:32:00,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:32:00,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:32:00,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:32:00,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:32:00,435 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:00,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:32:00,463 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-11-19 06:32:00,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:32:00,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-19 06:32:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:32:00,465 INFO L225 Difference]: With dead ends: 24 [2024-11-19 06:32:00,465 INFO L226 Difference]: Without dead ends: 24 [2024-11-19 06:32:00,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:32:00,468 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:32:00,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:32:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-19 06:32:00,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-19 06:32:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1818181818181819) 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-19 06:32:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-19 06:32:00,481 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2024-11-19 06:32:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:32:00,482 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-19 06:32:00,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-19 06:32:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:32:00,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:32:00,482 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:32:00,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:32:00,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:32:00,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:32:00,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1517456247, now seen corresponding path program 1 times [2024-11-19 06:32:00,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:32:00,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347889405] [2024-11-19 06:32:00,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:32:00,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:32:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:32:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:32:00,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:32:00,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347889405] [2024-11-19 06:32:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347889405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:32:00,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95034462] [2024-11-19 06:32:00,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:32:00,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:32:00,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:32:00,990 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:32:00,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:32:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:32:01,066 WARN L253 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-19 06:32:01,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:32:01,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-19 06:32:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:32:01,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:32:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:32:01,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95034462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:32:01,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:32:01,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-11-19 06:32:01,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085274541] [2024-11-19 06:32:01,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:32:01,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 06:32:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:32:01,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 06:32:01,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2024-11-19 06:32:01,852 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:32:02,336 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-19 06:32:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:32:02,337 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-19 06:32:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:32:02,338 INFO L225 Difference]: With dead ends: 31 [2024-11-19 06:32:02,338 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 06:32:02,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2024-11-19 06:32:02,340 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:32:02,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 85 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:32:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 06:32:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-11-19 06:32:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-19 06:32:02,344 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 12 [2024-11-19 06:32:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:32:02,345 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-19 06:32:02,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-19 06:32:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:32:02,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:32:02,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:32:02,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:32:02,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:32:02,553 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:32:02,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:32:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1579061238, now seen corresponding path program 1 times [2024-11-19 06:32:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:32:02,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550305055] [2024-11-19 06:32:02,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:32:02,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:32:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:32:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:32:02,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:32:02,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550305055] [2024-11-19 06:32:02,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550305055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:32:02,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:32:02,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:32:02,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514256943] [2024-11-19 06:32:02,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:32:02,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:32:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:32:02,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:32:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:32:02,642 INFO L87 Difference]: Start difference. First operand 28 states and 31 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-19 06:32:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:32:02,652 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-19 06:32:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:32:02,653 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-19 06:32:02,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:32:02,654 INFO L225 Difference]: With dead ends: 27 [2024-11-19 06:32:02,654 INFO L226 Difference]: Without dead ends: 17 [2024-11-19 06:32:02,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:32:02,655 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:32:02,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:32:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-19 06:32:02,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-19 06:32:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:02,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-11-19 06:32:02,662 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2024-11-19 06:32:02,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:32:02,662 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-11-19 06:32:02,662 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-19 06:32:02,662 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-11-19 06:32:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:32:02,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:32:02,662 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:32:02,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:32:02,663 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:32:02,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:32:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2125629917, now seen corresponding path program 2 times [2024-11-19 06:32:02,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:32:02,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577710115] [2024-11-19 06:32:02,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:32:02,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:32:02,684 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:32:02,684 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:32:03,248 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-19 06:32:03,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:32:03,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577710115] [2024-11-19 06:32:03,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577710115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:32:03,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002219000] [2024-11-19 06:32:03,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:32:03,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:32:03,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:32:03,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:32:03,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:32:03,320 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:32:03,321 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:32:03,322 WARN L253 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-19 06:32:03,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:32:03,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-19 06:32:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:32:03,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:32:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:32:04,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002219000] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:32:04,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:32:04,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 32 [2024-11-19 06:32:04,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598462275] [2024-11-19 06:32:04,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:32:04,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 06:32:04,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:32:04,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 06:32:04,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 06:32:04,280 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:05,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:32:05,191 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-19 06:32:05,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 06:32:05,191 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 06:32:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:32:05,192 INFO L225 Difference]: With dead ends: 22 [2024-11-19 06:32:05,192 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 06:32:05,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=261, Invalid=2091, Unknown=0, NotChecked=0, Total=2352 [2024-11-19 06:32:05,193 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:32:05,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:32:05,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 06:32:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 06:32:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 06:32:05,194 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2024-11-19 06:32:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:32:05,195 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 06:32:05,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:32:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 06:32:05,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 06:32:05,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 3 remaining) [2024-11-19 06:32:05,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2024-11-19 06:32:05,199 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (0 of 3 remaining) [2024-11-19 06:32:05,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 06:32:05,402 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,SelfDestructingSolverStorable8 [2024-11-19 06:32:05,406 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:32:05,407 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:32:05,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:32:05 BoogieIcfgContainer [2024-11-19 06:32:05,410 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:32:05,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:32:05,411 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:32:05,411 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:32:05,412 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:31:58" (3/4) ... [2024-11-19 06:32:05,414 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 06:32:05,421 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-19 06:32:05,422 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 06:32:05,422 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-19 06:32:05,422 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 06:32:05,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:32:05,497 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 06:32:05,497 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:32:05,497 INFO L158 Benchmark]: Toolchain (without parser) took 8004.96ms. Allocated memory was 174.1MB in the beginning and 220.2MB in the end (delta: 46.1MB). Free memory was 121.0MB in the beginning and 67.1MB in the end (delta: 53.8MB). Peak memory consumption was 102.6MB. Max. memory is 16.1GB. [2024-11-19 06:32:05,498 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 125.8MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:32:05,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.98ms. Allocated memory is still 174.1MB. Free memory was 120.5MB in the beginning and 102.1MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 06:32:05,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.93ms. Allocated memory is still 174.1MB. Free memory was 102.1MB in the beginning and 100.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:32:05,499 INFO L158 Benchmark]: Boogie Preprocessor took 57.41ms. Allocated memory is still 174.1MB. Free memory was 100.0MB in the beginning and 98.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:32:05,499 INFO L158 Benchmark]: RCFGBuilder took 426.26ms. Allocated memory is still 174.1MB. Free memory was 98.4MB in the beginning and 138.0MB in the end (delta: -39.5MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-19 06:32:05,500 INFO L158 Benchmark]: TraceAbstraction took 6933.77ms. Allocated memory was 174.1MB in the beginning and 220.2MB in the end (delta: 46.1MB). Free memory was 136.9MB in the beginning and 72.0MB in the end (delta: 65.0MB). Peak memory consumption was 112.7MB. Max. memory is 16.1GB. [2024-11-19 06:32:05,500 INFO L158 Benchmark]: Witness Printer took 85.95ms. Allocated memory is still 220.2MB. Free memory was 72.0MB in the beginning and 67.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 06:32:05,501 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.09ms. Allocated memory is still 125.8MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.98ms. Allocated memory is still 174.1MB. Free memory was 120.5MB in the beginning and 102.1MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.93ms. Allocated memory is still 174.1MB. Free memory was 102.1MB in the beginning and 100.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.41ms. Allocated memory is still 174.1MB. Free memory was 100.0MB in the beginning and 98.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 426.26ms. Allocated memory is still 174.1MB. Free memory was 98.4MB in the beginning and 138.0MB in the end (delta: -39.5MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6933.77ms. Allocated memory was 174.1MB in the beginning and 220.2MB in the end (delta: 46.1MB). Free memory was 136.9MB in the beginning and 72.0MB in the end (delta: 65.0MB). Peak memory consumption was 112.7MB. Max. memory is 16.1GB. * Witness Printer took 85.95ms. Allocated memory is still 220.2MB. Free memory was 72.0MB in the beginning and 67.1MB in the end (delta: 4.8MB). 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: 523]: 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, 19 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 472 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 362 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 615 IncrementalHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 110 mSDtfsCounter, 615 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=7, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1338 SizeOfPredicates, 11 NumberOfNonLiveVariables, 187 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 3/32 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 06:32:05,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE