./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ddb0eb207fb72f46b2f9a0f11e334a77be9b4b455314fd1b26a90347e4178746 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:48:50,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:48:50,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-14 17:48:50,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:48:50,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:48:50,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:48:50,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:48:50,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:48:50,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:48:50,246 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:48:50,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:48:50,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:48:50,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:48:50,247 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:48:50,248 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:48:50,248 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:48:50,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:48:50,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:48:50,249 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:48:50,252 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:48:50,252 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:48:50,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:48:50,253 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:48:50,253 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:48:50,253 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:48:50,253 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:48:50,254 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:48:50,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:48:50,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:48:50,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:48:50,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:48:50,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:48:50,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:48:50,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:48:50,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:48:50,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:48:50,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:48:50,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:48:50,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:48:50,257 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ddb0eb207fb72f46b2f9a0f11e334a77be9b4b455314fd1b26a90347e4178746 [2024-10-14 17:48:50,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:48:50,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:48:50,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:48:50,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:48:50,554 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:48:50,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i [2024-10-14 17:48:52,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:48:52,282 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:48:52,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i [2024-10-14 17:48:52,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c34e5ab/fcfbbe209a1f41ed88f007c4a9398586/FLAG4a3d73ea8 [2024-10-14 17:48:52,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8c34e5ab/fcfbbe209a1f41ed88f007c4a9398586 [2024-10-14 17:48:52,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:48:52,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:48:52,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:48:52,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:48:52,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:48:52,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5d01a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52, skipping insertion in model container [2024-10-14 17:48:52,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:48:52,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:48:52,696 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:48:52,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:48:52,777 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:48:52,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52 WrapperNode [2024-10-14 17:48:52,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:48:52,779 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:48:52,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:48:52,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:48:52,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,816 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2024-10-14 17:48:52,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:48:52,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:48:52,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:48:52,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:48:52,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,850 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [2, 1]. [2024-10-14 17:48:52,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:48:52,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:48:52,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:48:52,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:48:52,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52" (1/1) ... [2024-10-14 17:48:52,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:48:52,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:48:52,901 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-10-14 17:48:52,904 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-10-14 17:48:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 17:48:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 17:48:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 17:48:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 17:48:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:48:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:48:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:48:52,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:48:53,042 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:48:53,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:48:53,192 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-14 17:48:53,192 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:48:53,282 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:48:53,282 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 17:48:53,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:48:53 BoogieIcfgContainer [2024-10-14 17:48:53,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:48:53,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:48:53,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:48:53,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:48:53,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:48:52" (1/3) ... [2024-10-14 17:48:53,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5c3333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:48:53, skipping insertion in model container [2024-10-14 17:48:53,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:48:52" (2/3) ... [2024-10-14 17:48:53,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5c3333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:48:53, skipping insertion in model container [2024-10-14 17:48:53,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:48:53" (3/3) ... [2024-10-14 17:48:53,301 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-2.i [2024-10-14 17:48:53,316 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:48:53,317 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-10-14 17:48:53,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:48:53,374 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;@29c127d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:48:53,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-14 17:48:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 2.0) internal successors, (34), 26 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-10-14 17:48:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:48:53,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:53,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:48:53,390 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-10-14 17:48:53,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash 98976755, now seen corresponding path program 1 times [2024-10-14 17:48:53,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:53,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139228976] [2024-10-14 17:48:53,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:53,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:53,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:53,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139228976] [2024-10-14 17:48:53,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139228976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:53,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:53,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:48:53,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804447041] [2024-10-14 17:48:53,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:53,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:48:53,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:53,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:48:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:48:53,699 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 2.0) internal successors, (34), 26 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:53,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:53,743 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-10-14 17:48:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:48:53,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:48:53,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:53,752 INFO L225 Difference]: With dead ends: 26 [2024-10-14 17:48:53,752 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 17:48:53,753 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-10-14 17:48:53,758 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:53,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:53,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 17:48:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-14 17:48:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-10-14 17:48:53,787 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 5 [2024-10-14 17:48:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:53,787 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-14 17:48:53,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-10-14 17:48:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:48:53,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:53,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:48:53,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:48:53,789 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-10-14 17:48:53,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:53,792 INFO L85 PathProgramCache]: Analyzing trace with hash 98976756, now seen corresponding path program 1 times [2024-10-14 17:48:53,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:53,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214406599] [2024-10-14 17:48:53,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:53,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:54,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:54,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214406599] [2024-10-14 17:48:54,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214406599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:54,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:54,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:48:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651795972] [2024-10-14 17:48:54,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:54,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:48:54,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:54,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:48:54,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:54,094 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:54,125 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-10-14 17:48:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:48:54,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:48:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:54,127 INFO L225 Difference]: With dead ends: 28 [2024-10-14 17:48:54,127 INFO L226 Difference]: Without dead ends: 28 [2024-10-14 17:48:54,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:54,129 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 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-10-14 17:48:54,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-14 17:48:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-14 17:48:54,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 27 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-10-14 17:48:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-14 17:48:54,137 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 5 [2024-10-14 17:48:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:54,138 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-14 17:48:54,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:54,138 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-14 17:48:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 17:48:54,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:54,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 17:48:54,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:48:54,139 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-10-14 17:48:54,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:54,141 INFO L85 PathProgramCache]: Analyzing trace with hash 99036338, now seen corresponding path program 1 times [2024-10-14 17:48:54,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:54,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463595900] [2024-10-14 17:48:54,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:54,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:54,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:54,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463595900] [2024-10-14 17:48:54,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463595900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:54,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:54,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:48:54,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193159218] [2024-10-14 17:48:54,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:54,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:48:54,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:54,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:48:54,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:54,348 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:54,373 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2024-10-14 17:48:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:48:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 17:48:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:54,375 INFO L225 Difference]: With dead ends: 27 [2024-10-14 17:48:54,376 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 17:48:54,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:54,378 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:54,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 17:48:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-10-14 17:48:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 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-10-14 17:48:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-10-14 17:48:54,383 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 5 [2024-10-14 17:48:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:54,384 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-10-14 17:48:54,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-10-14 17:48:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:48:54,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:54,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:54,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:48:54,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:48:54,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2024230353, now seen corresponding path program 1 times [2024-10-14 17:48:54,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:54,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999284902] [2024-10-14 17:48:54,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:54,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:54,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:54,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999284902] [2024-10-14 17:48:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999284902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:54,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:48:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567256240] [2024-10-14 17:48:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:54,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:48:54,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:54,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:48:54,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:54,484 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:54,523 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-14 17:48:54,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:48:54,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:48:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:54,525 INFO L225 Difference]: With dead ends: 36 [2024-10-14 17:48:54,527 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 17:48:54,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:54,528 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:54,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 63 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 17:48:54,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2024-10-14 17:48:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.6) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-14 17:48:54,545 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 8 [2024-10-14 17:48:54,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:54,545 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-14 17:48:54,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:54,545 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-14 17:48:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:48:54,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:54,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:54,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:48:54,546 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:48:54,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:54,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2024274293, now seen corresponding path program 1 times [2024-10-14 17:48:54,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:54,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797949027] [2024-10-14 17:48:54,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:54,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:54,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:54,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797949027] [2024-10-14 17:48:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797949027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:54,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:54,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:48:54,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146921918] [2024-10-14 17:48:54,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:54,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:48:54,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:54,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:48:54,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:54,661 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:54,724 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-10-14 17:48:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:48:54,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:48:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:54,725 INFO L225 Difference]: With dead ends: 27 [2024-10-14 17:48:54,725 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 17:48:54,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:48:54,726 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:54,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 47 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:48:54,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 17:48:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-10-14 17:48:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.55) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:54,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-10-14 17:48:54,733 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 8 [2024-10-14 17:48:54,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:54,734 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-10-14 17:48:54,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:54,735 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-10-14 17:48:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:48:54,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:54,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:54,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:48:54,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:48:54,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:54,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2024274292, now seen corresponding path program 1 times [2024-10-14 17:48:54,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:54,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913964617] [2024-10-14 17:48:54,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:54,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:54,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:54,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913964617] [2024-10-14 17:48:54,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913964617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:54,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:54,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:48:54,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507445906] [2024-10-14 17:48:54,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:54,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:48:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:54,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:48:54,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:48:54,941 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:54,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:54,990 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-10-14 17:48:54,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:48:54,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:48:54,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:54,991 INFO L225 Difference]: With dead ends: 29 [2024-10-14 17:48:54,991 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 17:48:54,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:48:54,992 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:54,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 80 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 17:48:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-10-14 17:48:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:54,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-10-14 17:48:54,995 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 8 [2024-10-14 17:48:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:54,995 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-14 17:48:54,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-10-14 17:48:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:48:54,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:54,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:54,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:48:54,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:48:54,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1966972051, now seen corresponding path program 1 times [2024-10-14 17:48:54,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:54,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323776388] [2024-10-14 17:48:54,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:54,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:55,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:55,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323776388] [2024-10-14 17:48:55,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323776388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:55,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:55,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:48:55,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005635751] [2024-10-14 17:48:55,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:55,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:48:55,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:55,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:48:55,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:55,064 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:55,096 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-10-14 17:48:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:48:55,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 17:48:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:55,098 INFO L225 Difference]: With dead ends: 33 [2024-10-14 17:48:55,098 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 17:48:55,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:55,098 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:55,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 17:48:55,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2024-10-14 17:48:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 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-10-14 17:48:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-14 17:48:55,103 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 8 [2024-10-14 17:48:55,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:55,104 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-14 17:48:55,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-10-14 17:48:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:48:55,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:55,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:55,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:48:55,105 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-10-14 17:48:55,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:55,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1672006358, now seen corresponding path program 1 times [2024-10-14 17:48:55,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:55,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704209914] [2024-10-14 17:48:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:55,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:55,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:55,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704209914] [2024-10-14 17:48:55,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704209914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:55,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:55,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:48:55,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021695711] [2024-10-14 17:48:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:55,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:48:55,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:55,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:48:55,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:48:55,314 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:55,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:55,380 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-14 17:48:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:48:55,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 17:48:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:55,381 INFO L225 Difference]: With dead ends: 31 [2024-10-14 17:48:55,381 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 17:48:55,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:48:55,382 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:55,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:48:55,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 17:48:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-14 17:48:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.44) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-10-14 17:48:55,385 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 9 [2024-10-14 17:48:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:55,385 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-14 17:48:55,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-10-14 17:48:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:48:55,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:55,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:55,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:48:55,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:48:55,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:55,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1672006357, now seen corresponding path program 1 times [2024-10-14 17:48:55,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:55,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101158241] [2024-10-14 17:48:55,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:55,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:55,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:55,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101158241] [2024-10-14 17:48:55,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101158241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:55,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:55,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:48:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188889424] [2024-10-14 17:48:55,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:55,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:48:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:55,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:48:55,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:48:55,455 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:55,508 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-10-14 17:48:55,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:48:55,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 17:48:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:55,509 INFO L225 Difference]: With dead ends: 30 [2024-10-14 17:48:55,509 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 17:48:55,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:48:55,510 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:55,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 17:48:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-14 17:48:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.36) internal successors, (34), 29 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-10-14 17:48:55,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-10-14 17:48:55,512 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 9 [2024-10-14 17:48:55,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:55,513 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-10-14 17:48:55,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:55,513 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-10-14 17:48:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:48:55,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:55,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:55,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:48:55,514 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-10-14 17:48:55,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:55,514 INFO L85 PathProgramCache]: Analyzing trace with hash -847953576, now seen corresponding path program 1 times [2024-10-14 17:48:55,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:55,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173815729] [2024-10-14 17:48:55,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:55,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:55,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173815729] [2024-10-14 17:48:55,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173815729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:55,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:55,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:48:55,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474145894] [2024-10-14 17:48:55,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:55,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:48:55,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:55,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:48:55,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:48:55,689 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:55,753 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-10-14 17:48:55,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:48:55,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 17:48:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:55,754 INFO L225 Difference]: With dead ends: 31 [2024-10-14 17:48:55,754 INFO L226 Difference]: Without dead ends: 31 [2024-10-14 17:48:55,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:48:55,755 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:55,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:48:55,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-14 17:48:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2024-10-14 17:48:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 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-10-14 17:48:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-14 17:48:55,759 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2024-10-14 17:48:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:55,759 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-14 17:48:55,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:55,759 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-10-14 17:48:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:48:55,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:55,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:55,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:48:55,760 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:48:55,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2045756828, now seen corresponding path program 1 times [2024-10-14 17:48:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:55,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887863933] [2024-10-14 17:48:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:55,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:55,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:55,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887863933] [2024-10-14 17:48:55,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887863933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:55,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:55,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:48:55,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112624881] [2024-10-14 17:48:55,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:55,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:48:55,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:55,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:48:55,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:55,869 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:55,904 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-10-14 17:48:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:48:55,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:48:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:55,906 INFO L225 Difference]: With dead ends: 34 [2024-10-14 17:48:55,906 INFO L226 Difference]: Without dead ends: 34 [2024-10-14 17:48:55,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:55,906 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:55,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:55,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-14 17:48:55,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-14 17:48:55,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-10-14 17:48:55,913 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 13 [2024-10-14 17:48:55,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:55,913 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-10-14 17:48:55,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:55,914 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-10-14 17:48:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:48:55,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:55,914 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:55,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:48:55,915 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-10-14 17:48:55,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:55,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2047086244, now seen corresponding path program 1 times [2024-10-14 17:48:55,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:55,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536968077] [2024-10-14 17:48:55,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:55,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:55,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:55,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536968077] [2024-10-14 17:48:55,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536968077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:55,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:55,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:48:55,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143393643] [2024-10-14 17:48:55,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:55,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:48:55,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:55,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:48:55,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:55,994 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:56,022 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-10-14 17:48:56,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:48:56,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:48:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:56,027 INFO L225 Difference]: With dead ends: 35 [2024-10-14 17:48:56,028 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 17:48:56,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:56,029 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:56,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 17:48:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-14 17:48:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-10-14 17:48:56,036 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 13 [2024-10-14 17:48:56,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:56,037 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-14 17:48:56,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:56,037 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-10-14 17:48:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:48:56,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:56,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:56,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:48:56,041 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:48:56,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:56,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1548145890, now seen corresponding path program 1 times [2024-10-14 17:48:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:56,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786938732] [2024-10-14 17:48:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:56,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:56,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786938732] [2024-10-14 17:48:56,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786938732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:56,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:56,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 17:48:56,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602909184] [2024-10-14 17:48:56,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:56,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 17:48:56,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:56,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 17:48:56,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:48:56,528 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:56,684 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-10-14 17:48:56,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:48:56,684 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:48:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:56,685 INFO L225 Difference]: With dead ends: 39 [2024-10-14 17:48:56,685 INFO L226 Difference]: Without dead ends: 39 [2024-10-14 17:48:56,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:48:56,686 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:56,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:48:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-14 17:48:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-14 17:48:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 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-10-14 17:48:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-10-14 17:48:56,689 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 13 [2024-10-14 17:48:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:56,689 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-10-14 17:48:56,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-10-14 17:48:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:48:56,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:56,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:56,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:48:56,690 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-10-14 17:48:56,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1548145891, now seen corresponding path program 1 times [2024-10-14 17:48:56,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:56,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6030202] [2024-10-14 17:48:56,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:56,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:56,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6030202] [2024-10-14 17:48:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6030202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:56,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:56,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:48:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009205607] [2024-10-14 17:48:56,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:56,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:48:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:56,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:48:56,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:48:56,741 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:56,787 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-14 17:48:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:48:56,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:48:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:56,789 INFO L225 Difference]: With dead ends: 38 [2024-10-14 17:48:56,789 INFO L226 Difference]: Without dead ends: 38 [2024-10-14 17:48:56,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:48:56,789 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:56,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 41 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-14 17:48:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-14 17:48:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:56,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-10-14 17:48:56,795 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 13 [2024-10-14 17:48:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:56,796 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-14 17:48:56,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-10-14 17:48:56,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:48:56,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:56,797 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:56,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:48:56,797 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:48:56,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1546816474, now seen corresponding path program 1 times [2024-10-14 17:48:56,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:56,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975274345] [2024-10-14 17:48:56,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:56,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:56,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:56,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975274345] [2024-10-14 17:48:56,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975274345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:56,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:56,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:48:56,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935476376] [2024-10-14 17:48:56,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:56,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:48:56,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:56,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:48:56,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:48:56,944 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:56,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:56,992 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-10-14 17:48:56,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:48:56,992 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:48:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:56,993 INFO L225 Difference]: With dead ends: 53 [2024-10-14 17:48:56,993 INFO L226 Difference]: Without dead ends: 53 [2024-10-14 17:48:56,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:48:56,993 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:56,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 99 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-14 17:48:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-14 17:48:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2024-10-14 17:48:56,997 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 13 [2024-10-14 17:48:56,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:56,997 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2024-10-14 17:48:56,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-10-14 17:48:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:48:56,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:56,998 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:56,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:48:56,998 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:48:57,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:57,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1288651036, now seen corresponding path program 1 times [2024-10-14 17:48:57,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:57,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055997837] [2024-10-14 17:48:57,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:57,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:57,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:57,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055997837] [2024-10-14 17:48:57,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055997837] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:48:57,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102102616] [2024-10-14 17:48:57,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:57,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:48:57,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:48:57,330 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-10-14 17:48:57,331 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-10-14 17:48:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:57,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 17:48:57,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:48:57,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-14 17:48:57,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:48:57,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2024-10-14 17:48:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:57,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:48:58,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-14 17:48:58,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-10-14 17:48:58,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 17:48:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:58,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102102616] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:48:58,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:48:58,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2024-10-14 17:48:58,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610004608] [2024-10-14 17:48:58,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:48:58,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 17:48:58,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:58,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 17:48:58,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:48:58,032 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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-10-14 17:48:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:58,247 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-10-14 17:48:58,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:48:58,248 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:48:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:58,248 INFO L225 Difference]: With dead ends: 57 [2024-10-14 17:48:58,248 INFO L226 Difference]: Without dead ends: 57 [2024-10-14 17:48:58,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-10-14 17:48:58,249 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:58,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 116 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:48:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-14 17:48:58,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2024-10-14 17:48:58,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.25) internal successors, (65), 55 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-10-14 17:48:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-10-14 17:48:58,255 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 13 [2024-10-14 17:48:58,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:58,255 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-10-14 17:48:58,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 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-10-14 17:48:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-10-14 17:48:58,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:48:58,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:58,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:58,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 17:48:58,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 17:48:58,457 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:48:58,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:58,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1551663363, now seen corresponding path program 1 times [2024-10-14 17:48:58,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:58,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258484277] [2024-10-14 17:48:58,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:58,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:58,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258484277] [2024-10-14 17:48:58,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258484277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:48:58,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:48:58,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:48:58,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388836983] [2024-10-14 17:48:58,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:48:58,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:48:58,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:58,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:48:58,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:58,576 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:58,592 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2024-10-14 17:48:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:48:58,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 17:48:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:58,593 INFO L225 Difference]: With dead ends: 55 [2024-10-14 17:48:58,593 INFO L226 Difference]: Without dead ends: 35 [2024-10-14 17:48:58,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:48:58,593 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:58,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:48:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-14 17:48:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-14 17:48:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-10-14 17:48:58,595 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 14 [2024-10-14 17:48:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:58,595 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-10-14 17:48:58,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-10-14 17:48:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:48:58,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:58,596 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:58,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:48:58,596 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:48:58,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:48:58,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1293476482, now seen corresponding path program 1 times [2024-10-14 17:48:58,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:48:58,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696813704] [2024-10-14 17:48:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:58,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:48:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:58,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:58,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:48:58,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696813704] [2024-10-14 17:48:58,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696813704] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:48:58,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846559384] [2024-10-14 17:48:58,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:48:58,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:48:58,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:48:58,935 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-10-14 17:48:58,937 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-10-14 17:48:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:48:59,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-14 17:48:59,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:48:59,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:48:59,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-14 17:48:59,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-14 17:48:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:59,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:48:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:48:59,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846559384] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:48:59,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:48:59,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-10-14 17:48:59,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326436390] [2024-10-14 17:48:59,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:48:59,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 17:48:59,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:48:59,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 17:48:59,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2024-10-14 17:48:59,712 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 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-10-14 17:48:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:48:59,945 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-10-14 17:48:59,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 17:48:59,945 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 17:48:59,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:48:59,946 INFO L225 Difference]: With dead ends: 37 [2024-10-14 17:48:59,946 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 17:48:59,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2024-10-14 17:48:59,947 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:48:59,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 46 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:48:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 17:48:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-10-14 17:48:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:48:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-10-14 17:48:59,950 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 14 [2024-10-14 17:48:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:48:59,951 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-10-14 17:48:59,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 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-10-14 17:48:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-10-14 17:48:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:48:59,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:48:59,952 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:48:59,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:49:00,156 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,SelfDestructingSolverStorable17 [2024-10-14 17:49:00,157 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:49:00,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:49:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1455404241, now seen corresponding path program 1 times [2024-10-14 17:49:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:49:00,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661692366] [2024-10-14 17:49:00,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:49:00,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:49:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:49:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:49:00,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:49:00,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661692366] [2024-10-14 17:49:00,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661692366] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:49:00,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748372851] [2024-10-14 17:49:00,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:49:00,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:49:00,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:49:00,580 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-10-14 17:49:00,584 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-10-14 17:49:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:49:00,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-14 17:49:00,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:49:00,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:49:00,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-14 17:49:00,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-14 17:49:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:49:01,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:49:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:49:01,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748372851] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:49:01,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:49:01,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-10-14 17:49:01,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438764470] [2024-10-14 17:49:01,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:49:01,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-14 17:49:01,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:49:01,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-14 17:49:01,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2024-10-14 17:49:01,553 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 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-10-14 17:49:05,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:49:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:49:06,289 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-10-14 17:49:06,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 17:49:06,289 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 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 16 [2024-10-14 17:49:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:49:06,289 INFO L225 Difference]: With dead ends: 42 [2024-10-14 17:49:06,289 INFO L226 Difference]: Without dead ends: 25 [2024-10-14 17:49:06,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=1651, Unknown=0, NotChecked=0, Total=1892 [2024-10-14 17:49:06,291 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:49:06,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 59 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 290 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 17:49:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-14 17:49:06,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-14 17:49:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:49:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-10-14 17:49:06,293 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 16 [2024-10-14 17:49:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:49:06,293 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-10-14 17:49:06,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 31 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-10-14 17:49:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-10-14 17:49:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 17:49:06,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:49:06,293 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:49:06,311 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-10-14 17:49:06,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:49:06,494 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:49:06,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:49:06,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2030795708, now seen corresponding path program 1 times [2024-10-14 17:49:06,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:49:06,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707624716] [2024-10-14 17:49:06,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:49:06,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:49:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:49:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:49:07,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:49:07,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707624716] [2024-10-14 17:49:07,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707624716] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:49:07,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952561623] [2024-10-14 17:49:07,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:49:07,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:49:07,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:49:07,105 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-10-14 17:49:07,106 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-10-14 17:49:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:49:07,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-14 17:49:07,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:49:07,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:49:07,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-14 17:49:07,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-14 17:49:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:49:07,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:49:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:49:08,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952561623] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:49:08,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:49:08,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2024-10-14 17:49:08,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897340288] [2024-10-14 17:49:08,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:49:08,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-14 17:49:08,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:49:08,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-14 17:49:08,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1089, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 17:49:08,281 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:49:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:49:09,555 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2024-10-14 17:49:09,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-14 17:49:09,556 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-14 17:49:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:49:09,556 INFO L225 Difference]: With dead ends: 39 [2024-10-14 17:49:09,556 INFO L226 Difference]: Without dead ends: 30 [2024-10-14 17:49:09,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=290, Invalid=2902, Unknown=0, NotChecked=0, Total=3192 [2024-10-14 17:49:09,558 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:49:09,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 21 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:49:09,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-14 17:49:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2024-10-14 17:49:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 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-10-14 17:49:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-10-14 17:49:09,559 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2024-10-14 17:49:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:49:09,560 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-10-14 17:49:09,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:49:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-10-14 17:49:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 17:49:09,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:49:09,560 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:49:09,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 17:49:09,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:49:09,761 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:49:09,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:49:09,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2029466292, now seen corresponding path program 2 times [2024-10-14 17:49:09,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:49:09,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163766] [2024-10-14 17:49:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:49:09,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:49:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:49:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:49:10,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:49:10,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163766] [2024-10-14 17:49:10,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163766] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:49:10,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520869588] [2024-10-14 17:49:10,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:49:10,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:49:10,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:49:10,346 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-10-14 17:49:10,347 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-10-14 17:49:10,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:49:10,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:49:10,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-14 17:49:10,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:49:10,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-14 17:49:10,851 INFO L349 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2024-10-14 17:49:10,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2024-10-14 17:49:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:49:10,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:49:11,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-10-14 17:49:11,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-10-14 17:49:11,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 17:49:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:49:11,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520869588] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:49:11,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:49:11,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2024-10-14 17:49:11,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644489909] [2024-10-14 17:49:11,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:49:11,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-14 17:49:11,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:49:11,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-14 17:49:11,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2024-10-14 17:49:11,454 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:49:11,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:49:11,997 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-10-14 17:49:11,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 17:49:11,998 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-14 17:49:11,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:49:11,998 INFO L225 Difference]: With dead ends: 20 [2024-10-14 17:49:11,998 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 17:49:11,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=1312, Unknown=0, NotChecked=0, Total=1482 [2024-10-14 17:49:11,999 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:49:11,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 57 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:49:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 17:49:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 17:49:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:49:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-10-14 17:49:12,001 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2024-10-14 17:49:12,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:49:12,001 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-10-14 17:49:12,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:49:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-10-14 17:49:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 17:49:12,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:49:12,001 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:49:12,016 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-10-14 17:49:12,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:49:12,202 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-10-14 17:49:12,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:49:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1511054358, now seen corresponding path program 2 times [2024-10-14 17:49:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:49:12,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878946531] [2024-10-14 17:49:12,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:49:12,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:49:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:49:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:49:12,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:49:12,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878946531] [2024-10-14 17:49:12,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878946531] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:49:12,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058590981] [2024-10-14 17:49:12,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:49:12,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:49:12,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:49:12,622 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-10-14 17:49:12,624 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-10-14 17:49:12,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:49:12,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:49:12,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-14 17:49:12,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:49:12,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:49:12,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-10-14 17:49:12,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-14 17:49:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:49:13,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:49:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:49:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058590981] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:49:13,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:49:13,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2024-10-14 17:49:13,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653218267] [2024-10-14 17:49:13,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:49:13,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-14 17:49:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:49:13,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-14 17:49:13,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 17:49:13,773 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:49:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:49:14,417 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2024-10-14 17:49:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 17:49:14,417 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 17:49:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:49:14,417 INFO L225 Difference]: With dead ends: 24 [2024-10-14 17:49:14,417 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 17:49:14,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=264, Invalid=1898, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 17:49:14,419 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:49:14,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 36 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:49:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 17:49:14,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 17:49:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:49:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 17:49:14,419 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2024-10-14 17:49:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:49:14,420 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 17:49:14,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:49:14,420 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 17:49:14,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 17:49:14,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2024-10-14 17:49:14,423 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2024-10-14 17:49:14,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2024-10-14 17:49:14,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2024-10-14 17:49:14,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2024-10-14 17:49:14,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2024-10-14 17:49:14,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2024-10-14 17:49:14,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2024-10-14 17:49:14,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2024-10-14 17:49:14,441 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-10-14 17:49:14,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:49:14,627 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:49:14,629 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:49:14,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:49:14 BoogieIcfgContainer [2024-10-14 17:49:14,631 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:49:14,632 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:49:14,632 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:49:14,632 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:49:14,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:48:53" (3/4) ... [2024-10-14 17:49:14,636 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:49:14,644 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-14 17:49:14,644 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-14 17:49:14,644 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 17:49:14,644 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-14 17:49:14,719 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:49:14,720 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:49:14,720 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:49:14,721 INFO L158 Benchmark]: Toolchain (without parser) took 22395.23ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 105.0MB in the beginning and 121.6MB in the end (delta: -16.5MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-10-14 17:49:14,721 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:49:14,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.38ms. Allocated memory is still 146.8MB. Free memory was 104.6MB in the beginning and 87.1MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 17:49:14,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.86ms. Allocated memory is still 146.8MB. Free memory was 87.1MB in the beginning and 85.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:49:14,721 INFO L158 Benchmark]: Boogie Preprocessor took 47.97ms. Allocated memory is still 146.8MB. Free memory was 85.5MB in the beginning and 82.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:49:14,722 INFO L158 Benchmark]: RCFGBuilder took 417.52ms. Allocated memory is still 146.8MB. Free memory was 82.9MB in the beginning and 114.5MB in the end (delta: -31.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 17:49:14,722 INFO L158 Benchmark]: TraceAbstraction took 21346.37ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 113.6MB in the beginning and 125.3MB in the end (delta: -11.8MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-10-14 17:49:14,722 INFO L158 Benchmark]: Witness Printer took 88.25ms. Allocated memory is still 176.2MB. Free memory was 125.3MB in the beginning and 121.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:49:14,723 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.38ms. Allocated memory is still 146.8MB. Free memory was 104.6MB in the beginning and 87.1MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.86ms. Allocated memory is still 146.8MB. Free memory was 87.1MB in the beginning and 85.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.97ms. Allocated memory is still 146.8MB. Free memory was 85.5MB in the beginning and 82.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 417.52ms. Allocated memory is still 146.8MB. Free memory was 82.9MB in the beginning and 114.5MB in the end (delta: -31.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21346.37ms. Allocated memory was 146.8MB in the beginning and 176.2MB in the end (delta: 29.4MB). Free memory was 113.6MB in the beginning and 125.3MB in the end (delta: -11.8MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 88.25ms. Allocated memory is still 176.2MB. Free memory was 125.3MB in the beginning and 121.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 21.3s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 1273 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 953 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2336 IncrementalHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 320 mSDtfsCounter, 2336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 97 SyntacticMatches, 7 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=16, InterpolantAutomatonStates: 200, 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, 22 MinimizatonAttempts, 39 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 349 NumberOfCodeBlocks, 349 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 413 ConstructedInterpolants, 15 QuantifiedInterpolants, 5655 SizeOfPredicates, 38 NumberOfNonLiveVariables, 893 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 34 InterpolantComputations, 16 PerfectInterpolantSequences, 7/100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:49:14,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE