./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext3/getNumbers2.c --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/memsafety-ext3/getNumbers2.c -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 cf0bb070a6f67963fcaf42c16427fd9b591ad6ca597a21a650e9cf23fa51a6dd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:45:13,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:45:13,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:45:13,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:45:13,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:45:13,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:45:13,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:45:13,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:45:13,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:45:13,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:45:13,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:45:13,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:45:13,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:45:13,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:45:13,206 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:45:13,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:45:13,207 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:45:13,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:45:13,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:45:13,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:45:13,208 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:45:13,209 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:45:13,209 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:45:13,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:45:13,210 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:45:13,211 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:45:13,211 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:45:13,211 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:45:13,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:45:13,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:45:13,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:45:13,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:45:13,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:45:13,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:45:13,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:45:13,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:45:13,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:45:13,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:45:13,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:45:13,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:45:13,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:45:13,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:45:13,221 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 -> cf0bb070a6f67963fcaf42c16427fd9b591ad6ca597a21a650e9cf23fa51a6dd [2024-11-19 06:45:13,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:45:13,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:45:13,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:45:13,498 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:45:13,498 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:45:13,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2024-11-19 06:45:15,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:45:15,199 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:45:15,200 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext3/getNumbers2.c [2024-11-19 06:45:15,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c39f302/366b3b03776f47548c229f6eb0948b1a/FLAG00ff9b571 [2024-11-19 06:45:15,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c39f302/366b3b03776f47548c229f6eb0948b1a [2024-11-19 06:45:15,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:45:15,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:45:15,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:45:15,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:45:15,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:45:15,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:45:15" (1/1) ... [2024-11-19 06:45:15,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4593878f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:15, skipping insertion in model container [2024-11-19 06:45:15,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:45:15" (1/1) ... [2024-11-19 06:45:15,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:45:15,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:45:15,440 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:45:15,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:45:15,470 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:45:15,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:15 WrapperNode [2024-11-19 06:45:15,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:45:15,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:45:15,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:45:15,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:45:15,478 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:45:15" (1/1) ... [2024-11-19 06:45:15,484 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:45:15" (1/1) ... [2024-11-19 06:45:15,503 INFO L138 Inliner]: procedures = 11, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2024-11-19 06:45:15,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:45:15,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:45:15,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:45:15,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:45:15,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:15" (1/1) ... [2024-11-19 06:45:15,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:15" (1/1) ... [2024-11-19 06:45:15,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:15" (1/1) ... [2024-11-19 06:45:15,532 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [12, 2]. 86 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [10, 0]. The 3 writes are split as follows [1, 2]. [2024-11-19 06:45:15,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:15" (1/1) ... [2024-11-19 06:45:15,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:15" (1/1) ... [2024-11-19 06:45:15,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:15" (1/1) ... [2024-11-19 06:45:15,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:15" (1/1) ... [2024-11-19 06:45:15,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:15" (1/1) ... [2024-11-19 06:45:15,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:15" (1/1) ... [2024-11-19 06:45:15,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:45:15,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:45:15,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:45:15,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:45:15,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:15" (1/1) ... [2024-11-19 06:45:15,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:45:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:15,586 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:45:15,593 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:45:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 06:45:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 06:45:15,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:45:15,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:45:15,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:45:15,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 06:45:15,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 06:45:15,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:45:15,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:45:15,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:45:15,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:45:15,732 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:45:15,735 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:45:15,949 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-19 06:45:15,949 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:45:15,965 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:45:15,966 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:45:15,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:45:15 BoogieIcfgContainer [2024-11-19 06:45:15,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:45:15,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:45:15,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:45:15,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:45:15,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:45:15" (1/3) ... [2024-11-19 06:45:15,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5c7e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:45:15, skipping insertion in model container [2024-11-19 06:45:15,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:45:15" (2/3) ... [2024-11-19 06:45:15,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5c7e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:45:15, skipping insertion in model container [2024-11-19 06:45:15,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:45:15" (3/3) ... [2024-11-19 06:45:15,978 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers2.c [2024-11-19 06:45:15,995 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:45:15,996 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-19 06:45:16,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:45:16,084 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;@cdc168f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:45:16,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-19 06:45:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.7222222222222223) 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:45:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:45:16,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:16,096 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:45:16,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:16,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:16,107 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2024-11-19 06:45:16,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:16,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235459205] [2024-11-19 06:45:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:16,375 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:45:16,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:16,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235459205] [2024-11-19 06:45:16,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235459205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:16,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:16,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 06:45:16,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2756419] [2024-11-19 06:45:16,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:16,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:45:16,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:16,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:45:16,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:16,412 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.7222222222222223) 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:16,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:16,471 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-11-19 06:45:16,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:45:16,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:45:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:16,481 INFO L225 Difference]: With dead ends: 27 [2024-11-19 06:45:16,482 INFO L226 Difference]: Without dead ends: 25 [2024-11-19 06:45:16,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:16,488 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:16,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:16,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-19 06:45:16,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-19 06:45:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 24 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:45:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-19 06:45:16,526 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 4 [2024-11-19 06:45:16,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:16,526 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-19 06:45:16,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-11-19 06:45:16,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:45:16,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:16,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:45:16,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:45:16,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:16,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:16,530 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2024-11-19 06:45:16,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:16,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764361036] [2024-11-19 06:45:16,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:16,720 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:45:16,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:16,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764361036] [2024-11-19 06:45:16,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764361036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:16,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:16,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:45:16,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347438406] [2024-11-19 06:45:16,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:16,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:45:16,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:16,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:45:16,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:45:16,725 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:16,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:16,774 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-19 06:45:16,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:45:16,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:45:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:16,778 INFO L225 Difference]: With dead ends: 28 [2024-11-19 06:45:16,778 INFO L226 Difference]: Without dead ends: 28 [2024-11-19 06:45:16,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:45:16,779 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:16,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:16,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-19 06:45:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-19 06:45:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 26 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-19 06:45:16,789 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 4 [2024-11-19 06:45:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:16,790 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-19 06:45:16,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-19 06:45:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:45:16,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:16,794 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-19 06:45:16,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:45:16,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:16,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:16,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1809646286, now seen corresponding path program 1 times [2024-11-19 06:45:16,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:16,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351414240] [2024-11-19 06:45:16,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:16,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:17,055 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:45:17,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:17,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351414240] [2024-11-19 06:45:17,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351414240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:17,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240388566] [2024-11-19 06:45:17,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:17,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:17,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:17,060 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:45:17,061 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:45:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:17,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:45:17,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:17,307 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:45:17,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:17,419 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:45:17,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240388566] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:17,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:17,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-11-19 06:45:17,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576649923] [2024-11-19 06:45:17,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:17,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:45:17,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:17,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:45:17,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:45:17,435 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:45:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:17,661 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-19 06:45:17,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:45:17,662 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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) Word has length 7 [2024-11-19 06:45:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:17,664 INFO L225 Difference]: With dead ends: 34 [2024-11-19 06:45:17,664 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 06:45:17,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:45:17,668 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 72 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:17,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 46 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 06:45:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-19 06:45:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-19 06:45:17,677 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 7 [2024-11-19 06:45:17,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:17,677 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-19 06:45:17,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:45:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-11-19 06:45:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 06:45:17,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:17,680 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:17,699 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:45:17,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:17,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:17,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:17,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2129139286, now seen corresponding path program 1 times [2024-11-19 06:45:17,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:17,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277518310] [2024-11-19 06:45:17,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:17,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:18,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:18,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277518310] [2024-11-19 06:45:18,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277518310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:18,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600623600] [2024-11-19 06:45:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:18,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:18,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:18,057 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:45:18,061 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:45:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:18,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:45:18,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:18,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:45:18,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600623600] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:18,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:18,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-19 06:45:18,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953832927] [2024-11-19 06:45:18,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:18,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:45:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:18,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:45:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:45:18,279 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:18,343 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2024-11-19 06:45:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:45:18,344 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-19 06:45:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:18,346 INFO L225 Difference]: With dead ends: 52 [2024-11-19 06:45:18,346 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 06:45:18,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:45:18,347 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:18,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 06:45:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-19 06:45:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2024-11-19 06:45:18,353 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 19 [2024-11-19 06:45:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:18,353 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2024-11-19 06:45:18,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2024-11-19 06:45:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:45:18,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:18,355 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:18,372 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:45:18,559 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,SelfDestructingSolverStorable3 [2024-11-19 06:45:18,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:18,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:18,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069290, now seen corresponding path program 2 times [2024-11-19 06:45:18,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:18,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471012787] [2024-11-19 06:45:18,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:45:18,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:18,590 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:45:18,590 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:45:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:18,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:18,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471012787] [2024-11-19 06:45:18,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471012787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:18,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:18,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:18,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706088663] [2024-11-19 06:45:18,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:18,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:45:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:18,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:45:18,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:45:18,741 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:18,812 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2024-11-19 06:45:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:45:18,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-19 06:45:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:18,814 INFO L225 Difference]: With dead ends: 58 [2024-11-19 06:45:18,814 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 06:45:18,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:45:18,815 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:18,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 06:45:18,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2024-11-19 06:45:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2024-11-19 06:45:18,820 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 37 [2024-11-19 06:45:18,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:18,821 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2024-11-19 06:45:18,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:18,821 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2024-11-19 06:45:18,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:45:18,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:18,822 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:18,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:45:18,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:18,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:18,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1224069289, now seen corresponding path program 1 times [2024-11-19 06:45:18,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:18,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268245063] [2024-11-19 06:45:18,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:18,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:19,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:19,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268245063] [2024-11-19 06:45:19,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268245063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:19,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:19,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:45:19,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025404072] [2024-11-19 06:45:19,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:19,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:45:19,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:19,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:45:19,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:45:19,048 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:19,104 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2024-11-19 06:45:19,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:45:19,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-19 06:45:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:19,106 INFO L225 Difference]: With dead ends: 53 [2024-11-19 06:45:19,106 INFO L226 Difference]: Without dead ends: 53 [2024-11-19 06:45:19,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:45:19,107 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:19,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 34 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:19,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-19 06:45:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-19 06:45:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.148936170212766) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2024-11-19 06:45:19,116 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 37 [2024-11-19 06:45:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:19,118 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2024-11-19 06:45:19,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2024-11-19 06:45:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 06:45:19,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:19,119 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:19,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:45:19,119 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:19,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:19,119 INFO L85 PathProgramCache]: Analyzing trace with hash -708557702, now seen corresponding path program 1 times [2024-11-19 06:45:19,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:19,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268799732] [2024-11-19 06:45:19,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:19,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:19,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:19,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268799732] [2024-11-19 06:45:19,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268799732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:19,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:19,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:45:19,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562092866] [2024-11-19 06:45:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:19,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:45:19,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:19,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:45:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:19,206 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:19,232 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2024-11-19 06:45:19,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:45:19,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-19 06:45:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:19,233 INFO L225 Difference]: With dead ends: 52 [2024-11-19 06:45:19,233 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 06:45:19,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:19,234 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 25 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:45:19,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 25 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:19,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 06:45:19,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-19 06:45:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.127659574468085) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2024-11-19 06:45:19,238 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 38 [2024-11-19 06:45:19,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:19,239 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2024-11-19 06:45:19,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2024-11-19 06:45:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 06:45:19,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:19,240 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:19,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:45:19,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:19,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:19,241 INFO L85 PathProgramCache]: Analyzing trace with hash -708557701, now seen corresponding path program 1 times [2024-11-19 06:45:19,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:19,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949950594] [2024-11-19 06:45:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:19,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:19,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:19,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949950594] [2024-11-19 06:45:19,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949950594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:45:19,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:45:19,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:45:19,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638984357] [2024-11-19 06:45:19,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:45:19,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:45:19,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:19,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:45:19,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:19,365 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:19,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:19,388 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2024-11-19 06:45:19,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:45:19,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-19 06:45:19,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:19,389 INFO L225 Difference]: With dead ends: 55 [2024-11-19 06:45:19,389 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 06:45:19,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:45:19,390 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:19,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:19,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 06:45:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-11-19 06:45:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.125) internal successors, (54), 52 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2024-11-19 06:45:19,400 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 38 [2024-11-19 06:45:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:19,401 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2024-11-19 06:45:19,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2024-11-19 06:45:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:45:19,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:19,402 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:19,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:45:19,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:19,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:19,403 INFO L85 PathProgramCache]: Analyzing trace with hash 414994334, now seen corresponding path program 1 times [2024-11-19 06:45:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:19,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075513448] [2024-11-19 06:45:19,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:19,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:19,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:19,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075513448] [2024-11-19 06:45:19,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075513448] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:19,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179930450] [2024-11-19 06:45:19,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:19,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:19,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:19,718 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:19,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:45:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:19,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 06:45:19,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:20,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:45:20,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:45:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:20,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:20,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179930450] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:20,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:20,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2024-11-19 06:45:20,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432906186] [2024-11-19 06:45:20,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:20,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:45:20,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:20,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:45:20,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:45:20,958 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:21,162 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2024-11-19 06:45:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:45:21,163 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-19 06:45:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:21,163 INFO L225 Difference]: With dead ends: 67 [2024-11-19 06:45:21,163 INFO L226 Difference]: Without dead ends: 67 [2024-11-19 06:45:21,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:45:21,174 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 49 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:21,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 51 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-19 06:45:21,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-19 06:45:21,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:45:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2024-11-19 06:45:21,180 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 42 [2024-11-19 06:45:21,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:21,181 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2024-11-19 06:45:21,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2024-11-19 06:45:21,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 06:45:21,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:21,182 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:21,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 06:45:21,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:21,384 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:21,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:21,384 INFO L85 PathProgramCache]: Analyzing trace with hash -20077561, now seen corresponding path program 1 times [2024-11-19 06:45:21,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:21,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748675264] [2024-11-19 06:45:21,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:21,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:21,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:21,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748675264] [2024-11-19 06:45:21,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748675264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:21,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540063604] [2024-11-19 06:45:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:21,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:21,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:21,553 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:21,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:45:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:21,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:45:21,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:21,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:45:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:21,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:21,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540063604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:21,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:21,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-19 06:45:21,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923252351] [2024-11-19 06:45:21,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:21,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:45:21,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:21,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:45:21,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:45:21,773 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:21,847 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2024-11-19 06:45:21,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:45:21,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-19 06:45:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:21,848 INFO L225 Difference]: With dead ends: 68 [2024-11-19 06:45:21,848 INFO L226 Difference]: Without dead ends: 68 [2024-11-19 06:45:21,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:45:21,849 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:21,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 44 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-19 06:45:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-19 06:45:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.126984126984127) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:45:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-11-19 06:45:21,859 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 43 [2024-11-19 06:45:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:21,859 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-11-19 06:45:21,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-11-19 06:45:21,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 06:45:21,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:21,860 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:21,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:45:22,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:22,061 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:22,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:22,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1223382792, now seen corresponding path program 1 times [2024-11-19 06:45:22,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:22,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394033257] [2024-11-19 06:45:22,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:22,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:22,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:22,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394033257] [2024-11-19 06:45:22,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394033257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:22,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313110177] [2024-11-19 06:45:22,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:45:22,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:22,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:22,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:22,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:45:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:45:22,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:45:22,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:22,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:22,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313110177] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:22,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:22,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-19 06:45:22,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052377384] [2024-11-19 06:45:22,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:22,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:45:22,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:22,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:45:22,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:45:22,323 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:22,371 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2024-11-19 06:45:22,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:45:22,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-19 06:45:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:22,372 INFO L225 Difference]: With dead ends: 76 [2024-11-19 06:45:22,372 INFO L226 Difference]: Without dead ends: 76 [2024-11-19 06:45:22,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:45:22,373 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:22,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-19 06:45:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-19 06:45:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2024-11-19 06:45:22,378 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 49 [2024-11-19 06:45:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:22,378 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2024-11-19 06:45:22,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2024-11-19 06:45:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 06:45:22,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:22,379 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:22,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:45:22,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 06:45:22,581 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:22,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:22,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1470341546, now seen corresponding path program 2 times [2024-11-19 06:45:22,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:22,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368643152] [2024-11-19 06:45:22,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:45:22,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:22,610 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:45:22,610 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:45:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:23,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:23,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368643152] [2024-11-19 06:45:23,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368643152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:23,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852795647] [2024-11-19 06:45:23,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:45:23,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:23,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:23,016 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:23,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:45:23,108 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:45:23,109 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:45:23,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 06:45:23,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:23,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:45:23,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:45:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:23,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:24,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852795647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:24,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:24,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2024-11-19 06:45:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579241663] [2024-11-19 06:45:24,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:24,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-19 06:45:24,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 06:45:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-11-19 06:45:24,376 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 24 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:24,984 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2024-11-19 06:45:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:45:24,984 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-19 06:45:24,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:24,986 INFO L225 Difference]: With dead ends: 95 [2024-11-19 06:45:24,986 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 06:45:24,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2024-11-19 06:45:24,988 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 178 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:24,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 119 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:45:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 06:45:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2024-11-19 06:45:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:45:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2024-11-19 06:45:24,999 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 57 [2024-11-19 06:45:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:24,999 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2024-11-19 06:45:24,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 23 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2024-11-19 06:45:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-19 06:45:25,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:25,000 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:25,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 06:45:25,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:25,201 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:25,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:25,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1664052357, now seen corresponding path program 2 times [2024-11-19 06:45:25,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:25,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507472920] [2024-11-19 06:45:25,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:45:25,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:25,213 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:45:25,214 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:45:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-11-19 06:45:25,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:25,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507472920] [2024-11-19 06:45:25,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507472920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:25,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300848956] [2024-11-19 06:45:25,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:45:25,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:25,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:25,307 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:25,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:45:25,379 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:45:25,379 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:45:25,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 06:45:25,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:25,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:45:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-11-19 06:45:25,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-11-19 06:45:26,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300848956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:26,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:26,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-19 06:45:26,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978736645] [2024-11-19 06:45:26,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:26,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:45:26,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:26,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:45:26,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:45:26,005 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:26,083 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2024-11-19 06:45:26,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:45:26,084 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-19 06:45:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:26,084 INFO L225 Difference]: With dead ends: 74 [2024-11-19 06:45:26,084 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 06:45:26,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:45:26,085 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:26,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 37 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:45:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 06:45:26,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-19 06:45:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 71 states have (on average 1.056338028169014) internal successors, (75), 73 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:26,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2024-11-19 06:45:26,090 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 58 [2024-11-19 06:45:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:26,090 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2024-11-19 06:45:26,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:45:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2024-11-19 06:45:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-19 06:45:26,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:26,091 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:26,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 06:45:26,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:26,292 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:26,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash 579926520, now seen corresponding path program 2 times [2024-11-19 06:45:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:26,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325131205] [2024-11-19 06:45:26,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:45:26,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:26,317 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:45:26,318 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:45:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:26,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:45:26,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325131205] [2024-11-19 06:45:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325131205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:45:26,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409753760] [2024-11-19 06:45:26,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:45:26,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:45:26,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:45:26,475 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:45:26,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 06:45:26,581 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:45:26,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:45:26,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:45:26,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:45:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:26,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:45:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 06:45:26,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409753760] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:45:26,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:45:26,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2024-11-19 06:45:26,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959842798] [2024-11-19 06:45:26,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:45:26,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:45:26,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:45:26,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:45:26,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:45:26,711 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:45:26,771 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2024-11-19 06:45:26,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:45:26,772 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 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 69 [2024-11-19 06:45:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:45:26,772 INFO L225 Difference]: With dead ends: 94 [2024-11-19 06:45:26,772 INFO L226 Difference]: Without dead ends: 94 [2024-11-19 06:45:26,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:45:26,773 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:45:26,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:45:26,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-19 06:45:26,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-19 06:45:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 91 states have (on average 1.043956043956044) internal successors, (95), 93 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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:45:26,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2024-11-19 06:45:26,777 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 69 [2024-11-19 06:45:26,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:45:26,777 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2024-11-19 06:45:26,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:26,777 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2024-11-19 06:45:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 06:45:26,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:45:26,778 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:26,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 06:45:26,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 06:45:26,983 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-19 06:45:26,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:45:26,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1572522744, now seen corresponding path program 3 times [2024-11-19 06:45:26,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:45:26,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196203921] [2024-11-19 06:45:26,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:45:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:45:27,088 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 06:45:27,088 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 06:45:27,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:45:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:45:27,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:45:27,152 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:45:27,153 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2024-11-19 06:45:27,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2024-11-19 06:45:27,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2024-11-19 06:45:27,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2024-11-19 06:45:27,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2024-11-19 06:45:27,155 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2024-11-19 06:45:27,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2024-11-19 06:45:27,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2024-11-19 06:45:27,156 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2024-11-19 06:45:27,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:45:27,159 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 06:45:27,219 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:45:27,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:45:27 BoogieIcfgContainer [2024-11-19 06:45:27,221 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:45:27,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:45:27,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:45:27,222 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:45:27,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:45:15" (3/4) ... [2024-11-19 06:45:27,223 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 06:45:27,292 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:45:27,292 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:45:27,293 INFO L158 Benchmark]: Toolchain (without parser) took 12066.34ms. Allocated memory was 142.6MB in the beginning and 287.3MB in the end (delta: 144.7MB). Free memory was 91.7MB in the beginning and 164.7MB in the end (delta: -73.0MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2024-11-19 06:45:27,293 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 103.5MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:45:27,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.13ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 79.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 06:45:27,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.00ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 77.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:45:27,296 INFO L158 Benchmark]: Boogie Preprocessor took 40.96ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 75.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:45:27,296 INFO L158 Benchmark]: RCFGBuilder took 420.91ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 62.8MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 06:45:27,296 INFO L158 Benchmark]: TraceAbstraction took 11252.30ms. Allocated memory was 142.6MB in the beginning and 287.3MB in the end (delta: 144.7MB). Free memory was 62.3MB in the beginning and 168.9MB in the end (delta: -106.7MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-11-19 06:45:27,296 INFO L158 Benchmark]: Witness Printer took 70.30ms. Allocated memory is still 287.3MB. Free memory was 168.9MB in the beginning and 164.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 06:45:27,298 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.19ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 103.5MB in the end (delta: 151.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.13ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 79.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.00ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 77.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.96ms. Allocated memory is still 142.6MB. Free memory was 77.8MB in the beginning and 75.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 420.91ms. Allocated memory is still 142.6MB. Free memory was 75.8MB in the beginning and 62.8MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11252.30ms. Allocated memory was 142.6MB in the beginning and 287.3MB in the end (delta: 144.7MB). Free memory was 62.3MB in the beginning and 168.9MB in the end (delta: -106.7MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * Witness Printer took 70.30ms. Allocated memory is still 287.3MB. Free memory was 168.9MB in the beginning and 164.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; [L1] int array[10]; VAL [array={1:0}] [L25] CALL, EXPR getNumbers2() [L13] CALL, EXPR getNumbers() [L5] int i = 0; VAL [array={1:0}, i=0] [L5] COND TRUE i < 10 VAL [array={1:0}, i=0] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=1] [L5] COND TRUE i < 10 VAL [array={1:0}, i=1] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=2] [L5] COND TRUE i < 10 VAL [array={1:0}, i=2] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=3] [L5] COND TRUE i < 10 VAL [array={1:0}, i=3] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=4] [L5] COND TRUE i < 10 VAL [array={1:0}, i=4] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=5] [L5] COND TRUE i < 10 VAL [array={1:0}, i=5] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=6] [L5] COND TRUE i < 10 VAL [array={1:0}, i=6] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=7] [L5] COND TRUE i < 10 VAL [array={1:0}, i=7] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=8] [L5] COND TRUE i < 10 VAL [array={1:0}, i=8] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=9] [L5] COND TRUE i < 10 VAL [array={1:0}, i=9] [L6] array[i] = i VAL [array={1:0}] [L5] ++i VAL [array={1:0}, i=10] [L5] COND FALSE !(i < 10) VAL [array={1:0}] [L9] return array; VAL [\result={1:0}, array={1:0}] [L13] RET, EXPR getNumbers() [L13] int* numbers = getNumbers(); [L15] int numbers2[10]; [L17] int i = 0; VAL [array={1:0}, i=0, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=0, numbers2={10:0}, numbers={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=1, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=1, numbers2={10:0}, numbers={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=2, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=2, numbers2={10:0}, numbers={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=3, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=3, numbers2={10:0}, numbers={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=4, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=4, numbers2={10:0}, numbers={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=5, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=5, numbers2={10:0}, numbers={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=6, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=6, numbers2={10:0}, numbers={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=7, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=7, numbers2={10:0}, numbers={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=8, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=8, numbers2={10:0}, numbers={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=9, numbers2={10:0}, numbers={1:0}] [L17] COND TRUE i < 10 VAL [array={1:0}, i=9, numbers2={10:0}, numbers={1:0}] [L18] EXPR numbers[i] VAL [array={1:0}] [L18] numbers2[i] = numbers[i] VAL [array={1:0}] [L17] ++i VAL [array={1:0}, i=10, numbers2={10:0}, numbers={1:0}] [L17] COND FALSE !(i < 10) VAL [array={1:0}, numbers2={10:0}, numbers={1:0}] [L21] return numbers2; [L21] return numbers2; VAL [\result={10:0}, array={1:0}, numbers={1:0}] [L25] RET, EXPR getNumbers2() [L25] int *numbers = getNumbers2(); [L26] numbers[0] = 100 - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 15, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 647 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 423 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 879 IncrementalHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 224 mSDtfsCounter, 879 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 765 GetRequests, 625 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=14, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 935 NumberOfCodeBlocks, 805 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1160 ConstructedInterpolants, 68 QuantifiedInterpolants, 9625 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1356 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 3315/3781 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-19 06:45:27,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)