./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:45:59,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:45:59,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:45:59,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:45:59,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:45:59,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:45:59,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:45:59,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:45:59,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:45:59,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:45:59,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:45:59,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:45:59,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:45:59,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:45:59,976 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:45:59,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:45:59,977 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:45:59,977 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:45:59,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:45:59,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:45:59,977 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:45:59,978 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:45:59,978 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:45:59,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:45:59,981 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:45:59,981 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:45:59,981 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:45:59,981 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:45:59,982 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:45:59,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:45:59,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:45:59,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:45:59,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:45:59,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:45:59,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:45:59,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:45:59,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:45:59,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:45:59,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:45:59,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:45:59,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:45:59,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:45:59,985 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f4570e8b350d1c6ecce62e4659f1c324ac9794563382f5f25c3525057748138 [2024-10-11 17:46:00,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:46:00,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:46:00,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:46:00,180 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:46:00,181 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:46:00,182 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2024-10-11 17:46:01,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:46:01,651 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:46:01,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca-2.i [2024-10-11 17:46:01,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6feae8d08/a58296c31dbd45cead3f0d9a9e507d1b/FLAG02d5536f1 [2024-10-11 17:46:01,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6feae8d08/a58296c31dbd45cead3f0d9a9e507d1b [2024-10-11 17:46:01,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:46:01,997 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:46:01,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:46:01,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:46:02,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:46:02,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:46:01" (1/1) ... [2024-10-11 17:46:02,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@320ba3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02, skipping insertion in model container [2024-10-11 17:46:02,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:46:01" (1/1) ... [2024-10-11 17:46:02,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:46:02,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:46:02,276 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:46:02,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:46:02,330 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:46:02,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02 WrapperNode [2024-10-11 17:46:02,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:46:02,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:46:02,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:46:02,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:46:02,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02" (1/1) ... [2024-10-11 17:46:02,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02" (1/1) ... [2024-10-11 17:46:02,375 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2024-10-11 17:46:02,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:46:02,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:46:02,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:46:02,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:46:02,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02" (1/1) ... [2024-10-11 17:46:02,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02" (1/1) ... [2024-10-11 17:46:02,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02" (1/1) ... [2024-10-11 17:46:02,407 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [5, 4]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2024-10-11 17:46:02,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02" (1/1) ... [2024-10-11 17:46:02,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02" (1/1) ... [2024-10-11 17:46:02,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02" (1/1) ... [2024-10-11 17:46:02,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02" (1/1) ... [2024-10-11 17:46:02,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02" (1/1) ... [2024-10-11 17:46:02,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02" (1/1) ... [2024-10-11 17:46:02,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:46:02,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:46:02,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:46:02,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:46:02,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02" (1/1) ... [2024-10-11 17:46:02,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:46:02,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:02,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:46:02,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:46:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:46:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:46:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:46:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:46:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:46:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:46:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:46:02,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:46:02,677 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:46:02,679 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:46:02,872 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-10-11 17:46:02,872 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:46:02,916 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:46:02,916 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 17:46:02,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:46:02 BoogieIcfgContainer [2024-10-11 17:46:02,917 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:46:02,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:46:02,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:46:02,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:46:02,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:46:01" (1/3) ... [2024-10-11 17:46:02,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4e4390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:46:02, skipping insertion in model container [2024-10-11 17:46:02,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:46:02" (2/3) ... [2024-10-11 17:46:02,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4e4390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:46:02, skipping insertion in model container [2024-10-11 17:46:02,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:46:02" (3/3) ... [2024-10-11 17:46:02,929 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca-2.i [2024-10-11 17:46:02,942 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:46:02,942 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-10-11 17:46:02,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:46:02,987 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;@534e032a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:46:02,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-10-11 17:46:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 43 states have internal predecessors, (55), 0 states have call successors, (0), 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-11 17:46:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:46:02,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:02,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:46:02,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:03,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:03,002 INFO L85 PathProgramCache]: Analyzing trace with hash 204769870, now seen corresponding path program 1 times [2024-10-11 17:46:03,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:03,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250434412] [2024-10-11 17:46:03,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:03,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:03,212 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-11 17:46:03,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:03,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250434412] [2024-10-11 17:46:03,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250434412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:03,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:03,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:46:03,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335523296] [2024-10-11 17:46:03,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:03,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:46:03,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:03,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:46:03,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:46:03,237 INFO L87 Difference]: Start difference. First operand has 44 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 43 states have internal predecessors, (55), 0 states have call successors, (0), 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 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-11 17:46:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:03,284 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-10-11 17:46:03,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:46:03,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 17:46:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:03,292 INFO L225 Difference]: With dead ends: 55 [2024-10-11 17:46:03,292 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 17:46:03,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11 17:46:03,296 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:03,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 81 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 17:46:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2024-10-11 17:46:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 2.0) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-10-11 17:46:03,318 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 6 [2024-10-11 17:46:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:03,319 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-10-11 17:46:03,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-11 17:46:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-10-11 17:46:03,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:46:03,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:03,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:46:03,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:46:03,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:03,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash 206616912, now seen corresponding path program 1 times [2024-10-11 17:46:03,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:03,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740267593] [2024-10-11 17:46:03,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:03,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:03,408 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-11 17:46:03,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:03,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740267593] [2024-10-11 17:46:03,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740267593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:03,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:03,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:46:03,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91931981] [2024-10-11 17:46:03,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:03,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:46:03,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:03,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:46:03,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:46:03,411 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-11 17:46:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:03,441 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-10-11 17:46:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:46:03,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 17:46:03,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:03,442 INFO L225 Difference]: With dead ends: 44 [2024-10-11 17:46:03,442 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 17:46:03,443 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-11 17:46:03,443 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:03,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 52 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 17:46:03,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 17:46:03,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 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-11 17:46:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-10-11 17:46:03,447 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 6 [2024-10-11 17:46:03,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:03,447 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-11 17:46:03,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-11 17:46:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-10-11 17:46:03,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:46:03,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:03,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:46:03,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:46:03,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:03,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:03,449 INFO L85 PathProgramCache]: Analyzing trace with hash 206616913, now seen corresponding path program 1 times [2024-10-11 17:46:03,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:03,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051427679] [2024-10-11 17:46:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:03,636 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-11 17:46:03,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:03,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051427679] [2024-10-11 17:46:03,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051427679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:03,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:03,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:46:03,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659641902] [2024-10-11 17:46:03,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:03,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:46:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:46:03,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:46:03,638 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-11 17:46:03,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:03,718 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-10-11 17:46:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:46:03,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 17:46:03,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:03,720 INFO L225 Difference]: With dead ends: 46 [2024-10-11 17:46:03,721 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 17:46:03,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:46:03,722 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:03,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 85 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 17:46:03,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 17:46:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.896551724137931) internal successors, (55), 45 states have internal predecessors, (55), 0 states have call successors, (0), 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-11 17:46:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-10-11 17:46:03,728 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 6 [2024-10-11 17:46:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:03,729 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-10-11 17:46:03,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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-11 17:46:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-10-11 17:46:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:46:03,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:03,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:03,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:46:03,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:03,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:03,731 INFO L85 PathProgramCache]: Analyzing trace with hash -784701126, now seen corresponding path program 1 times [2024-10-11 17:46:03,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:03,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881989917] [2024-10-11 17:46:03,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:03,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:03,794 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-11 17:46:03,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:03,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881989917] [2024-10-11 17:46:03,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881989917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:03,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:03,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:46:03,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541632744] [2024-10-11 17:46:03,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:03,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:46:03,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:03,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:46:03,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:46:03,798 INFO L87 Difference]: Start difference. First operand 46 states and 55 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-11 17:46:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:03,827 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2024-10-11 17:46:03,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:46:03,828 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-11 17:46:03,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:03,829 INFO L225 Difference]: With dead ends: 61 [2024-10-11 17:46:03,830 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 17:46:03,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11 17:46:03,831 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:03,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 77 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 17:46:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-10-11 17:46:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.763157894736842) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 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-11 17:46:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2024-10-11 17:46:03,838 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 8 [2024-10-11 17:46:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:03,840 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2024-10-11 17:46:03,840 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-11 17:46:03,840 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2024-10-11 17:46:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:46:03,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:03,841 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:03,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:46:03,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:03,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:03,843 INFO L85 PathProgramCache]: Analyzing trace with hash -727442824, now seen corresponding path program 1 times [2024-10-11 17:46:03,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:03,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962572763] [2024-10-11 17:46:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:03,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:03,883 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-11 17:46:03,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:03,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962572763] [2024-10-11 17:46:03,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962572763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:03,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:03,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:46:03,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494304632] [2024-10-11 17:46:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:03,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:46:03,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:03,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:46:03,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:46:03,885 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-11 17:46:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:03,922 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-10-11 17:46:03,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:46:03,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-11 17:46:03,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:03,923 INFO L225 Difference]: With dead ends: 53 [2024-10-11 17:46:03,923 INFO L226 Difference]: Without dead ends: 53 [2024-10-11 17:46:03,923 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-11 17:46:03,924 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:03,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-11 17:46:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-11 17:46:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 52 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-11 17:46:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2024-10-11 17:46:03,928 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 8 [2024-10-11 17:46:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:03,928 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-10-11 17:46:03,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-11 17:46:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2024-10-11 17:46:03,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:46:03,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:03,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:03,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:46:03,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:03,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:03,930 INFO L85 PathProgramCache]: Analyzing trace with hash -727442823, now seen corresponding path program 1 times [2024-10-11 17:46:03,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:03,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400012638] [2024-10-11 17:46:03,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:03,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:04,069 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-11 17:46:04,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:04,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400012638] [2024-10-11 17:46:04,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400012638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:04,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:04,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:46:04,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151158470] [2024-10-11 17:46:04,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:04,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:46:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:04,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:46:04,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:46:04,071 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 6 states, 5 states have (on average 1.6) 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-11 17:46:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:04,135 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2024-10-11 17:46:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:46:04,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) 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-11 17:46:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:04,136 INFO L225 Difference]: With dead ends: 55 [2024-10-11 17:46:04,136 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 17:46:04,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:46:04,137 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:04,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 88 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 17:46:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 17:46:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.7) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 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-11 17:46:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2024-10-11 17:46:04,140 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 8 [2024-10-11 17:46:04,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:04,140 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-10-11 17:46:04,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) 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-11 17:46:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2024-10-11 17:46:04,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:46:04,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:04,142 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:04,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:46:04,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:04,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:04,143 INFO L85 PathProgramCache]: Analyzing trace with hash 990451733, now seen corresponding path program 1 times [2024-10-11 17:46:04,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:04,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603477061] [2024-10-11 17:46:04,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:04,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:04,304 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-11 17:46:04,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:04,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603477061] [2024-10-11 17:46:04,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603477061] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:04,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634044117] [2024-10-11 17:46:04,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:04,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:04,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:04,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:04,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:46:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:04,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 17:46:04,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:04,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:46:04,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-11 17:46:04,460 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-11 17:46:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:04,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:04,698 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:46:04,729 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-11 17:46:04,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634044117] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:04,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:04,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2024-10-11 17:46:04,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956036588] [2024-10-11 17:46:04,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:04,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:46:04,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:04,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:46:04,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:46:04,731 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:04,911 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2024-10-11 17:46:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:46:04,911 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:46:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:04,913 INFO L225 Difference]: With dead ends: 56 [2024-10-11 17:46:04,913 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 17:46:04,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:46:04,913 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 19 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:04,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 151 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 17:46:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2024-10-11 17:46:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 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-11 17:46:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-10-11 17:46:04,917 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 8 [2024-10-11 17:46:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:04,917 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-10-11 17:46:04,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-10-11 17:46:04,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:46:04,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:04,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:04,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:46:05,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:05,123 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:05,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1444067250, now seen corresponding path program 1 times [2024-10-11 17:46:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:05,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916507703] [2024-10-11 17:46:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:05,273 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-11 17:46:05,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:05,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916507703] [2024-10-11 17:46:05,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916507703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:05,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:05,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:46:05,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614541990] [2024-10-11 17:46:05,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:05,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:46:05,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:05,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:46:05,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:46:05,275 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:05,343 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2024-10-11 17:46:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:46:05,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:46:05,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:05,344 INFO L225 Difference]: With dead ends: 60 [2024-10-11 17:46:05,344 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 17:46:05,345 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-11 17:46:05,345 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:05,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 17:46:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-10-11 17:46:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.6) internal successors, (72), 58 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2024-10-11 17:46:05,350 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 9 [2024-10-11 17:46:05,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:05,350 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2024-10-11 17:46:05,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:05,350 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2024-10-11 17:46:05,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:46:05,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:05,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:05,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:46:05,350 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:05,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:05,351 INFO L85 PathProgramCache]: Analyzing trace with hash 634720624, now seen corresponding path program 1 times [2024-10-11 17:46:05,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:05,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512996746] [2024-10-11 17:46:05,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:05,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:05,483 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-11 17:46:05,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:05,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512996746] [2024-10-11 17:46:05,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512996746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:05,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:05,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:46:05,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013637947] [2024-10-11 17:46:05,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:05,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:46:05,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:05,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:46:05,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:46:05,487 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:05,530 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2024-10-11 17:46:05,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:46:05,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:46:05,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:05,531 INFO L225 Difference]: With dead ends: 73 [2024-10-11 17:46:05,531 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 17:46:05,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11 17:46:05,532 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:05,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 80 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 17:46:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2024-10-11 17:46:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 47 states have (on average 1.6170212765957446) internal successors, (76), 60 states have internal predecessors, (76), 0 states have call successors, (0), 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-11 17:46:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2024-10-11 17:46:05,539 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 9 [2024-10-11 17:46:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:05,539 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2024-10-11 17:46:05,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2024-10-11 17:46:05,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:46:05,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:05,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:05,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:46:05,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:05,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:05,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1816411785, now seen corresponding path program 1 times [2024-10-11 17:46:05,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:05,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532132256] [2024-10-11 17:46:05,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:05,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:05,614 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-11 17:46:05,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:05,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532132256] [2024-10-11 17:46:05,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532132256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:05,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:05,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:46:05,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479353594] [2024-10-11 17:46:05,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:05,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:46:05,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:46:05,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:46:05,616 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:05,653 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2024-10-11 17:46:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:46:05,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:46:05,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:05,654 INFO L225 Difference]: With dead ends: 67 [2024-10-11 17:46:05,654 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 17:46:05,654 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-11 17:46:05,655 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:05,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 85 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 17:46:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-11 17:46:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 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-11 17:46:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2024-10-11 17:46:05,660 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 10 [2024-10-11 17:46:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:05,661 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2024-10-11 17:46:05,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2024-10-11 17:46:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:46:05,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:05,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:05,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:46:05,664 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:05,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1007065159, now seen corresponding path program 1 times [2024-10-11 17:46:05,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:05,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283977403] [2024-10-11 17:46:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:05,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:05,794 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-11 17:46:05,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:05,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283977403] [2024-10-11 17:46:05,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283977403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:05,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:05,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:46:05,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707070256] [2024-10-11 17:46:05,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:05,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:46:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:05,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:46:05,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:46:05,796 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:05,831 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2024-10-11 17:46:05,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:46:05,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 17:46:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:05,832 INFO L225 Difference]: With dead ends: 72 [2024-10-11 17:46:05,833 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 17:46:05,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:46:05,833 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:05,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 57 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 17:46:05,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-10-11 17:46:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 65 states have internal predecessors, (82), 0 states have call successors, (0), 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-11 17:46:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2024-10-11 17:46:05,839 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 10 [2024-10-11 17:46:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:05,839 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2024-10-11 17:46:05,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2024-10-11 17:46:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:46:05,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:05,840 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:05,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:46:05,840 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:05,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:05,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1007198384, now seen corresponding path program 1 times [2024-10-11 17:46:05,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:05,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045157024] [2024-10-11 17:46:05,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:05,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:05,981 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-11 17:46:05,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:05,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045157024] [2024-10-11 17:46:05,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045157024] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:05,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618313556] [2024-10-11 17:46:05,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:05,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:05,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:05,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:05,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:46:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:06,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 17:46:06,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:06,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-11 17:46:06,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-10-11 17:46:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:06,180 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:06,321 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-11 17:46:06,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618313556] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:06,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:06,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2024-10-11 17:46:06,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572456686] [2024-10-11 17:46:06,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:06,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 17:46:06,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:06,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 17:46:06,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:46:06,323 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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-11 17:46:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:06,486 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2024-10-11 17:46:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:46:06,487 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 10 [2024-10-11 17:46:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:06,487 INFO L225 Difference]: With dead ends: 67 [2024-10-11 17:46:06,487 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 17:46:06,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:46:06,488 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:06,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 158 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 17:46:06,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2024-10-11 17:46:06,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.56) internal successors, (78), 62 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 17:46:06,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2024-10-11 17:46:06,490 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 10 [2024-10-11 17:46:06,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:06,490 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2024-10-11 17:46:06,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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-11 17:46:06,490 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2024-10-11 17:46:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:46:06,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:06,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:06,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:46:06,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:06,695 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:06,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash 474192628, now seen corresponding path program 1 times [2024-10-11 17:46:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:06,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822423894] [2024-10-11 17:46:06,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:06,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:06,786 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-11 17:46:06,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:06,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822423894] [2024-10-11 17:46:06,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822423894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:06,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:06,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:46:06,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956646369] [2024-10-11 17:46:06,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:06,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:46:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:06,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:46:06,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:46:06,788 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:06,852 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2024-10-11 17:46:06,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:46:06,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 17:46:06,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:06,853 INFO L225 Difference]: With dead ends: 82 [2024-10-11 17:46:06,853 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 17:46:06,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:46:06,853 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:06,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 85 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:06,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 17:46:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2024-10-11 17:46:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 65 states have internal predecessors, (84), 0 states have call successors, (0), 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-11 17:46:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-10-11 17:46:06,855 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 11 [2024-10-11 17:46:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:06,856 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-10-11 17:46:06,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-10-11 17:46:06,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:46:06,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:06,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:06,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:46:06,857 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:06,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:06,857 INFO L85 PathProgramCache]: Analyzing trace with hash 474192627, now seen corresponding path program 1 times [2024-10-11 17:46:06,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:06,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245465283] [2024-10-11 17:46:06,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:06,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:06,877 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-11 17:46:06,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:06,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245465283] [2024-10-11 17:46:06,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245465283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:06,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:06,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:46:06,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575642313] [2024-10-11 17:46:06,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:06,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:46:06,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:06,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:46:06,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:46:06,879 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:06,908 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2024-10-11 17:46:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:46:06,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 17:46:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:06,909 INFO L225 Difference]: With dead ends: 65 [2024-10-11 17:46:06,909 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 17:46:06,909 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-11 17:46:06,910 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:06,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 48 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:06,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 17:46:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2024-10-11 17:46:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.509433962264151) internal successors, (80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 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-11 17:46:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2024-10-11 17:46:06,911 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 11 [2024-10-11 17:46:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:06,912 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2024-10-11 17:46:06,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2024-10-11 17:46:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 17:46:06,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:06,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:06,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:46:06,913 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:06,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:06,913 INFO L85 PathProgramCache]: Analyzing trace with hash 120654892, now seen corresponding path program 1 times [2024-10-11 17:46:06,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:06,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719293479] [2024-10-11 17:46:06,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:07,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:07,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719293479] [2024-10-11 17:46:07,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719293479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:07,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:07,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:46:07,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550274546] [2024-10-11 17:46:07,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:07,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:46:07,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:07,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:46:07,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:46:07,038 INFO L87 Difference]: Start difference. First operand 64 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:07,057 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-10-11 17:46:07,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:46:07,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 17:46:07,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:07,058 INFO L225 Difference]: With dead ends: 63 [2024-10-11 17:46:07,058 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 17:46:07,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:46:07,060 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:07,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:07,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 17:46:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2024-10-11 17:46:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 50 states have internal predecessors, (62), 0 states have call successors, (0), 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-11 17:46:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-10-11 17:46:07,061 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 11 [2024-10-11 17:46:07,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:07,062 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-10-11 17:46:07,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-10-11 17:46:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 17:46:07,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:07,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:07,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:46:07,063 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:07,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:07,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1549954238, now seen corresponding path program 1 times [2024-10-11 17:46:07,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:07,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892840232] [2024-10-11 17:46:07,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:07,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:07,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:07,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:07,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892840232] [2024-10-11 17:46:07,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892840232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:07,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:07,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:46:07,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838088056] [2024-10-11 17:46:07,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:07,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:46:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:46:07,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:46:07,218 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:07,255 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-10-11 17:46:07,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:46:07,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 17:46:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:07,256 INFO L225 Difference]: With dead ends: 50 [2024-10-11 17:46:07,256 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 17:46:07,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:46:07,256 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:07,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 17:46:07,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-10-11 17:46:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-10-11 17:46:07,258 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 12 [2024-10-11 17:46:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:07,258 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-11 17:46:07,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-10-11 17:46:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:46:07,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:07,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:07,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:46:07,260 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:07,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash 525154948, now seen corresponding path program 1 times [2024-10-11 17:46:07,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:07,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622852699] [2024-10-11 17:46:07,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:07,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:07,361 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-11 17:46:07,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:07,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622852699] [2024-10-11 17:46:07,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622852699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:07,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:07,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:46:07,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94835475] [2024-10-11 17:46:07,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:07,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:46:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:07,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:46:07,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:46:07,363 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-11 17:46:07,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:07,418 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2024-10-11 17:46:07,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:46:07,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-11 17:46:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:07,419 INFO L225 Difference]: With dead ends: 51 [2024-10-11 17:46:07,419 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 17:46:07,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:46:07,420 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 45 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:07,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 51 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:07,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 17:46:07,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 17:46:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 50 states have internal predecessors, (66), 0 states have call successors, (0), 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-11 17:46:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-10-11 17:46:07,424 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 14 [2024-10-11 17:46:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:07,424 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-10-11 17:46:07,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-11 17:46:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-10-11 17:46:07,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:46:07,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:07,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:07,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:46:07,425 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:07,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:07,425 INFO L85 PathProgramCache]: Analyzing trace with hash 525154947, now seen corresponding path program 1 times [2024-10-11 17:46:07,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:07,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945570144] [2024-10-11 17:46:07,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:07,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:07,459 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-11 17:46:07,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:07,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945570144] [2024-10-11 17:46:07,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945570144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:07,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:07,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:46:07,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759495436] [2024-10-11 17:46:07,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:07,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:46:07,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:07,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:46:07,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:46:07,461 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:07,490 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2024-10-11 17:46:07,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:46:07,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:46:07,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:07,490 INFO L225 Difference]: With dead ends: 48 [2024-10-11 17:46:07,490 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 17:46:07,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:46:07,491 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:07,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 45 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:07,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 17:46:07,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 17:46:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 47 states have internal predecessors, (60), 0 states have call successors, (0), 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-11 17:46:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-10-11 17:46:07,494 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 14 [2024-10-11 17:46:07,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:07,494 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-10-11 17:46:07,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-10-11 17:46:07,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:46:07,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:07,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:07,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:46:07,496 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:07,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:07,496 INFO L85 PathProgramCache]: Analyzing trace with hash -900137630, now seen corresponding path program 1 times [2024-10-11 17:46:07,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:07,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142073694] [2024-10-11 17:46:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:07,565 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-11 17:46:07,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:07,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142073694] [2024-10-11 17:46:07,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142073694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:07,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:07,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:46:07,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828789126] [2024-10-11 17:46:07,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:07,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:46:07,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:07,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:46:07,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:46:07,566 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-11 17:46:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:07,604 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2024-10-11 17:46:07,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:46:07,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-11 17:46:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:07,604 INFO L225 Difference]: With dead ends: 47 [2024-10-11 17:46:07,605 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 17:46:07,605 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-11 17:46:07,605 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:07,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 46 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 17:46:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 17:46:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2024-10-11 17:46:07,606 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 15 [2024-10-11 17:46:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:07,607 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2024-10-11 17:46:07,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-11 17:46:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-10-11 17:46:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:46:07,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:07,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:07,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:46:07,609 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:07,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1673254155, now seen corresponding path program 1 times [2024-10-11 17:46:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:07,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278717100] [2024-10-11 17:46:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:07,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:07,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:07,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278717100] [2024-10-11 17:46:07,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278717100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:07,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:07,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:46:07,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106429310] [2024-10-11 17:46:07,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:07,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:46:07,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:07,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:46:07,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:46:07,634 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-11 17:46:07,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:07,654 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-10-11 17:46:07,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:46:07,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-10-11 17:46:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:07,655 INFO L225 Difference]: With dead ends: 46 [2024-10-11 17:46:07,655 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 17:46:07,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:46:07,656 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:07,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 17:46:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 17:46:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-10-11 17:46:07,658 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 17 [2024-10-11 17:46:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:07,658 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-10-11 17:46:07,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-11 17:46:07,658 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-10-11 17:46:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:46:07,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:07,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:07,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:46:07,658 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:07,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash -331416749, now seen corresponding path program 1 times [2024-10-11 17:46:07,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:07,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332810245] [2024-10-11 17:46:07,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:07,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:07,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332810245] [2024-10-11 17:46:07,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332810245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:07,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:07,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:46:07,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127643990] [2024-10-11 17:46:07,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:07,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:46:07,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:07,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:46:07,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:46:07,785 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:07,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:07,838 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-10-11 17:46:07,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:46:07,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 17:46:07,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:07,838 INFO L225 Difference]: With dead ends: 56 [2024-10-11 17:46:07,838 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 17:46:07,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:46:07,839 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:07,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 111 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:07,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 17:46:07,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 17:46:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 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-11 17:46:07,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-10-11 17:46:07,840 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 18 [2024-10-11 17:46:07,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:07,840 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-10-11 17:46:07,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-10-11 17:46:07,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:46:07,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:07,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:07,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:46:07,840 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:07,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:07,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1919764651, now seen corresponding path program 1 times [2024-10-11 17:46:07,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:07,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395287345] [2024-10-11 17:46:07,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:07,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:07,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:07,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395287345] [2024-10-11 17:46:07,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395287345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:07,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:07,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:46:07,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290686726] [2024-10-11 17:46:07,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:07,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:46:07,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:07,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:46:07,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:46:07,999 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:08,049 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-10-11 17:46:08,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:46:08,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 17:46:08,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:08,049 INFO L225 Difference]: With dead ends: 55 [2024-10-11 17:46:08,049 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 17:46:08,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:46:08,050 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:08,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 96 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 17:46:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-10-11 17:46:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 42 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-11 17:46:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-10-11 17:46:08,051 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 18 [2024-10-11 17:46:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:08,051 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-10-11 17:46:08,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-10-11 17:46:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:46:08,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:08,052 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:08,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:46:08,052 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:08,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:08,052 INFO L85 PathProgramCache]: Analyzing trace with hash 553586713, now seen corresponding path program 1 times [2024-10-11 17:46:08,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:08,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311746592] [2024-10-11 17:46:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:08,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:08,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311746592] [2024-10-11 17:46:08,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311746592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:08,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:08,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:46:08,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758441075] [2024-10-11 17:46:08,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:08,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:46:08,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:08,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:46:08,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:46:08,168 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-11 17:46:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:08,221 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-10-11 17:46:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:46:08,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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) Word has length 20 [2024-10-11 17:46:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:08,222 INFO L225 Difference]: With dead ends: 59 [2024-10-11 17:46:08,222 INFO L226 Difference]: Without dead ends: 59 [2024-10-11 17:46:08,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:46:08,222 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:08,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 78 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:08,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-11 17:46:08,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-10-11 17:46:08,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 56 states have internal predecessors, (67), 0 states have call successors, (0), 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-11 17:46:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2024-10-11 17:46:08,223 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 20 [2024-10-11 17:46:08,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:08,223 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2024-10-11 17:46:08,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-11 17:46:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2024-10-11 17:46:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:46:08,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:08,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:08,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:46:08,224 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:08,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1440557993, now seen corresponding path program 1 times [2024-10-11 17:46:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:08,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853412615] [2024-10-11 17:46:08,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:08,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:08,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853412615] [2024-10-11 17:46:08,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853412615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:08,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:08,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 17:46:08,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648328567] [2024-10-11 17:46:08,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:08,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:46:08,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:08,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:46:08,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:46:08,360 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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-11 17:46:08,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:08,431 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2024-10-11 17:46:08,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:46:08,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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) Word has length 20 [2024-10-11 17:46:08,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:08,432 INFO L225 Difference]: With dead ends: 75 [2024-10-11 17:46:08,432 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 17:46:08,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:46:08,433 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:08,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 95 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:08,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 17:46:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 58. [2024-10-11 17:46:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 57 states have internal predecessors, (69), 0 states have call successors, (0), 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-11 17:46:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2024-10-11 17:46:08,434 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 20 [2024-10-11 17:46:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:08,434 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2024-10-11 17:46:08,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 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-11 17:46:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2024-10-11 17:46:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:46:08,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:08,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:08,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:46:08,435 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:08,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash -14207128, now seen corresponding path program 1 times [2024-10-11 17:46:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:08,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928048347] [2024-10-11 17:46:08,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:08,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:08,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928048347] [2024-10-11 17:46:08,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928048347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:46:08,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:46:08,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:46:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971524210] [2024-10-11 17:46:08,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:46:08,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:46:08,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:08,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:46:08,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:46:08,519 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-11 17:46:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:08,598 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2024-10-11 17:46:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:46:08,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 17:46:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:08,598 INFO L225 Difference]: With dead ends: 58 [2024-10-11 17:46:08,599 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 17:46:08,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:46:08,599 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:08,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 98 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:46:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 17:46:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 17:46:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-11 17:46:08,600 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 21 [2024-10-11 17:46:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:08,600 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-11 17:46:08,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 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-11 17:46:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-10-11 17:46:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:46:08,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:08,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:08,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:46:08,601 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:08,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash 665323598, now seen corresponding path program 1 times [2024-10-11 17:46:08,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:08,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743913787] [2024-10-11 17:46:08,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:08,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:08,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:08,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743913787] [2024-10-11 17:46:08,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743913787] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:08,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298232840] [2024-10-11 17:46:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:08,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:08,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:08,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:08,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:46:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:08,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 17:46:08,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:08,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:08,979 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 21 treesize of output 17 [2024-10-11 17:46:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:09,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298232840] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:09,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:09,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2024-10-11 17:46:09,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121943622] [2024-10-11 17:46:09,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:09,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 17:46:09,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:09,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 17:46:09,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:46:09,039 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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-11 17:46:09,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:09,175 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-10-11 17:46:09,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:46:09,176 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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 22 [2024-10-11 17:46:09,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:09,176 INFO L225 Difference]: With dead ends: 44 [2024-10-11 17:46:09,176 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 17:46:09,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2024-10-11 17:46:09,177 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 100 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:09,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 92 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 17:46:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2024-10-11 17:46:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 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-11 17:46:09,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-10-11 17:46:09,178 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 22 [2024-10-11 17:46:09,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:09,178 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-10-11 17:46:09,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 20 states have internal predecessors, (59), 0 states have call successors, (0), 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-11 17:46:09,178 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-10-11 17:46:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 17:46:09,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:09,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:09,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:46:09,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:09,382 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:09,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash -574185849, now seen corresponding path program 1 times [2024-10-11 17:46:09,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:09,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628313150] [2024-10-11 17:46:09,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:09,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:09,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:09,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:09,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628313150] [2024-10-11 17:46:09,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628313150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:09,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406104517] [2024-10-11 17:46:09,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:09,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:09,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:09,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:09,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:46:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:09,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 17:46:09,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:09,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:09,756 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-11 17:46:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:09,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406104517] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:09,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:09,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-10-11 17:46:09,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10569705] [2024-10-11 17:46:09,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:09,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 17:46:09,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:09,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 17:46:09,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-10-11 17:46:09,779 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:09,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:09,879 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2024-10-11 17:46:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:46:09,880 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-11 17:46:09,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:09,880 INFO L225 Difference]: With dead ends: 61 [2024-10-11 17:46:09,880 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 17:46:09,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:46:09,881 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:09,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 114 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:09,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 17:46:09,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2024-10-11 17:46:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 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-11 17:46:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-10-11 17:46:09,883 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 24 [2024-10-11 17:46:09,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:09,883 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-10-11 17:46:09,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.5) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:09,883 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-10-11 17:46:09,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 17:46:09,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:09,883 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:09,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 17:46:10,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 17:46:10,088 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:10,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:10,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1953901539, now seen corresponding path program 2 times [2024-10-11 17:46:10,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:10,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830847579] [2024-10-11 17:46:10,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:10,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:10,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:10,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830847579] [2024-10-11 17:46:10,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830847579] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:10,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857937106] [2024-10-11 17:46:10,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:46:10,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:10,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:10,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:10,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:46:10,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:46:10,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:10,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 17:46:10,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:10,500 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 13 treesize of output 9 [2024-10-11 17:46:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:10,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:10,542 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-11 17:46:10,543 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 16 treesize of output 12 [2024-10-11 17:46:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:10,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857937106] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:10,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:10,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2024-10-11 17:46:10,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994607950] [2024-10-11 17:46:10,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:10,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 17:46:10,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:10,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 17:46:10,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:46:10,577 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 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-11 17:46:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:10,700 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2024-10-11 17:46:10,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:46:10,701 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 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) Word has length 26 [2024-10-11 17:46:10,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:10,701 INFO L225 Difference]: With dead ends: 75 [2024-10-11 17:46:10,701 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 17:46:10,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2024-10-11 17:46:10,702 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:10,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 105 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 17:46:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-10-11 17:46:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 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-11 17:46:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-10-11 17:46:10,703 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 26 [2024-10-11 17:46:10,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:10,703 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-10-11 17:46:10,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 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-11 17:46:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-10-11 17:46:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 17:46:10,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:10,704 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:10,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:46:10,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 17:46:10,909 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:10,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:10,910 INFO L85 PathProgramCache]: Analyzing trace with hash -113249580, now seen corresponding path program 3 times [2024-10-11 17:46:10,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:10,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145648715] [2024-10-11 17:46:10,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:11,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:11,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145648715] [2024-10-11 17:46:11,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145648715] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:11,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76688214] [2024-10-11 17:46:11,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:46:11,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:11,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:11,111 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:11,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:46:11,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 17:46:11,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:11,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 17:46:11,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:11,187 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 1 [2024-10-11 17:46:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:11,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:11,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76688214] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:11,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:11,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-10-11 17:46:11,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798669524] [2024-10-11 17:46:11,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:11,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 17:46:11,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:11,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 17:46:11,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:46:11,434 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 26 states, 25 states have (on average 2.96) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 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-11 17:46:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:11,669 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2024-10-11 17:46:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:46:11,670 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.96) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 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 28 [2024-10-11 17:46:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:11,670 INFO L225 Difference]: With dead ends: 90 [2024-10-11 17:46:11,670 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 17:46:11,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2024-10-11 17:46:11,671 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 79 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:11,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 173 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:46:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 17:46:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 77. [2024-10-11 17:46:11,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 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-11 17:46:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2024-10-11 17:46:11,673 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 28 [2024-10-11 17:46:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:11,674 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2024-10-11 17:46:11,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.96) internal successors, (74), 26 states have internal predecessors, (74), 0 states have call successors, (0), 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-11 17:46:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2024-10-11 17:46:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 17:46:11,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:11,674 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:11,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 17:46:11,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 17:46:11,879 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:11,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1568863325, now seen corresponding path program 4 times [2024-10-11 17:46:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:11,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957171727] [2024-10-11 17:46:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:12,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:12,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957171727] [2024-10-11 17:46:12,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957171727] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:12,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541181193] [2024-10-11 17:46:12,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:46:12,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:12,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:12,714 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:12,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 17:46:12,790 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:46:12,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:12,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 17:46:12,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:12,902 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-11 17:46:13,431 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-10-11 17:46:13,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 36 [2024-10-11 17:46:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:13,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:13,690 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 44 treesize of output 38 [2024-10-11 17:46:13,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:46:13,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2024-10-11 17:46:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541181193] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:13,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:13,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 39 [2024-10-11 17:46:13,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680300531] [2024-10-11 17:46:13,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:13,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 17:46:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:13,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 17:46:13,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1316, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 17:46:13,868 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 39 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 39 states have internal predecessors, (74), 0 states have call successors, (0), 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-11 17:46:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:15,574 INFO L93 Difference]: Finished difference Result 170 states and 190 transitions. [2024-10-11 17:46:15,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-11 17:46:15,575 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 39 states have internal predecessors, (74), 0 states have call successors, (0), 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 32 [2024-10-11 17:46:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:15,575 INFO L225 Difference]: With dead ends: 170 [2024-10-11 17:46:15,575 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 17:46:15,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=526, Invalid=4030, Unknown=0, NotChecked=0, Total=4556 [2024-10-11 17:46:15,577 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 71 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:15,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 185 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:46:15,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 17:46:15,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 109. [2024-10-11 17:46:15,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 107 states have (on average 1.158878504672897) internal successors, (124), 108 states have internal predecessors, (124), 0 states have call successors, (0), 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-11 17:46:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2024-10-11 17:46:15,580 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 32 [2024-10-11 17:46:15,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:15,580 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2024-10-11 17:46:15,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 39 states have internal predecessors, (74), 0 states have call successors, (0), 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-11 17:46:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2024-10-11 17:46:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 17:46:15,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:15,581 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:15,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 17:46:15,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:15,785 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:15,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:15,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1019819545, now seen corresponding path program 2 times [2024-10-11 17:46:15,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:15,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792037706] [2024-10-11 17:46:15,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:15,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:16,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:16,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792037706] [2024-10-11 17:46:16,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792037706] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:16,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509008506] [2024-10-11 17:46:16,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:46:16,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:16,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:16,119 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:16,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 17:46:16,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:46:16,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:16,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 17:46:16,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:16,269 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 13 treesize of output 9 [2024-10-11 17:46:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:16,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:16,359 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 8 treesize of output 4 [2024-10-11 17:46:16,408 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-11 17:46:16,410 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 16 treesize of output 12 [2024-10-11 17:46:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:16,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509008506] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:16,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:16,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 11] total 28 [2024-10-11 17:46:16,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687323] [2024-10-11 17:46:16,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:16,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 17:46:16,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:16,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 17:46:16,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2024-10-11 17:46:16,463 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 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-11 17:46:16,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:16,735 INFO L93 Difference]: Finished difference Result 184 states and 202 transitions. [2024-10-11 17:46:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 17:46:16,735 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 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 33 [2024-10-11 17:46:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:16,736 INFO L225 Difference]: With dead ends: 184 [2024-10-11 17:46:16,736 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 17:46:16,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 17:46:16,737 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:16,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 202 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:46:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 17:46:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2024-10-11 17:46:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 136 states have (on average 1.1470588235294117) internal successors, (156), 137 states have internal predecessors, (156), 0 states have call successors, (0), 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-11 17:46:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2024-10-11 17:46:16,739 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 33 [2024-10-11 17:46:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:16,739 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2024-10-11 17:46:16,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 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-11 17:46:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2024-10-11 17:46:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 17:46:16,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:16,740 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:16,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 17:46:16,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-11 17:46:16,945 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:16,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash 993592602, now seen corresponding path program 5 times [2024-10-11 17:46:16,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:16,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427044357] [2024-10-11 17:46:16,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:16,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:17,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:17,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427044357] [2024-10-11 17:46:17,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427044357] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:17,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53051451] [2024-10-11 17:46:17,232 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 17:46:17,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:17,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:17,236 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:17,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 17:46:17,325 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-10-11 17:46:17,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:17,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 17:46:17,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:17,337 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 1 [2024-10-11 17:46:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:17,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:17,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53051451] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:17,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:17,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-10-11 17:46:17,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075022901] [2024-10-11 17:46:17,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:17,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 17:46:17,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:17,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 17:46:17,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2024-10-11 17:46:17,756 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand has 29 states, 28 states have (on average 3.107142857142857) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 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-11 17:46:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:18,091 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2024-10-11 17:46:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:46:18,091 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.107142857142857) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 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 34 [2024-10-11 17:46:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:18,092 INFO L225 Difference]: With dead ends: 168 [2024-10-11 17:46:18,092 INFO L226 Difference]: Without dead ends: 168 [2024-10-11 17:46:18,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 17:46:18,093 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 58 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:18,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 195 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:46:18,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-11 17:46:18,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 150. [2024-10-11 17:46:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 148 states have (on average 1.1486486486486487) internal successors, (170), 149 states have internal predecessors, (170), 0 states have call successors, (0), 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-11 17:46:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2024-10-11 17:46:18,096 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 34 [2024-10-11 17:46:18,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:18,096 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2024-10-11 17:46:18,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.107142857142857) internal successors, (87), 29 states have internal predecessors, (87), 0 states have call successors, (0), 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-11 17:46:18,096 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2024-10-11 17:46:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 17:46:18,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:18,097 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:18,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 17:46:18,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:18,301 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:18,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:18,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1918000043, now seen corresponding path program 3 times [2024-10-11 17:46:18,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:18,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944454341] [2024-10-11 17:46:18,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:18,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:18,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:18,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944454341] [2024-10-11 17:46:18,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944454341] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:18,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346874542] [2024-10-11 17:46:18,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:46:18,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:18,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:18,472 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:18,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 17:46:18,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 17:46:18,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:18,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 17:46:18,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:18,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 17:46:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:18,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:18,853 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:18,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346874542] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:18,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:18,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2024-10-11 17:46:18,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489040633] [2024-10-11 17:46:18,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:18,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 17:46:18,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:18,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 17:46:18,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2024-10-11 17:46:18,855 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand has 25 states, 24 states have (on average 4.125) internal successors, (99), 25 states have internal predecessors, (99), 0 states have call successors, (0), 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-11 17:46:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:19,015 INFO L93 Difference]: Finished difference Result 238 states and 267 transitions. [2024-10-11 17:46:19,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:46:19,015 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.125) internal successors, (99), 25 states have internal predecessors, (99), 0 states have call successors, (0), 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 35 [2024-10-11 17:46:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:19,016 INFO L225 Difference]: With dead ends: 238 [2024-10-11 17:46:19,016 INFO L226 Difference]: Without dead ends: 238 [2024-10-11 17:46:19,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:46:19,017 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:19,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 219 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:46:19,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-11 17:46:19,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 194. [2024-10-11 17:46:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.1458333333333333) internal successors, (220), 193 states have internal predecessors, (220), 0 states have call successors, (0), 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-11 17:46:19,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2024-10-11 17:46:19,024 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 35 [2024-10-11 17:46:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:19,024 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2024-10-11 17:46:19,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.125) internal successors, (99), 25 states have internal predecessors, (99), 0 states have call successors, (0), 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-11 17:46:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2024-10-11 17:46:19,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 17:46:19,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:19,024 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:19,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 17:46:19,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-11 17:46:19,225 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:19,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:19,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1098353385, now seen corresponding path program 6 times [2024-10-11 17:46:19,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:19,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338499215] [2024-10-11 17:46:19,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:19,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:19,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:19,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338499215] [2024-10-11 17:46:19,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338499215] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:19,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084760411] [2024-10-11 17:46:19,593 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 17:46:19,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:19,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:19,594 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:19,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 17:46:19,730 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-10-11 17:46:19,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:19,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-11 17:46:19,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:19,748 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 1 [2024-10-11 17:46:19,835 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-11 17:46:20,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:46:20,146 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 32 treesize of output 29 [2024-10-11 17:46:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:20,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:20,781 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 13 treesize of output 11 [2024-10-11 17:46:20,796 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 22 treesize of output 20 [2024-10-11 17:46:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:20,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084760411] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:20,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:20,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2024-10-11 17:46:20,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585228778] [2024-10-11 17:46:20,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:20,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 17:46:20,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:20,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 17:46:20,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1466, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 17:46:20,900 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand has 41 states, 41 states have (on average 2.5365853658536586) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 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-11 17:46:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:21,969 INFO L93 Difference]: Finished difference Result 332 states and 370 transitions. [2024-10-11 17:46:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 17:46:21,971 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.5365853658536586) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-11 17:46:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:21,975 INFO L225 Difference]: With dead ends: 332 [2024-10-11 17:46:21,975 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 17:46:21,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=476, Invalid=3064, Unknown=0, NotChecked=0, Total=3540 [2024-10-11 17:46:21,977 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 248 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:21,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 324 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:46:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 17:46:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 269. [2024-10-11 17:46:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 267 states have (on average 1.146067415730337) internal successors, (306), 268 states have internal predecessors, (306), 0 states have call successors, (0), 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-11 17:46:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2024-10-11 17:46:21,991 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 38 [2024-10-11 17:46:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:21,991 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2024-10-11 17:46:21,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.5365853658536586) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 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-11 17:46:21,991 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2024-10-11 17:46:21,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:46:21,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:21,992 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:22,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 17:46:22,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-11 17:46:22,193 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:22,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:22,193 INFO L85 PathProgramCache]: Analyzing trace with hash 695755247, now seen corresponding path program 7 times [2024-10-11 17:46:22,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:22,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330319437] [2024-10-11 17:46:22,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:22,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:22,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:22,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330319437] [2024-10-11 17:46:22,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330319437] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:22,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215560767] [2024-10-11 17:46:22,848 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 17:46:22,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:22,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:22,850 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:22,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 17:46:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:22,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 17:46:22,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:23,023 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 13 treesize of output 9 [2024-10-11 17:46:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:23,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:23,096 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-11 17:46:23,098 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 16 treesize of output 12 [2024-10-11 17:46:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:23,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215560767] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:23,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:23,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 28 [2024-10-11 17:46:23,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946599488] [2024-10-11 17:46:23,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:23,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 17:46:23,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:23,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 17:46:23,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2024-10-11 17:46:23,156 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 28 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:23,593 INFO L93 Difference]: Finished difference Result 382 states and 429 transitions. [2024-10-11 17:46:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 17:46:23,594 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-11 17:46:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:23,596 INFO L225 Difference]: With dead ends: 382 [2024-10-11 17:46:23,596 INFO L226 Difference]: Without dead ends: 352 [2024-10-11 17:46:23,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=1326, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 17:46:23,597 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 77 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:23,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 479 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:46:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-11 17:46:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 340. [2024-10-11 17:46:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 338 states have (on average 1.1479289940828403) internal successors, (388), 339 states have internal predecessors, (388), 0 states have call successors, (0), 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-11 17:46:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 388 transitions. [2024-10-11 17:46:23,604 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 388 transitions. Word has length 44 [2024-10-11 17:46:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:23,604 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 388 transitions. [2024-10-11 17:46:23,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 388 transitions. [2024-10-11 17:46:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:46:23,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:23,605 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:23,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 17:46:23,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-11 17:46:23,810 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:23,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2096048117, now seen corresponding path program 4 times [2024-10-11 17:46:23,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:23,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502391526] [2024-10-11 17:46:23,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:23,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:46:24,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:24,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502391526] [2024-10-11 17:46:24,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502391526] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:24,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023116708] [2024-10-11 17:46:24,765 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:46:24,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:24,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:24,768 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:24,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 17:46:24,854 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:46:24,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:24,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 17:46:24,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:24,887 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-11 17:46:25,967 INFO L349 Elim1Store]: treesize reduction 8, result has 76.5 percent of original size [2024-10-11 17:46:25,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 46 [2024-10-11 17:46:26,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:46:26,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 52 [2024-10-11 17:46:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 17:46:26,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:27,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:46:27,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 67 [2024-10-11 17:46:27,639 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 44 treesize of output 38 [2024-10-11 17:46:27,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2024-10-11 17:46:27,650 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-11 17:46:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 17:46:27,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023116708] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:27,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:27,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 59 [2024-10-11 17:46:27,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126081844] [2024-10-11 17:46:27,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:27,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-10-11 17:46:27,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:27,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-10-11 17:46:27,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=3118, Unknown=0, NotChecked=0, Total=3422 [2024-10-11 17:46:27,679 INFO L87 Difference]: Start difference. First operand 340 states and 388 transitions. Second operand has 59 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 59 states have internal predecessors, (115), 0 states have call successors, (0), 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-11 17:46:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:31,838 INFO L93 Difference]: Finished difference Result 476 states and 534 transitions. [2024-10-11 17:46:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-11 17:46:31,839 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 59 states have internal predecessors, (115), 0 states have call successors, (0), 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 44 [2024-10-11 17:46:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:31,839 INFO L225 Difference]: With dead ends: 476 [2024-10-11 17:46:31,839 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 17:46:31,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1014, Invalid=8298, Unknown=0, NotChecked=0, Total=9312 [2024-10-11 17:46:31,841 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 114 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:31,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 324 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1985 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 17:46:31,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 17:46:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 90. [2024-10-11 17:46:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 89 states have internal predecessors, (100), 0 states have call successors, (0), 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-11 17:46:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2024-10-11 17:46:31,844 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 44 [2024-10-11 17:46:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:31,844 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2024-10-11 17:46:31,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.9491525423728813) internal successors, (115), 59 states have internal predecessors, (115), 0 states have call successors, (0), 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-11 17:46:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2024-10-11 17:46:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:46:31,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:31,844 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:31,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 17:46:32,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:32,045 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:32,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash -772874010, now seen corresponding path program 8 times [2024-10-11 17:46:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:32,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119888144] [2024-10-11 17:46:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 9 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:32,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:32,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119888144] [2024-10-11 17:46:32,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119888144] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:32,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449804258] [2024-10-11 17:46:32,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:46:32,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:32,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:32,485 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:32,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 17:46:32,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:46:32,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:32,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-11 17:46:32,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:32,590 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 1 [2024-10-11 17:46:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 54 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:32,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 16 proven. 54 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:33,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449804258] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:33,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:33,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2024-10-11 17:46:33,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957542650] [2024-10-11 17:46:33,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:33,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 17:46:33,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:33,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 17:46:33,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1269, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 17:46:33,145 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 39 states, 38 states have (on average 3.026315789473684) internal successors, (115), 39 states have internal predecessors, (115), 0 states have call successors, (0), 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-11 17:46:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:33,515 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2024-10-11 17:46:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 17:46:33,516 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.026315789473684) internal successors, (115), 39 states have internal predecessors, (115), 0 states have call successors, (0), 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 46 [2024-10-11 17:46:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:33,516 INFO L225 Difference]: With dead ends: 110 [2024-10-11 17:46:33,516 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 17:46:33,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=305, Invalid=1857, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 17:46:33,517 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 117 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:33,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 260 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:46:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 17:46:33,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2024-10-11 17:46:33,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 97 states have internal predecessors, (109), 0 states have call successors, (0), 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-11 17:46:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2024-10-11 17:46:33,519 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 46 [2024-10-11 17:46:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:33,519 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2024-10-11 17:46:33,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.026315789473684) internal successors, (115), 39 states have internal predecessors, (115), 0 states have call successors, (0), 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-11 17:46:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2024-10-11 17:46:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 17:46:33,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:33,520 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:33,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-11 17:46:33,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-10-11 17:46:33,724 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:33,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1895653195, now seen corresponding path program 9 times [2024-10-11 17:46:33,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:33,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485013361] [2024-10-11 17:46:33,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:33,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:34,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:34,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485013361] [2024-10-11 17:46:34,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485013361] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:34,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462405934] [2024-10-11 17:46:34,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:46:34,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:34,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:34,115 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:34,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 17:46:34,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-11 17:46:34,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:34,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-11 17:46:34,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:34,338 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 13 treesize of output 9 [2024-10-11 17:46:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:34,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:34,423 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-11 17:46:34,424 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 16 treesize of output 12 [2024-10-11 17:46:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:34,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462405934] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:34,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:34,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 31 [2024-10-11 17:46:34,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735682674] [2024-10-11 17:46:34,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:34,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-11 17:46:34,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:34,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-11 17:46:34,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2024-10-11 17:46:34,477 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:34,926 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2024-10-11 17:46:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 17:46:34,927 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-11 17:46:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:34,927 INFO L225 Difference]: With dead ends: 166 [2024-10-11 17:46:34,927 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 17:46:34,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=1716, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 17:46:34,928 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 49 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:34,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 351 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:46:34,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 17:46:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-10-11 17:46:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.118811881188119) internal successors, (113), 101 states have internal predecessors, (113), 0 states have call successors, (0), 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-11 17:46:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2024-10-11 17:46:34,930 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 50 [2024-10-11 17:46:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:34,930 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2024-10-11 17:46:34,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:46:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2024-10-11 17:46:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 17:46:34,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:46:34,931 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:34,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 17:46:35,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-11 17:46:35,132 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-11 17:46:35,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:46:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash -498742676, now seen corresponding path program 10 times [2024-10-11 17:46:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:46:35,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654034928] [2024-10-11 17:46:35,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:46:35,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:46:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:46:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 16 proven. 86 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:46:35,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:46:35,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654034928] [2024-10-11 17:46:35,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654034928] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:46:35,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954150401] [2024-10-11 17:46:35,821 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:46:35,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:46:35,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:46:35,822 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:46:35,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 17:46:35,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:46:35,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:46:35,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-11 17:46:35,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:46:35,994 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-11 17:46:37,328 INFO L349 Elim1Store]: treesize reduction 20, result has 70.1 percent of original size [2024-10-11 17:46:37,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 83 [2024-10-11 17:46:37,338 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-11 17:46:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 17:46:37,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:46:38,443 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 89 treesize of output 77 [2024-10-11 17:46:38,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 115 [2024-10-11 17:46:38,460 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-10-11 17:46:38,466 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-11 17:46:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 17:46:38,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954150401] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:46:38,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:46:38,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 22] total 56 [2024-10-11 17:46:38,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679594686] [2024-10-11 17:46:38,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:46:38,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-11 17:46:38,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:46:38,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-11 17:46:38,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=2715, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 17:46:38,494 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 57 states, 56 states have (on average 2.107142857142857) internal successors, (118), 57 states have internal predecessors, (118), 0 states have call successors, (0), 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-11 17:46:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:46:40,743 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2024-10-11 17:46:40,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 17:46:40,743 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.107142857142857) internal successors, (118), 57 states have internal predecessors, (118), 0 states have call successors, (0), 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 52 [2024-10-11 17:46:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:46:40,744 INFO L225 Difference]: With dead ends: 113 [2024-10-11 17:46:40,744 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 17:46:40,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1939 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1195, Invalid=6287, Unknown=0, NotChecked=0, Total=7482 [2024-10-11 17:46:40,746 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 136 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 17:46:40,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 228 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 17:46:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 17:46:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 17:46:40,748 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-11 17:46:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 17:46:40,749 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-10-11 17:46:40,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:46:40,749 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 17:46:40,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.107142857142857) internal successors, (118), 57 states have internal predecessors, (118), 0 states have call successors, (0), 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-11 17:46:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 17:46:40,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 17:46:40,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 19 remaining) [2024-10-11 17:46:40,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2024-10-11 17:46:40,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2024-10-11 17:46:40,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 19 remaining) [2024-10-11 17:46:40,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2024-10-11 17:46:40,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2024-10-11 17:46:40,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 19 remaining) [2024-10-11 17:46:40,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2024-10-11 17:46:40,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2024-10-11 17:46:40,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 19 remaining) [2024-10-11 17:46:40,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 19 remaining) [2024-10-11 17:46:40,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 19 remaining) [2024-10-11 17:46:40,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 19 remaining) [2024-10-11 17:46:40,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 19 remaining) [2024-10-11 17:46:40,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 19 remaining) [2024-10-11 17:46:40,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 19 remaining) [2024-10-11 17:46:40,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2024-10-11 17:46:40,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2024-10-11 17:46:40,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (0 of 19 remaining) [2024-10-11 17:46:40,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-11 17:46:40,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-11 17:46:40,964 INFO L407 BasicCegarLoop]: Path program histogram: [10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:46:40,967 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:46:40,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:46:40 BoogieIcfgContainer [2024-10-11 17:46:40,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:46:40,971 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:46:40,971 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:46:40,971 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:46:40,971 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:46:02" (3/4) ... [2024-10-11 17:46:40,973 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:46:40,980 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-10-11 17:46:40,980 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:46:40,981 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 17:46:40,981 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:46:41,063 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:46:41,063 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:46:41,063 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:46:41,064 INFO L158 Benchmark]: Toolchain (without parser) took 39066.83ms. Allocated memory was 218.1MB in the beginning and 520.1MB in the end (delta: 302.0MB). Free memory was 145.1MB in the beginning and 470.2MB in the end (delta: -325.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:46:41,064 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:46:41,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.98ms. Allocated memory is still 218.1MB. Free memory was 144.8MB in the beginning and 126.4MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 17:46:41,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.72ms. Allocated memory is still 218.1MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:46:41,065 INFO L158 Benchmark]: Boogie Preprocessor took 52.87ms. Allocated memory is still 218.1MB. Free memory was 124.3MB in the beginning and 122.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:46:41,065 INFO L158 Benchmark]: RCFGBuilder took 485.15ms. Allocated memory is still 218.1MB. Free memory was 121.8MB in the beginning and 168.9MB in the end (delta: -47.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-10-11 17:46:41,065 INFO L158 Benchmark]: TraceAbstraction took 38049.09ms. Allocated memory was 218.1MB in the beginning and 520.1MB in the end (delta: 302.0MB). Free memory was 168.1MB in the beginning and 474.9MB in the end (delta: -306.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:46:41,065 INFO L158 Benchmark]: Witness Printer took 92.52ms. Allocated memory is still 520.1MB. Free memory was 474.9MB in the beginning and 470.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:46:41,066 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.14ms. Allocated memory is still 109.1MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.98ms. Allocated memory is still 218.1MB. Free memory was 144.8MB in the beginning and 126.4MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.72ms. Allocated memory is still 218.1MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.87ms. Allocated memory is still 218.1MB. Free memory was 124.3MB in the beginning and 122.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 485.15ms. Allocated memory is still 218.1MB. Free memory was 121.8MB in the beginning and 168.9MB in the end (delta: -47.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * TraceAbstraction took 38049.09ms. Allocated memory was 218.1MB in the beginning and 520.1MB in the end (delta: 302.0MB). Free memory was 168.1MB in the beginning and 474.9MB in the end (delta: -306.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 92.52ms. Allocated memory is still 520.1MB. Free memory was 474.9MB in the beginning and 470.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -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: -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: 529]: 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, 44 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 38.0s, OverallIterations: 39, TraceHistogramMax: 6, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1562 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1562 mSDsluCounter, 5232 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4319 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11022 IncrementalHoareTripleChecker+Invalid, 11119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 913 mSDtfsCounter, 11022 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1528 GetRequests, 787 SyntacticMatches, 8 SemanticMatches, 733 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 8629 ImplicationChecksByTransitivity, 16.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=35, InterpolantAutomatonStates: 449, 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, 39 MinimizatonAttempts, 413 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 1334 NumberOfCodeBlocks, 1303 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 1789 ConstructedInterpolants, 115 QuantifiedInterpolants, 20116 SizeOfPredicates, 117 NumberOfNonLiveVariables, 2860 ConjunctsInSsa, 617 ConjunctsInUnsatCore, 71 InterpolantComputations, 23 PerfectInterpolantSequences, 437/1523 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 19 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:46:41,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE