./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 a046e57d 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-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:34:33,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:34:33,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-13 10:34:33,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:34:33,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:34:33,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:34:33,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:34:33,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:34:33,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:34:33,528 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:34:33,529 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:34:33,529 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:34:33,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:34:33,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:34:33,530 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:34:33,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:34:33,533 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:34:33,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:34:33,533 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:34:33,537 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:34:33,537 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:34:33,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:34:33,538 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:34:33,538 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:34:33,538 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:34:33,538 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:34:33,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:34:33,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:34:33,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:34:33,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:34:33,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:34:33,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:34:33,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:34:33,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:34:33,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:34:33,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:34:33,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:34:33,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:34:33,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:34:33,542 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-13 10:34:33,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:34:33,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:34:33,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:34:33,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:34:33,837 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:34:33,839 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-13 10:34:35,316 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:34:35,561 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:34:35,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstpncpy-alloca-2.i [2024-10-13 10:34:35,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2758017fa/6c42c4d981934f469da82cb7396a9ffe/FLAG3acf8e65b [2024-10-13 10:34:35,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2758017fa/6c42c4d981934f469da82cb7396a9ffe [2024-10-13 10:34:35,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:34:35,910 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:34:35,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:34:35,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:34:35,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:34:35,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:34:35" (1/1) ... [2024-10-13 10:34:35,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c55edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:35, skipping insertion in model container [2024-10-13 10:34:35,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:34:35" (1/1) ... [2024-10-13 10:34:35,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:34:36,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:34:36,300 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:34:36,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:34:36,374 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:34:36,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36 WrapperNode [2024-10-13 10:34:36,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:34:36,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:34:36,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:34:36,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:34:36,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36" (1/1) ... [2024-10-13 10:34:36,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36" (1/1) ... [2024-10-13 10:34:36,422 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2024-10-13 10:34:36,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:34:36,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:34:36,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:34:36,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:34:36,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36" (1/1) ... [2024-10-13 10:34:36,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36" (1/1) ... [2024-10-13 10:34:36,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36" (1/1) ... [2024-10-13 10:34:36,452 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 [1, 2]. [2024-10-13 10:34:36,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36" (1/1) ... [2024-10-13 10:34:36,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36" (1/1) ... [2024-10-13 10:34:36,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36" (1/1) ... [2024-10-13 10:34:36,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36" (1/1) ... [2024-10-13 10:34:36,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36" (1/1) ... [2024-10-13 10:34:36,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36" (1/1) ... [2024-10-13 10:34:36,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:34:36,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:34:36,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:34:36,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:34:36,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36" (1/1) ... [2024-10-13 10:34:36,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:34:36,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:34:36,500 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-13 10:34:36,505 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-13 10:34:36,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:34:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:34:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:34:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:34:36,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:34:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:34:36,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:34:36,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:34:36,698 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:34:36,700 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:34:36,930 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-13 10:34:36,930 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:34:36,978 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:34:36,982 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 10:34:36,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:34:36 BoogieIcfgContainer [2024-10-13 10:34:36,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:34:36,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:34:36,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:34:36,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:34:36,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:34:35" (1/3) ... [2024-10-13 10:34:36,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3e4127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:34:36, skipping insertion in model container [2024-10-13 10:34:36,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:34:36" (2/3) ... [2024-10-13 10:34:36,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3e4127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:34:36, skipping insertion in model container [2024-10-13 10:34:36,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:34:36" (3/3) ... [2024-10-13 10:34:36,993 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-2.i [2024-10-13 10:34:37,012 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:34:37,013 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-10-13 10:34:37,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:34:37,068 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;@3b81ce41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:34:37,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-13 10:34:37,074 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-13 10:34:37,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:34:37,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:37,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:34:37,081 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-13 10:34:37,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:37,086 INFO L85 PathProgramCache]: Analyzing trace with hash 98976755, now seen corresponding path program 1 times [2024-10-13 10:34:37,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:37,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548410231] [2024-10-13 10:34:37,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:37,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:37,376 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-13 10:34:37,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:37,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548410231] [2024-10-13 10:34:37,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548410231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:37,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:37,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:34:37,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725318504] [2024-10-13 10:34:37,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:37,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:34:37,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:37,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:34:37,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:34:37,418 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-13 10:34:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:37,467 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-10-13 10:34:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:34:37,470 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-13 10:34:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:37,477 INFO L225 Difference]: With dead ends: 26 [2024-10-13 10:34:37,477 INFO L226 Difference]: Without dead ends: 25 [2024-10-13 10:34:37,479 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-13 10:34:37,484 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-13 10:34:37,485 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-13 10:34:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-13 10:34:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-13 10:34:37,519 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-13 10:34:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-10-13 10:34:37,521 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 5 [2024-10-13 10:34:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:37,522 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-10-13 10:34:37,522 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-13 10:34:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-10-13 10:34:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:34:37,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:37,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:34:37,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:34:37,524 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-13 10:34:37,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:37,524 INFO L85 PathProgramCache]: Analyzing trace with hash 98976756, now seen corresponding path program 1 times [2024-10-13 10:34:37,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:37,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477408108] [2024-10-13 10:34:37,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:37,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:37,875 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-13 10:34:37,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:37,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477408108] [2024-10-13 10:34:37,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477408108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:37,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:37,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:34:37,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96548825] [2024-10-13 10:34:37,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:37,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:34:37,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:37,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:34:37,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:34:37,882 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-13 10:34:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:37,912 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-10-13 10:34:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:34:37,913 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-13 10:34:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:37,914 INFO L225 Difference]: With dead ends: 28 [2024-10-13 10:34:37,914 INFO L226 Difference]: Without dead ends: 28 [2024-10-13 10:34:37,915 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-13 10:34:37,916 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-13 10:34:37,916 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-13 10:34:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-13 10:34:37,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-13 10:34:37,921 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-13 10:34:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-10-13 10:34:37,924 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 5 [2024-10-13 10:34:37,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:37,924 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-10-13 10:34:37,924 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-13 10:34:37,924 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-10-13 10:34:37,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:34:37,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:37,925 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:34:37,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:34:37,926 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-13 10:34:37,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash 99036338, now seen corresponding path program 1 times [2024-10-13 10:34:37,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:37,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581041341] [2024-10-13 10:34:37,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:38,132 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-13 10:34:38,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:38,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581041341] [2024-10-13 10:34:38,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581041341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:38,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:38,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:34:38,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876137843] [2024-10-13 10:34:38,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:38,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:34:38,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:38,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:34:38,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:34:38,134 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-13 10:34:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:38,164 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2024-10-13 10:34:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:34:38,165 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-13 10:34:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:38,166 INFO L225 Difference]: With dead ends: 27 [2024-10-13 10:34:38,166 INFO L226 Difference]: Without dead ends: 27 [2024-10-13 10:34:38,166 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-13 10:34:38,167 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-13 10:34:38,168 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-13 10:34:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-13 10:34:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-10-13 10:34:38,171 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-13 10:34:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-10-13 10:34:38,172 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 5 [2024-10-13 10:34:38,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:38,172 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-10-13 10:34:38,172 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-13 10:34:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-10-13 10:34:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:34:38,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:38,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:38,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:34:38,173 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-13 10:34:38,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:38,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2024230353, now seen corresponding path program 1 times [2024-10-13 10:34:38,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:38,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671453699] [2024-10-13 10:34:38,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:38,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:34:38,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:38,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671453699] [2024-10-13 10:34:38,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671453699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:38,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:38,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:34:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069599133] [2024-10-13 10:34:38,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:38,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:34:38,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:38,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:34:38,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:34:38,272 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-13 10:34:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:38,310 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-13 10:34:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:34:38,311 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-13 10:34:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:38,312 INFO L225 Difference]: With dead ends: 36 [2024-10-13 10:34:38,312 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 10:34:38,312 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-13 10:34:38,313 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-13 10:34:38,314 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-13 10:34:38,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 10:34:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2024-10-13 10:34:38,317 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-13 10:34:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-13 10:34:38,317 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 8 [2024-10-13 10:34:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:38,318 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-13 10:34:38,318 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-13 10:34:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-13 10:34:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:34:38,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:38,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:38,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:34:38,319 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-13 10:34:38,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2024274293, now seen corresponding path program 1 times [2024-10-13 10:34:38,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:38,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816086145] [2024-10-13 10:34:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:38,413 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-13 10:34:38,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:38,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816086145] [2024-10-13 10:34:38,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816086145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:38,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:38,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:34:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939835315] [2024-10-13 10:34:38,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:38,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:34:38,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:38,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:34:38,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:34:38,415 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-13 10:34:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:38,481 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-10-13 10:34:38,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:34:38,482 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-13 10:34:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:38,483 INFO L225 Difference]: With dead ends: 27 [2024-10-13 10:34:38,483 INFO L226 Difference]: Without dead ends: 27 [2024-10-13 10:34:38,483 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-13 10:34:38,484 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-13 10:34:38,484 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-13 10:34:38,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-13 10:34:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-10-13 10:34:38,491 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-13 10:34:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-10-13 10:34:38,492 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 8 [2024-10-13 10:34:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:38,492 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-10-13 10:34:38,492 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-13 10:34:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-10-13 10:34:38,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:34:38,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:38,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:38,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:34:38,496 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-13 10:34:38,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2024274292, now seen corresponding path program 1 times [2024-10-13 10:34:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488243227] [2024-10-13 10:34:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:38,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:34:38,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:38,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488243227] [2024-10-13 10:34:38,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488243227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:38,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:38,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:34:38,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686116202] [2024-10-13 10:34:38,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:38,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:34:38,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:38,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:34:38,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:34:38,725 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-13 10:34:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:38,783 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-10-13 10:34:38,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:34:38,783 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-13 10:34:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:38,784 INFO L225 Difference]: With dead ends: 29 [2024-10-13 10:34:38,784 INFO L226 Difference]: Without dead ends: 29 [2024-10-13 10:34:38,784 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-13 10:34:38,785 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:34:38,785 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.1s Time] [2024-10-13 10:34:38,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-13 10:34:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-10-13 10:34:38,792 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-13 10:34:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-10-13 10:34:38,793 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 8 [2024-10-13 10:34:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:38,794 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-13 10:34:38,794 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-13 10:34:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-10-13 10:34:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:34:38,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:38,795 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:38,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:34:38,795 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-13 10:34:38,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1966972051, now seen corresponding path program 1 times [2024-10-13 10:34:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:38,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830412111] [2024-10-13 10:34:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:38,876 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-13 10:34:38,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:38,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830412111] [2024-10-13 10:34:38,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830412111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:38,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:38,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:34:38,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577269341] [2024-10-13 10:34:38,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:38,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:34:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:38,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:34:38,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:34:38,881 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-13 10:34:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:38,913 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-10-13 10:34:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:34:38,914 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-13 10:34:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:38,914 INFO L225 Difference]: With dead ends: 33 [2024-10-13 10:34:38,914 INFO L226 Difference]: Without dead ends: 33 [2024-10-13 10:34:38,915 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-13 10:34:38,915 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-13 10:34:38,916 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-13 10:34:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-13 10:34:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2024-10-13 10:34:38,920 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-13 10:34:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-13 10:34:38,921 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 8 [2024-10-13 10:34:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:38,921 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-13 10:34:38,921 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-13 10:34:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-10-13 10:34:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:34:38,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:38,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:38,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:34:38,922 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-13 10:34:38,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:38,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1672006358, now seen corresponding path program 1 times [2024-10-13 10:34:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:38,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915262780] [2024-10-13 10:34:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:38,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:39,181 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-13 10:34:39,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:39,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915262780] [2024-10-13 10:34:39,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915262780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:39,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:39,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:34:39,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156317698] [2024-10-13 10:34:39,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:39,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:34:39,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:39,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:34:39,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:34:39,184 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-13 10:34:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:39,254 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-13 10:34:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:34:39,255 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-13 10:34:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:39,256 INFO L225 Difference]: With dead ends: 31 [2024-10-13 10:34:39,256 INFO L226 Difference]: Without dead ends: 31 [2024-10-13 10:34:39,257 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-13 10:34:39,257 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-13 10:34:39,272 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-13 10:34:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-13 10:34:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-13 10:34:39,278 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-13 10:34:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-10-13 10:34:39,279 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 9 [2024-10-13 10:34:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:39,279 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-13 10:34:39,279 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-13 10:34:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-10-13 10:34:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:34:39,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:39,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:39,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:34:39,283 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-13 10:34:39,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:39,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1672006357, now seen corresponding path program 1 times [2024-10-13 10:34:39,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:39,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392426849] [2024-10-13 10:34:39,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:39,367 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-13 10:34:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392426849] [2024-10-13 10:34:39,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392426849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:39,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:39,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:34:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145986021] [2024-10-13 10:34:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:39,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:34:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:39,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:34:39,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:34:39,369 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-13 10:34:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:39,422 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2024-10-13 10:34:39,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:34:39,426 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-13 10:34:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:39,427 INFO L225 Difference]: With dead ends: 30 [2024-10-13 10:34:39,428 INFO L226 Difference]: Without dead ends: 30 [2024-10-13 10:34:39,428 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-13 10:34:39,429 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-13 10:34:39,430 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-13 10:34:39,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-13 10:34:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-13 10:34:39,436 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-13 10:34:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-10-13 10:34:39,436 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 9 [2024-10-13 10:34:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:39,436 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-10-13 10:34:39,436 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-13 10:34:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-10-13 10:34:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 10:34:39,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:39,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:39,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:34:39,437 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-13 10:34:39,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:39,438 INFO L85 PathProgramCache]: Analyzing trace with hash -847953576, now seen corresponding path program 1 times [2024-10-13 10:34:39,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:39,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970496356] [2024-10-13 10:34:39,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:39,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:39,668 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-13 10:34:39,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:39,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970496356] [2024-10-13 10:34:39,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970496356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:39,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:39,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:34:39,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011908827] [2024-10-13 10:34:39,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:39,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:34:39,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:39,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:34:39,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:34:39,673 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-13 10:34:39,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:39,742 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-10-13 10:34:39,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:34:39,742 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-13 10:34:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:39,743 INFO L225 Difference]: With dead ends: 31 [2024-10-13 10:34:39,743 INFO L226 Difference]: Without dead ends: 31 [2024-10-13 10:34:39,743 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-13 10:34:39,744 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-13 10:34:39,744 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-13 10:34:39,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-13 10:34:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2024-10-13 10:34:39,746 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-13 10:34:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-13 10:34:39,747 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 9 [2024-10-13 10:34:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:39,747 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-13 10:34:39,747 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-13 10:34:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-10-13 10:34:39,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:34:39,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:39,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:39,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:34:39,748 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-13 10:34:39,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:39,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2045756828, now seen corresponding path program 1 times [2024-10-13 10:34:39,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:39,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112122813] [2024-10-13 10:34:39,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:39,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:39,862 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-13 10:34:39,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:39,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112122813] [2024-10-13 10:34:39,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112122813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:39,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:39,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:34:39,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763155162] [2024-10-13 10:34:39,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:39,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:34:39,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:39,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:34:39,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:34:39,865 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-13 10:34:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:39,893 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-10-13 10:34:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:34:39,894 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-13 10:34:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:39,895 INFO L225 Difference]: With dead ends: 34 [2024-10-13 10:34:39,895 INFO L226 Difference]: Without dead ends: 34 [2024-10-13 10:34:39,895 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-13 10:34:39,896 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-13 10:34:39,896 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-13 10:34:39,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-13 10:34:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-13 10:34:39,899 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-13 10:34:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-10-13 10:34:39,900 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 13 [2024-10-13 10:34:39,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:39,900 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-10-13 10:34:39,900 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-13 10:34:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-10-13 10:34:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:34:39,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:39,901 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:39,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:34:39,902 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-13 10:34:39,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:39,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2047086244, now seen corresponding path program 1 times [2024-10-13 10:34:39,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:39,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697804513] [2024-10-13 10:34:39,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:39,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:40,017 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-13 10:34:40,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:40,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697804513] [2024-10-13 10:34:40,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697804513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:40,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:40,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:34:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237948892] [2024-10-13 10:34:40,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:40,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:34:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:40,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:34:40,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:34:40,020 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-13 10:34:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:40,052 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-10-13 10:34:40,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:34:40,053 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-13 10:34:40,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:40,054 INFO L225 Difference]: With dead ends: 35 [2024-10-13 10:34:40,055 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 10:34:40,055 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-13 10:34:40,055 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-13 10:34:40,056 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-13 10:34:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 10:34:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-13 10:34:40,063 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-13 10:34:40,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-10-13 10:34:40,064 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 13 [2024-10-13 10:34:40,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:40,065 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-13 10:34:40,065 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-13 10:34:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-10-13 10:34:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:34:40,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:40,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:40,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:34:40,066 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-13 10:34:40,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1548145890, now seen corresponding path program 1 times [2024-10-13 10:34:40,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:40,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722130908] [2024-10-13 10:34:40,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:40,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:40,539 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-13 10:34:40,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:40,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722130908] [2024-10-13 10:34:40,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722130908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:40,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:40,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 10:34:40,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98643349] [2024-10-13 10:34:40,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:40,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:34:40,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:40,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:34:40,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:34:40,541 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-13 10:34:40,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:40,707 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-10-13 10:34:40,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:34:40,707 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-13 10:34:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:40,708 INFO L225 Difference]: With dead ends: 39 [2024-10-13 10:34:40,708 INFO L226 Difference]: Without dead ends: 39 [2024-10-13 10:34:40,708 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-13 10:34:40,710 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-13 10:34:40,710 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-13 10:34:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-13 10:34:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-13 10:34:40,715 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-13 10:34:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-10-13 10:34:40,716 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 13 [2024-10-13 10:34:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:40,717 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-10-13 10:34:40,717 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-13 10:34:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-10-13 10:34:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:34:40,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:40,718 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:40,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:34:40,718 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-13 10:34:40,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:40,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1548145891, now seen corresponding path program 1 times [2024-10-13 10:34:40,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:40,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683546091] [2024-10-13 10:34:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:40,784 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-13 10:34:40,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:40,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683546091] [2024-10-13 10:34:40,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683546091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:40,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:40,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:34:40,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289162782] [2024-10-13 10:34:40,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:40,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:34:40,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:40,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:34:40,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:34:40,786 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-13 10:34:40,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:40,840 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-13 10:34:40,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:34:40,841 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-13 10:34:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:40,842 INFO L225 Difference]: With dead ends: 38 [2024-10-13 10:34:40,842 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 10:34:40,842 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-13 10:34:40,842 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-13 10:34:40,843 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-13 10:34:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 10:34:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-13 10:34:40,847 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-13 10:34:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-10-13 10:34:40,847 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 13 [2024-10-13 10:34:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:40,847 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-13 10:34:40,847 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-13 10:34:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-10-13 10:34:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:34:40,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:40,848 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:40,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:34:40,848 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-13 10:34:40,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1546816474, now seen corresponding path program 1 times [2024-10-13 10:34:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:40,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003677986] [2024-10-13 10:34:40,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:41,044 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-13 10:34:41,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:41,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003677986] [2024-10-13 10:34:41,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003677986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:41,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:41,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:34:41,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077576700] [2024-10-13 10:34:41,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:41,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:34:41,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:41,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:34:41,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:34:41,047 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-13 10:34:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:41,095 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-10-13 10:34:41,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:34:41,096 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-13 10:34:41,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:41,096 INFO L225 Difference]: With dead ends: 53 [2024-10-13 10:34:41,096 INFO L226 Difference]: Without dead ends: 53 [2024-10-13 10:34:41,097 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-13 10:34:41,098 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-13 10:34:41,098 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-13 10:34:41,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-13 10:34:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-13 10:34:41,104 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-13 10:34:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2024-10-13 10:34:41,105 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 13 [2024-10-13 10:34:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:41,105 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2024-10-13 10:34:41,105 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-13 10:34:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-10-13 10:34:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:34:41,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:41,106 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:41,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:34:41,106 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-13 10:34:41,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:41,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1288651036, now seen corresponding path program 1 times [2024-10-13 10:34:41,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:41,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908374652] [2024-10-13 10:34:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:41,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:41,444 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-13 10:34:41,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:41,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908374652] [2024-10-13 10:34:41,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908374652] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:34:41,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527754968] [2024-10-13 10:34:41,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:41,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:34:41,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:34:41,447 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-13 10:34:41,448 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-13 10:34:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:41,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 10:34:41,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:34:41,613 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-13 10:34:41,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:34:41,869 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-13 10:34:41,999 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-13 10:34:41,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:34:42,335 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-13 10:34:42,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-10-13 10:34:42,362 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 13 treesize of output 9 [2024-10-13 10:34:42,380 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-13 10:34:42,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527754968] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:34:42,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:34:42,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-10-13 10:34:42,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805286984] [2024-10-13 10:34:42,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:34:42,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 10:34:42,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:42,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 10:34:42,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:34:42,383 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 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-13 10:34:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:42,623 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-10-13 10:34:42,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:34:42,624 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-13 10:34:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:42,624 INFO L225 Difference]: With dead ends: 57 [2024-10-13 10:34:42,624 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 10:34:42,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:34:42,625 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:34:42,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 120 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:34:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 10:34:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2024-10-13 10:34:42,628 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-13 10:34:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-10-13 10:34:42,629 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 13 [2024-10-13 10:34:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:42,629 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-10-13 10:34:42,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 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-13 10:34:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-10-13 10:34:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:34:42,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:42,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:42,648 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-13 10:34:42,830 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-13 10:34:42,831 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-13 10:34:42,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:42,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1551663363, now seen corresponding path program 1 times [2024-10-13 10:34:42,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:42,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013287207] [2024-10-13 10:34:42,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:42,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:42,941 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-13 10:34:42,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:42,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013287207] [2024-10-13 10:34:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013287207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:34:42,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:34:42,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:34:42,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613582230] [2024-10-13 10:34:42,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:34:42,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:34:42,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:42,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:34:42,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:34:42,943 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-13 10:34:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:42,960 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2024-10-13 10:34:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:34:42,961 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-13 10:34:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:42,961 INFO L225 Difference]: With dead ends: 55 [2024-10-13 10:34:42,961 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 10:34:42,961 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-13 10:34:42,962 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-13 10:34:42,962 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-13 10:34:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 10:34:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-13 10:34:42,963 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-13 10:34:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-10-13 10:34:42,964 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 14 [2024-10-13 10:34:42,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:42,964 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-10-13 10:34:42,964 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-13 10:34:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-10-13 10:34:42,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:34:42,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:42,965 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:42,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:34:42,965 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-13 10:34:42,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:42,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1293476482, now seen corresponding path program 1 times [2024-10-13 10:34:42,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:42,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467030431] [2024-10-13 10:34:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:42,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:43,338 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-13 10:34:43,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:43,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467030431] [2024-10-13 10:34:43,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467030431] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:34:43,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518579035] [2024-10-13 10:34:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:43,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:34:43,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:34:43,341 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-13 10:34:43,342 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-13 10:34:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:43,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-13 10:34:43,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:34:43,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:34:43,446 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-13 10:34:43,451 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-13 10:34:43,737 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-13 10:34:43,737 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:34:44,087 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-13 10:34:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518579035] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:34:44,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:34:44,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-10-13 10:34:44,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046610588] [2024-10-13 10:34:44,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:34:44,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 10:34:44,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:44,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 10:34:44,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2024-10-13 10:34:44,090 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-13 10:34:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:44,375 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-10-13 10:34:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:34:44,376 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-13 10:34:44,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:44,376 INFO L225 Difference]: With dead ends: 37 [2024-10-13 10:34:44,376 INFO L226 Difference]: Without dead ends: 37 [2024-10-13 10:34:44,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2024-10-13 10:34:44,378 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:34:44,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 68 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:34:44,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-13 10:34:44,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2024-10-13 10:34:44,380 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-13 10:34:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-10-13 10:34:44,381 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 14 [2024-10-13 10:34:44,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:44,382 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-10-13 10:34:44,382 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-13 10:34:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-10-13 10:34:44,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:34:44,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:44,385 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:44,400 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-13 10:34:44,585 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-13 10:34:44,586 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-13 10:34:44,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:44,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1455404241, now seen corresponding path program 1 times [2024-10-13 10:34:44,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:44,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673418353] [2024-10-13 10:34:44,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:44,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:45,015 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-13 10:34:45,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:45,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673418353] [2024-10-13 10:34:45,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673418353] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:34:45,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969134934] [2024-10-13 10:34:45,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:45,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:34:45,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:34:45,018 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-13 10:34:45,020 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-13 10:34:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:45,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-13 10:34:45,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:34:45,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:34:45,112 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-13 10:34:45,116 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-13 10:34:45,441 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-13 10:34:45,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:34:45,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-13 10:34:45,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969134934] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:34:45,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:34:45,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-10-13 10:34:45,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091408627] [2024-10-13 10:34:45,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:34:45,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-13 10:34:45,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:45,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-13 10:34:45,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2024-10-13 10:34:45,937 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-13 10:34:46,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:46,711 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-10-13 10:34:46,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 10:34:46,712 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-13 10:34:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:46,712 INFO L225 Difference]: With dead ends: 42 [2024-10-13 10:34:46,712 INFO L226 Difference]: Without dead ends: 25 [2024-10-13 10:34:46,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=241, Invalid=1651, Unknown=0, NotChecked=0, Total=1892 [2024-10-13 10:34:46,714 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:34:46,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 66 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:34:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-13 10:34:46,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-13 10:34:46,715 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-13 10:34:46,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-10-13 10:34:46,716 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 16 [2024-10-13 10:34:46,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:46,716 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-10-13 10:34:46,716 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-13 10:34:46,716 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-10-13 10:34:46,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:34:46,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:46,717 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:46,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:34:46,921 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-13 10:34:46,922 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-13 10:34:46,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:46,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2030795708, now seen corresponding path program 1 times [2024-10-13 10:34:46,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:46,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832174053] [2024-10-13 10:34:46,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:46,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:47,522 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-13 10:34:47,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:47,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832174053] [2024-10-13 10:34:47,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832174053] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:34:47,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110680542] [2024-10-13 10:34:47,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:47,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:34:47,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:34:47,525 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-13 10:34:47,527 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-13 10:34:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:47,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-13 10:34:47,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:34:47,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:34:47,634 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-13 10:34:47,639 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-13 10:34:48,107 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-13 10:34:48,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:34:48,701 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-13 10:34:48,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110680542] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:34:48,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:34:48,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2024-10-13 10:34:48,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434086231] [2024-10-13 10:34:48,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:34:48,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-13 10:34:48,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:48,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 10:34:48,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1089, Unknown=0, NotChecked=0, Total=1190 [2024-10-13 10:34:48,704 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-13 10:34:49,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:49,971 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2024-10-13 10:34:49,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-13 10:34:49,972 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-13 10:34:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:49,972 INFO L225 Difference]: With dead ends: 39 [2024-10-13 10:34:49,972 INFO L226 Difference]: Without dead ends: 30 [2024-10-13 10:34:49,973 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-13 10:34:49,974 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:34:49,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:34:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-13 10:34:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2024-10-13 10:34:49,975 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-13 10:34:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-10-13 10:34:49,976 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2024-10-13 10:34:49,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:49,976 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-10-13 10:34:49,976 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-13 10:34:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-10-13 10:34:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:34:49,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:49,977 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:49,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 10:34:50,181 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-13 10:34:50,182 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-13 10:34:50,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2029466292, now seen corresponding path program 2 times [2024-10-13 10:34:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:50,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916749702] [2024-10-13 10:34:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:50,744 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-13 10:34:50,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:50,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916749702] [2024-10-13 10:34:50,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916749702] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:34:50,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222220567] [2024-10-13 10:34:50,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:34:50,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:34:50,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:34:50,747 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-13 10:34:50,748 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-13 10:34:50,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:34:50,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:34:50,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 10:34:50,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:34:50,858 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-13 10:34:51,237 INFO L349 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2024-10-13 10:34:51,237 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-13 10:34:51,326 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-13 10:34:51,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:34:51,791 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-13 10:34:51,799 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-13 10:34:51,804 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-13 10:34:51,838 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-13 10:34:51,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222220567] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:34:51,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:34:51,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2024-10-13 10:34:51,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121357727] [2024-10-13 10:34:51,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:34:51,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-13 10:34:51,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:51,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-13 10:34:51,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2024-10-13 10:34:51,840 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-13 10:34:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:52,377 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-10-13 10:34:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:34:52,377 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-13 10:34:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:52,378 INFO L225 Difference]: With dead ends: 20 [2024-10-13 10:34:52,378 INFO L226 Difference]: Without dead ends: 20 [2024-10-13 10:34:52,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=170, Invalid=1312, Unknown=0, NotChecked=0, Total=1482 [2024-10-13 10:34:52,379 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:34:52,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 63 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:34:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-13 10:34:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-13 10:34:52,381 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-13 10:34:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2024-10-13 10:34:52,381 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2024-10-13 10:34:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:52,382 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2024-10-13 10:34:52,382 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-13 10:34:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2024-10-13 10:34:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:34:52,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:34:52,382 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:34:52,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 10:34:52,582 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-13 10:34:52,583 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-13 10:34:52,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:34:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1511054358, now seen corresponding path program 2 times [2024-10-13 10:34:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:34:52,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193595772] [2024-10-13 10:34:52,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:34:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:34:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:34:53,011 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-13 10:34:53,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:34:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193595772] [2024-10-13 10:34:53,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193595772] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:34:53,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121874088] [2024-10-13 10:34:53,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:34:53,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:34:53,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:34:53,013 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-13 10:34:53,014 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-13 10:34:53,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:34:53,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:34:53,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-13 10:34:53,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:34:53,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:34:53,166 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-13 10:34:53,174 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-13 10:34:53,552 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-13 10:34:53,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:34:53,979 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-13 10:34:53,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121874088] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:34:53,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:34:53,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2024-10-13 10:34:53,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187845043] [2024-10-13 10:34:53,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:34:53,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-13 10:34:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:34:53,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-13 10:34:53,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 10:34:53,982 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-13 10:34:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:34:54,503 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2024-10-13 10:34:54,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 10:34:54,504 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-13 10:34:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:34:54,504 INFO L225 Difference]: With dead ends: 24 [2024-10-13 10:34:54,504 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 10:34:54,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=264, Invalid=1898, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:34:54,505 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:34:54,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 35 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:34:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 10:34:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 10:34:54,506 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-13 10:34:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 10:34:54,506 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2024-10-13 10:34:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:34:54,507 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 10:34:54,507 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-13 10:34:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 10:34:54,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 10:34:54,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 9 remaining) [2024-10-13 10:34:54,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2024-10-13 10:34:54,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2024-10-13 10:34:54,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2024-10-13 10:34:54,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2024-10-13 10:34:54,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2024-10-13 10:34:54,513 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2024-10-13 10:34:54,513 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2024-10-13 10:34:54,513 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2024-10-13 10:34:54,530 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-13 10:34:54,713 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-13 10:34:54,717 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-13 10:34:54,719 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:34:54,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:34:54 BoogieIcfgContainer [2024-10-13 10:34:54,722 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:34:54,723 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:34:54,723 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:34:54,723 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:34:54,724 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:34:36" (3/4) ... [2024-10-13 10:34:54,726 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 10:34:54,733 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-13 10:34:54,733 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 10:34:54,734 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 10:34:54,734 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-13 10:34:54,839 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:34:54,840 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 10:34:54,840 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:34:54,841 INFO L158 Benchmark]: Toolchain (without parser) took 18930.74ms. Allocated memory was 123.7MB in the beginning and 352.3MB in the end (delta: 228.6MB). Free memory was 64.2MB in the beginning and 298.3MB in the end (delta: -234.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:34:54,841 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 123.7MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:34:54,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.39ms. Allocated memory was 123.7MB in the beginning and 167.8MB in the end (delta: 44.0MB). Free memory was 64.0MB in the beginning and 135.0MB in the end (delta: -71.0MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-10-13 10:34:54,842 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.46ms. Allocated memory is still 167.8MB. Free memory was 135.0MB in the beginning and 133.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:34:54,842 INFO L158 Benchmark]: Boogie Preprocessor took 40.70ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 130.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:34:54,842 INFO L158 Benchmark]: RCFGBuilder took 515.81ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 114.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 10:34:54,842 INFO L158 Benchmark]: TraceAbstraction took 17737.73ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 114.0MB in the beginning and 303.9MB in the end (delta: -189.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:34:54,843 INFO L158 Benchmark]: Witness Printer took 117.40ms. Allocated memory is still 352.3MB. Free memory was 303.9MB in the beginning and 298.3MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 10:34:54,844 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.18ms. Allocated memory is still 123.7MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.39ms. Allocated memory was 123.7MB in the beginning and 167.8MB in the end (delta: 44.0MB). Free memory was 64.0MB in the beginning and 135.0MB in the end (delta: -71.0MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.46ms. Allocated memory is still 167.8MB. Free memory was 135.0MB in the beginning and 133.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.70ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 130.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 515.81ms. Allocated memory is still 167.8MB. Free memory was 130.8MB in the beginning and 114.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17737.73ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 114.0MB in the beginning and 303.9MB in the end (delta: -189.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 117.40ms. Allocated memory is still 352.3MB. Free memory was 303.9MB in the beginning and 298.3MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. 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: 17.7s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 1312 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 992 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2515 IncrementalHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 320 mSDtfsCounter, 2515 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1784 ImplicationChecksByTransitivity, 6.8s 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.5s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 349 NumberOfCodeBlocks, 349 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 413 ConstructedInterpolants, 15 QuantifiedInterpolants, 5202 SizeOfPredicates, 38 NumberOfNonLiveVariables, 893 ConjunctsInSsa, 271 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-13 10:34:54,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE