./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-optional-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:58:59,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:58:59,784 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:58:59,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:58:59,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:58:59,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:58:59,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:58:59,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:58:59,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:58:59,818 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:58:59,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:58:59,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:58:59,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:58:59,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:58:59,820 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:58:59,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:58:59,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:58:59,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:58:59,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:58:59,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:58:59,823 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:58:59,825 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:58:59,825 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:58:59,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:58:59,827 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:58:59,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:58:59,828 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:58:59,828 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:58:59,828 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:58:59,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:58:59,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:58:59,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:58:59,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:58:59,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:58:59,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:58:59,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:58:59,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:58:59,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:58:59,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:58:59,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:58:59,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:58:59,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:58:59,831 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2024-11-09 07:59:00,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:59:00,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:59:00,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:59:00,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:59:00,298 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:59:00,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-1.i [2024-11-09 07:59:02,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:59:02,662 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:59:02,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2024-11-09 07:59:02,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998a985a6/0534bfec0daa4c578dc35237de810549/FLAG35a7e05ca [2024-11-09 07:59:02,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/998a985a6/0534bfec0daa4c578dc35237de810549 [2024-11-09 07:59:02,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:59:02,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:59:02,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:59:02,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:59:02,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:59:02,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:59:02" (1/1) ... [2024-11-09 07:59:02,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@118d97b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:02, skipping insertion in model container [2024-11-09 07:59:02,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:59:02" (1/1) ... [2024-11-09 07:59:02,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:59:03,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:59:03,586 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:59:03,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:59:03,739 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:59:03,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03 WrapperNode [2024-11-09 07:59:03,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:59:03,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:59:03,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:59:03,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:59:03,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03" (1/1) ... [2024-11-09 07:59:03,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03" (1/1) ... [2024-11-09 07:59:03,814 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 141 [2024-11-09 07:59:03,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:59:03,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:59:03,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:59:03,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:59:03,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03" (1/1) ... [2024-11-09 07:59:03,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03" (1/1) ... [2024-11-09 07:59:03,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03" (1/1) ... [2024-11-09 07:59:03,873 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 17 writes are split as follows [0, 17]. [2024-11-09 07:59:03,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03" (1/1) ... [2024-11-09 07:59:03,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03" (1/1) ... [2024-11-09 07:59:03,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03" (1/1) ... [2024-11-09 07:59:03,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03" (1/1) ... [2024-11-09 07:59:03,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03" (1/1) ... [2024-11-09 07:59:03,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03" (1/1) ... [2024-11-09 07:59:03,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:59:03,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:59:03,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:59:03,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:59:03,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03" (1/1) ... [2024-11-09 07:59:03,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:59:03,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:03,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:59:03,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:59:04,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:59:04,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:59:04,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:59:04,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:59:04,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:59:04,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:59:04,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:59:04,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:59:04,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:59:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:59:04,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:59:04,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:59:04,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:59:04,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:59:04,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:59:04,228 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:59:04,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:59:04,875 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-09 07:59:04,875 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:59:04,910 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:59:04,910 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 07:59:04,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:59:04 BoogieIcfgContainer [2024-11-09 07:59:04,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:59:04,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:59:04,917 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:59:04,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:59:04,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:59:02" (1/3) ... [2024-11-09 07:59:04,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c75aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:59:04, skipping insertion in model container [2024-11-09 07:59:04,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:59:03" (2/3) ... [2024-11-09 07:59:04,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c75aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:59:04, skipping insertion in model container [2024-11-09 07:59:04,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:59:04" (3/3) ... [2024-11-09 07:59:04,927 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2024-11-09 07:59:04,959 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:59:04,960 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2024-11-09 07:59:05,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:59:05,046 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;@5b63868, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:59:05,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2024-11-09 07:59:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 78 states have (on average 2.076923076923077) internal successors, (162), 144 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:05,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:59:05,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:05,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:59:05,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:05,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:05,081 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-09 07:59:05,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:05,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889140120] [2024-11-09 07:59:05,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:05,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:05,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:05,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889140120] [2024-11-09 07:59:05,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889140120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:05,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:05,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:59:05,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702312268] [2024-11-09 07:59:05,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:05,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:59:05,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:05,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:59:05,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:05,589 INFO L87 Difference]: Start difference. First operand has 145 states, 78 states have (on average 2.076923076923077) internal successors, (162), 144 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:05,864 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2024-11-09 07:59:05,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:59:05,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-09 07:59:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:05,889 INFO L225 Difference]: With dead ends: 139 [2024-11-09 07:59:05,890 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 07:59:05,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:05,900 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:05,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 87 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 07:59:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-11-09 07:59:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 135 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2024-11-09 07:59:05,983 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 3 [2024-11-09 07:59:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:05,988 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2024-11-09 07:59:05,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2024-11-09 07:59:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 07:59:05,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:05,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 07:59:05,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:59:05,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:05,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:05,990 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-09 07:59:05,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:05,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300970308] [2024-11-09 07:59:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:05,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:06,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300970308] [2024-11-09 07:59:06,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300970308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:06,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:06,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:59:06,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563196341] [2024-11-09 07:59:06,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:06,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:59:06,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:06,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:59:06,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:06,194 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:06,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:06,377 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2024-11-09 07:59:06,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:59:06,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-09 07:59:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:06,384 INFO L225 Difference]: With dead ends: 128 [2024-11-09 07:59:06,384 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 07:59:06,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:06,385 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 102 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:06,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 98 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 07:59:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-09 07:59:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 79 states have (on average 1.7721518987341771) internal successors, (140), 127 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2024-11-09 07:59:06,402 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 3 [2024-11-09 07:59:06,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:06,403 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2024-11-09 07:59:06,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2024-11-09 07:59:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:59:06,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:06,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:06,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:59:06,449 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:06,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:06,450 INFO L85 PathProgramCache]: Analyzing trace with hash 171916845, now seen corresponding path program 1 times [2024-11-09 07:59:06,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:06,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246985907] [2024-11-09 07:59:06,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:06,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:06,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:06,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246985907] [2024-11-09 07:59:06,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246985907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:06,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:06,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:59:06,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508208152] [2024-11-09 07:59:06,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:06,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:59:06,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:06,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:59:06,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:06,744 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:07,010 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2024-11-09 07:59:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:07,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-11-09 07:59:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:07,012 INFO L225 Difference]: With dead ends: 169 [2024-11-09 07:59:07,012 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 07:59:07,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:59:07,015 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 46 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:07,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 318 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 07:59:07,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 127. [2024-11-09 07:59:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 79 states have (on average 1.759493670886076) internal successors, (139), 126 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2024-11-09 07:59:07,032 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 11 [2024-11-09 07:59:07,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:07,032 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2024-11-09 07:59:07,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2024-11-09 07:59:07,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:59:07,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:07,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:07,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:59:07,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:07,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash 171916846, now seen corresponding path program 1 times [2024-11-09 07:59:07,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:07,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536085228] [2024-11-09 07:59:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:07,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:07,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536085228] [2024-11-09 07:59:07,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536085228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:07,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:07,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:59:07,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494035780] [2024-11-09 07:59:07,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:07,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:59:07,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:07,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:59:07,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:07,342 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:07,586 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2024-11-09 07:59:07,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:07,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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-11-09 07:59:07,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:07,587 INFO L225 Difference]: With dead ends: 126 [2024-11-09 07:59:07,589 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 07:59:07,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:59:07,594 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:07,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 353 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 07:59:07,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-09 07:59:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 79 states have (on average 1.7468354430379747) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2024-11-09 07:59:07,607 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 11 [2024-11-09 07:59:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:07,608 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2024-11-09 07:59:07,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2024-11-09 07:59:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:59:07,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:07,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:07,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:59:07,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:07,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:07,613 INFO L85 PathProgramCache]: Analyzing trace with hash -468215045, now seen corresponding path program 1 times [2024-11-09 07:59:07,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:07,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303719292] [2024-11-09 07:59:07,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:07,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:07,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:07,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303719292] [2024-11-09 07:59:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303719292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:07,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:07,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:59:07,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582206853] [2024-11-09 07:59:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:07,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:59:07,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:07,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:59:07,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:07,832 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:08,070 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2024-11-09 07:59:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:08,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 07:59:08,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:08,071 INFO L225 Difference]: With dead ends: 121 [2024-11-09 07:59:08,072 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 07:59:08,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-09 07:59:08,072 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 146 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:08,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 74 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 07:59:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-11-09 07:59:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.6) internal successors, (136), 118 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2024-11-09 07:59:08,084 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 12 [2024-11-09 07:59:08,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:08,087 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2024-11-09 07:59:08,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2024-11-09 07:59:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 07:59:08,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:08,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:08,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:59:08,092 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:08,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash -468215044, now seen corresponding path program 1 times [2024-11-09 07:59:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403992457] [2024-11-09 07:59:08,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:08,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:08,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403992457] [2024-11-09 07:59:08,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403992457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:08,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:08,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:59:08,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015413249] [2024-11-09 07:59:08,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:08,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:59:08,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:08,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:59:08,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:59:08,398 INFO L87 Difference]: Start difference. First operand 119 states and 136 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-11-09 07:59:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:08,785 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2024-11-09 07:59:08,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:59:08,786 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-11-09 07:59:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:08,786 INFO L225 Difference]: With dead ends: 156 [2024-11-09 07:59:08,786 INFO L226 Difference]: Without dead ends: 156 [2024-11-09 07:59:08,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:59:08,787 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 280 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:08,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 155 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:59:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-09 07:59:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147. [2024-11-09 07:59:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 113 states have (on average 1.5221238938053097) internal successors, (172), 146 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2024-11-09 07:59:08,807 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 12 [2024-11-09 07:59:08,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:08,808 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2024-11-09 07:59:08,812 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-11-09 07:59:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2024-11-09 07:59:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:59:08,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:08,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:08,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:59:08,813 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:08,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:08,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220227, now seen corresponding path program 1 times [2024-11-09 07:59:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:08,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803047268] [2024-11-09 07:59:08,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:08,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:09,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:09,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803047268] [2024-11-09 07:59:09,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803047268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:09,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:09,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:59:09,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936899827] [2024-11-09 07:59:09,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:09,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:59:09,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:09,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:59:09,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:59:09,056 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:09,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:09,331 INFO L93 Difference]: Finished difference Result 147 states and 172 transitions. [2024-11-09 07:59:09,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:59:09,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 07:59:09,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:09,332 INFO L225 Difference]: With dead ends: 147 [2024-11-09 07:59:09,332 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 07:59:09,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:59:09,333 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 45 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:09,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 277 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:09,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 07:59:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-11-09 07:59:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 113 states have (on average 1.5132743362831858) internal successors, (171), 145 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2024-11-09 07:59:09,348 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 16 [2024-11-09 07:59:09,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:09,348 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2024-11-09 07:59:09,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2024-11-09 07:59:09,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:59:09,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:09,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:09,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:59:09,349 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:09,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:09,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220226, now seen corresponding path program 1 times [2024-11-09 07:59:09,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:09,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078188132] [2024-11-09 07:59:09,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:09,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:09,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:09,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078188132] [2024-11-09 07:59:09,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078188132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:09,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:09,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:59:09,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481710613] [2024-11-09 07:59:09,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:09,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:59:09,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:09,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:59:09,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:59:09,612 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:09,853 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2024-11-09 07:59:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:59:09,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 07:59:09,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:09,858 INFO L225 Difference]: With dead ends: 137 [2024-11-09 07:59:09,858 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 07:59:09,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:59:09,859 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 22 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:09,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 328 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 07:59:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2024-11-09 07:59:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.4351851851851851) internal successors, (155), 130 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2024-11-09 07:59:09,864 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 16 [2024-11-09 07:59:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:09,864 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2024-11-09 07:59:09,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2024-11-09 07:59:09,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:59:09,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:09,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:09,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:59:09,870 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:09,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2123667724, now seen corresponding path program 1 times [2024-11-09 07:59:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:09,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675348963] [2024-11-09 07:59:09,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:09,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:09,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:09,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675348963] [2024-11-09 07:59:09,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675348963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:09,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:09,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:59:09,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375100725] [2024-11-09 07:59:09,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:09,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:59:09,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:09,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:59:09,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:09,935 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-11-09 07:59:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:10,049 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2024-11-09 07:59:10,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:10,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-11-09 07:59:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:10,054 INFO L225 Difference]: With dead ends: 149 [2024-11-09 07:59:10,055 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 07:59:10,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-09 07:59:10,055 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 146 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:10,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 156 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:10,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 07:59:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2024-11-09 07:59:10,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 130 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2024-11-09 07:59:10,059 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 17 [2024-11-09 07:59:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:10,059 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2024-11-09 07:59:10,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-11-09 07:59:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2024-11-09 07:59:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:59:10,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:10,063 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-11-09 07:59:10,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:59:10,064 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:10,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:10,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1866791259, now seen corresponding path program 1 times [2024-11-09 07:59:10,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:10,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825562048] [2024-11-09 07:59:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:10,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:10,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:10,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825562048] [2024-11-09 07:59:10,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825562048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:10,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:10,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:59:10,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863098779] [2024-11-09 07:59:10,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:10,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:59:10,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:10,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:59:10,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:10,126 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:10,147 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2024-11-09 07:59:10,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:59:10,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-11-09 07:59:10,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:10,151 INFO L225 Difference]: With dead ends: 137 [2024-11-09 07:59:10,151 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 07:59:10,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:10,152 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:10,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 306 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:59:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 07:59:10,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2024-11-09 07:59:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2024-11-09 07:59:10,155 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 20 [2024-11-09 07:59:10,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:10,156 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2024-11-09 07:59:10,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2024-11-09 07:59:10,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:59:10,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:10,159 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-11-09 07:59:10,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:59:10,160 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:10,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:10,160 INFO L85 PathProgramCache]: Analyzing trace with hash 72886850, now seen corresponding path program 1 times [2024-11-09 07:59:10,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:10,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550758752] [2024-11-09 07:59:10,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:10,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:10,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:10,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550758752] [2024-11-09 07:59:10,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550758752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:10,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:10,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:59:10,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805731821] [2024-11-09 07:59:10,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:10,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:59:10,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:10,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:59:10,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:59:10,373 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:10,784 INFO L93 Difference]: Finished difference Result 217 states and 248 transitions. [2024-11-09 07:59:10,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:59:10,785 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-11-09 07:59:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:10,786 INFO L225 Difference]: With dead ends: 217 [2024-11-09 07:59:10,786 INFO L226 Difference]: Without dead ends: 217 [2024-11-09 07:59:10,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:59:10,786 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 227 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:10,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 327 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:59:10,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-09 07:59:10,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 149. [2024-11-09 07:59:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 126 states have (on average 1.3888888888888888) internal successors, (175), 148 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 175 transitions. [2024-11-09 07:59:10,794 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 175 transitions. Word has length 22 [2024-11-09 07:59:10,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:10,795 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 175 transitions. [2024-11-09 07:59:10,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 175 transitions. [2024-11-09 07:59:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:59:10,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:10,797 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-11-09 07:59:10,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:59:10,801 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:10,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 72886851, now seen corresponding path program 1 times [2024-11-09 07:59:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:10,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330898902] [2024-11-09 07:59:10,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:10,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:11,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:11,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330898902] [2024-11-09 07:59:11,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330898902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:11,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:11,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:59:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762366688] [2024-11-09 07:59:11,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:11,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:59:11,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:11,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:59:11,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:59:11,120 INFO L87 Difference]: Start difference. First operand 149 states and 175 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:11,846 INFO L93 Difference]: Finished difference Result 211 states and 241 transitions. [2024-11-09 07:59:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:59:11,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-11-09 07:59:11,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:11,851 INFO L225 Difference]: With dead ends: 211 [2024-11-09 07:59:11,851 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 07:59:11,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:59:11,852 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 212 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:11,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 409 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:59:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 07:59:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 145. [2024-11-09 07:59:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 144 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2024-11-09 07:59:11,861 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 22 [2024-11-09 07:59:11,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:11,861 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2024-11-09 07:59:11,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2024-11-09 07:59:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:59:11,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:11,865 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] [2024-11-09 07:59:11,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:59:11,865 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:11,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:11,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2074520553, now seen corresponding path program 1 times [2024-11-09 07:59:11,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:11,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091998910] [2024-11-09 07:59:11,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:11,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:11,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:11,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091998910] [2024-11-09 07:59:11,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091998910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:11,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:11,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:59:11,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041381640] [2024-11-09 07:59:11,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:11,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:59:11,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:11,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:59:11,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:59:11,914 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:11,926 INFO L93 Difference]: Finished difference Result 147 states and 171 transitions. [2024-11-09 07:59:11,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:59:11,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:59:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:11,932 INFO L225 Difference]: With dead ends: 147 [2024-11-09 07:59:11,932 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 07:59:11,932 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-11-09 07:59:11,933 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:11,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:59:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 07:59:11,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-09 07:59:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 146 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2024-11-09 07:59:11,941 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 171 transitions. Word has length 23 [2024-11-09 07:59:11,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:11,941 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 171 transitions. [2024-11-09 07:59:11,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2024-11-09 07:59:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:59:11,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:11,942 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-11-09 07:59:11,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:59:11,942 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:11,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:11,943 INFO L85 PathProgramCache]: Analyzing trace with hash 913286409, now seen corresponding path program 1 times [2024-11-09 07:59:11,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:11,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321136468] [2024-11-09 07:59:11,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:11,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:12,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:12,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321136468] [2024-11-09 07:59:12,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321136468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:12,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:12,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:59:12,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819580115] [2024-11-09 07:59:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:12,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:59:12,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:12,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:59:12,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:12,167 INFO L87 Difference]: Start difference. First operand 147 states and 171 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:12,349 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2024-11-09 07:59:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:12,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 24 [2024-11-09 07:59:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:12,350 INFO L225 Difference]: With dead ends: 152 [2024-11-09 07:59:12,350 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 07:59:12,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:59:12,350 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 5 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:12,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 287 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:12,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 07:59:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2024-11-09 07:59:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 124 states have (on average 1.3709677419354838) internal successors, (170), 145 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-11-09 07:59:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2024-11-09 07:59:12,357 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 24 [2024-11-09 07:59:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:12,358 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2024-11-09 07:59:12,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2024-11-09 07:59:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:59:12,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:12,358 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-11-09 07:59:12,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:59:12,358 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:12,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:12,359 INFO L85 PathProgramCache]: Analyzing trace with hash 913286410, now seen corresponding path program 1 times [2024-11-09 07:59:12,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:12,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359327869] [2024-11-09 07:59:12,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:12,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:12,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:12,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359327869] [2024-11-09 07:59:12,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359327869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:12,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:12,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:59:12,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967174600] [2024-11-09 07:59:12,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:12,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:59:12,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:12,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:59:12,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:59:12,736 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:12,889 INFO L93 Difference]: Finished difference Result 145 states and 169 transitions. [2024-11-09 07:59:12,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:12,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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 24 [2024-11-09 07:59:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:12,890 INFO L225 Difference]: With dead ends: 145 [2024-11-09 07:59:12,894 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 07:59:12,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:59:12,895 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:12,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 279 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:12,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 07:59:12,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-09 07:59:12,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 144 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 169 transitions. [2024-11-09 07:59:12,898 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 169 transitions. Word has length 24 [2024-11-09 07:59:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:12,898 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 169 transitions. [2024-11-09 07:59:12,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 169 transitions. [2024-11-09 07:59:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:59:12,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:12,903 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, 1] [2024-11-09 07:59:12,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:59:12,903 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:12,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:12,904 INFO L85 PathProgramCache]: Analyzing trace with hash -698900942, now seen corresponding path program 1 times [2024-11-09 07:59:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:12,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540176042] [2024-11-09 07:59:12,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:12,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:13,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:13,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540176042] [2024-11-09 07:59:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540176042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:13,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:13,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:59:13,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240227292] [2024-11-09 07:59:13,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:13,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:59:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:13,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:59:13,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:59:13,171 INFO L87 Difference]: Start difference. First operand 145 states and 169 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:13,477 INFO L93 Difference]: Finished difference Result 208 states and 238 transitions. [2024-11-09 07:59:13,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:59:13,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 07:59:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:13,478 INFO L225 Difference]: With dead ends: 208 [2024-11-09 07:59:13,479 INFO L226 Difference]: Without dead ends: 208 [2024-11-09 07:59:13,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:59:13,480 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 154 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:13,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 387 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:13,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-09 07:59:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 151. [2024-11-09 07:59:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.353846153846154) internal successors, (176), 150 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 176 transitions. [2024-11-09 07:59:13,490 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 176 transitions. Word has length 25 [2024-11-09 07:59:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:13,490 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 176 transitions. [2024-11-09 07:59:13,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2024-11-09 07:59:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:59:13,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:13,493 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, 1, 1] [2024-11-09 07:59:13,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:59:13,493 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:13,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:13,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1848177146, now seen corresponding path program 1 times [2024-11-09 07:59:13,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:13,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028541914] [2024-11-09 07:59:13,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:13,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:13,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:13,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028541914] [2024-11-09 07:59:13,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028541914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:13,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:59:13,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259385715] [2024-11-09 07:59:13,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:13,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:59:13,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:13,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:59:13,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:59:13,728 INFO L87 Difference]: Start difference. First operand 151 states and 176 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:14,031 INFO L93 Difference]: Finished difference Result 272 states and 310 transitions. [2024-11-09 07:59:14,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:59:14,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 07:59:14,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:14,032 INFO L225 Difference]: With dead ends: 272 [2024-11-09 07:59:14,032 INFO L226 Difference]: Without dead ends: 272 [2024-11-09 07:59:14,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:59:14,032 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 317 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:14,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 413 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-09 07:59:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 164. [2024-11-09 07:59:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 143 states have (on average 1.3496503496503496) internal successors, (193), 163 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2024-11-09 07:59:14,035 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 26 [2024-11-09 07:59:14,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:14,036 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2024-11-09 07:59:14,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2024-11-09 07:59:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:59:14,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:14,037 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, 1, 1] [2024-11-09 07:59:14,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:59:14,037 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:14,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:14,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1848177147, now seen corresponding path program 1 times [2024-11-09 07:59:14,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:14,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816840509] [2024-11-09 07:59:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:14,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:14,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:14,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816840509] [2024-11-09 07:59:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816840509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:14,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:14,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:59:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254965502] [2024-11-09 07:59:14,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:14,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:59:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:14,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:59:14,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:59:14,329 INFO L87 Difference]: Start difference. First operand 164 states and 193 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:14,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:14,757 INFO L93 Difference]: Finished difference Result 231 states and 265 transitions. [2024-11-09 07:59:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:59:14,757 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 07:59:14,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:14,758 INFO L225 Difference]: With dead ends: 231 [2024-11-09 07:59:14,758 INFO L226 Difference]: Without dead ends: 231 [2024-11-09 07:59:14,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:59:14,759 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 245 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:14,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 487 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:59:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-09 07:59:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 164. [2024-11-09 07:59:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 143 states have (on average 1.3426573426573427) internal successors, (192), 163 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 192 transitions. [2024-11-09 07:59:14,763 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 192 transitions. Word has length 26 [2024-11-09 07:59:14,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:14,763 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 192 transitions. [2024-11-09 07:59:14,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 192 transitions. [2024-11-09 07:59:14,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:59:14,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:14,764 INFO L215 NwaCegarLoop]: trace histogram [2, 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-11-09 07:59:14,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:59:14,764 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:14,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:14,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1432616807, now seen corresponding path program 1 times [2024-11-09 07:59:14,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:14,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951843471] [2024-11-09 07:59:14,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:14,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:14,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:14,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951843471] [2024-11-09 07:59:14,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951843471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:14,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:14,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:59:14,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492618591] [2024-11-09 07:59:14,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:14,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:59:14,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:14,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:59:14,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:14,813 INFO L87 Difference]: Start difference. First operand 164 states and 192 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:14,837 INFO L93 Difference]: Finished difference Result 168 states and 195 transitions. [2024-11-09 07:59:14,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:59:14,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 07:59:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:14,838 INFO L225 Difference]: With dead ends: 168 [2024-11-09 07:59:14,838 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 07:59:14,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:14,840 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:14,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:59:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 07:59:14,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-09 07:59:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 167 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 195 transitions. [2024-11-09 07:59:14,844 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 195 transitions. Word has length 26 [2024-11-09 07:59:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:14,844 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 195 transitions. [2024-11-09 07:59:14,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 195 transitions. [2024-11-09 07:59:14,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:59:14,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:14,845 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1] [2024-11-09 07:59:14,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:59:14,845 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:14,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:14,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1368243358, now seen corresponding path program 1 times [2024-11-09 07:59:14,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:14,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116978677] [2024-11-09 07:59:14,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:14,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:15,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116978677] [2024-11-09 07:59:15,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116978677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:15,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141855753] [2024-11-09 07:59:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:15,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:15,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:15,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:15,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:59:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:15,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:59:15,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:15,188 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 11 treesize of output 7 [2024-11-09 07:59:15,193 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 11 treesize of output 7 [2024-11-09 07:59:15,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:59:15,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:59:15,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:59:15,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:59:15,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:15,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:15,866 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 10 treesize of output 8 [2024-11-09 07:59:15,870 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 14 treesize of output 12 [2024-11-09 07:59:15,876 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 10 treesize of output 8 [2024-11-09 07:59:15,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:59:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:15,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141855753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:59:15,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:59:15,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2024-11-09 07:59:15,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027111503] [2024-11-09 07:59:15,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:59:15,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:59:15,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:15,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:59:15,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:59:15,890 INFO L87 Difference]: Start difference. First operand 168 states and 195 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 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-11-09 07:59:16,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:16,282 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2024-11-09 07:59:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:59:16,283 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 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) Word has length 28 [2024-11-09 07:59:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:16,283 INFO L225 Difference]: With dead ends: 223 [2024-11-09 07:59:16,283 INFO L226 Difference]: Without dead ends: 223 [2024-11-09 07:59:16,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:59:16,284 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 350 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:16,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 476 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:16,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-09 07:59:16,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 183. [2024-11-09 07:59:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.308641975308642) internal successors, (212), 182 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2024-11-09 07:59:16,287 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 28 [2024-11-09 07:59:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:16,287 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2024-11-09 07:59:16,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 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-11-09 07:59:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2024-11-09 07:59:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:59:16,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:16,288 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, 1, 1, 1, 1, 1] [2024-11-09 07:59:16,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:59:16,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:16,492 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:16,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:16,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1252975750, now seen corresponding path program 1 times [2024-11-09 07:59:16,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:16,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249458044] [2024-11-09 07:59:16,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:16,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:16,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:16,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249458044] [2024-11-09 07:59:16,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249458044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:16,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:16,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:59:16,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957872067] [2024-11-09 07:59:16,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:16,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:59:16,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:16,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:59:16,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:59:16,652 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:16,967 INFO L93 Difference]: Finished difference Result 208 states and 235 transitions. [2024-11-09 07:59:16,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:59:16,967 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 07:59:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:16,968 INFO L225 Difference]: With dead ends: 208 [2024-11-09 07:59:16,968 INFO L226 Difference]: Without dead ends: 208 [2024-11-09 07:59:16,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:59:16,969 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 216 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:16,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 409 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-09 07:59:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 181. [2024-11-09 07:59:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 160 states have (on average 1.30625) internal successors, (209), 180 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 209 transitions. [2024-11-09 07:59:16,973 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 209 transitions. Word has length 29 [2024-11-09 07:59:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:16,973 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 209 transitions. [2024-11-09 07:59:16,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2024-11-09 07:59:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:59:16,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:16,974 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:16,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:59:16,974 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:16,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:16,975 INFO L85 PathProgramCache]: Analyzing trace with hash -386891779, now seen corresponding path program 1 times [2024-11-09 07:59:16,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:16,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655583103] [2024-11-09 07:59:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:16,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:17,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:17,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655583103] [2024-11-09 07:59:17,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655583103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:17,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:17,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:59:17,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441280310] [2024-11-09 07:59:17,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:17,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:59:17,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:17,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:59:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:59:17,107 INFO L87 Difference]: Start difference. First operand 181 states and 209 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:17,324 INFO L93 Difference]: Finished difference Result 214 states and 245 transitions. [2024-11-09 07:59:17,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:59:17,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-09 07:59:17,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:17,326 INFO L225 Difference]: With dead ends: 214 [2024-11-09 07:59:17,326 INFO L226 Difference]: Without dead ends: 214 [2024-11-09 07:59:17,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:59:17,326 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 22 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:17,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 455 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:17,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-09 07:59:17,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 187. [2024-11-09 07:59:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 186 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 216 transitions. [2024-11-09 07:59:17,330 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 216 transitions. Word has length 31 [2024-11-09 07:59:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:17,330 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 216 transitions. [2024-11-09 07:59:17,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 216 transitions. [2024-11-09 07:59:17,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:59:17,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:17,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:17,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:59:17,332 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:17,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:17,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1209371901, now seen corresponding path program 1 times [2024-11-09 07:59:17,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:17,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580439137] [2024-11-09 07:59:17,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:17,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:17,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:17,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580439137] [2024-11-09 07:59:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580439137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:17,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:17,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 07:59:17,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579378379] [2024-11-09 07:59:17,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:17,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:59:17,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:17,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:59:17,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:59:17,605 INFO L87 Difference]: Start difference. First operand 187 states and 216 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:18,111 INFO L93 Difference]: Finished difference Result 213 states and 240 transitions. [2024-11-09 07:59:18,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:59:18,111 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 07:59:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:18,112 INFO L225 Difference]: With dead ends: 213 [2024-11-09 07:59:18,112 INFO L226 Difference]: Without dead ends: 213 [2024-11-09 07:59:18,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:59:18,113 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 166 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:18,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 713 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:59:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-09 07:59:18,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 184. [2024-11-09 07:59:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 163 states have (on average 1.294478527607362) internal successors, (211), 183 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 211 transitions. [2024-11-09 07:59:18,116 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 211 transitions. Word has length 34 [2024-11-09 07:59:18,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:18,116 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 211 transitions. [2024-11-09 07:59:18,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:18,116 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 211 transitions. [2024-11-09 07:59:18,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:59:18,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:18,117 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:18,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:59:18,117 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:18,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash 745727206, now seen corresponding path program 1 times [2024-11-09 07:59:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:18,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343293176] [2024-11-09 07:59:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:18,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:18,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343293176] [2024-11-09 07:59:18,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343293176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:18,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498242299] [2024-11-09 07:59:18,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:18,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:18,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:18,609 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:18,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:59:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:18,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 07:59:18,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:18,717 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 6 treesize of output 5 [2024-11-09 07:59:18,731 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 11 treesize of output 7 [2024-11-09 07:59:18,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:59:18,810 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:59:18,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-11-09 07:59:18,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:59:18,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:59:18,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 07:59:18,898 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 16 treesize of output 8 [2024-11-09 07:59:18,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:59:19,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:59:19,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:59:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:19,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:19,158 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_673 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2024-11-09 07:59:19,261 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_673 (Array Int Int))) (or (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (not (= v_ArrVal_670 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_670 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) is different from false [2024-11-09 07:59:19,340 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_670 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_9| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_55| Int) (v_ArrVal_673 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_55|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|) 0)) (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_670) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_673) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (not (= v_ArrVal_670 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_55| (select v_ArrVal_670 |v_ULTIMATE.start_main_~x~0#1.offset_55|)))))) is different from false [2024-11-09 07:59:19,357 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_670 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_9| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_55| Int) (v_ArrVal_673 (Array Int Int))) (or (not (= v_ArrVal_670 (store (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0 (select v_ArrVal_670 .cse0))) |v_ULTIMATE.start_main_~x~0#1.offset_55| (select v_ArrVal_670 |v_ULTIMATE.start_main_~x~0#1.offset_55|)))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_55|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|) 0)) (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_670) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_673) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))))) is different from false [2024-11-09 07:59:19,368 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 52 treesize of output 50 [2024-11-09 07:59:19,372 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 26 treesize of output 22 [2024-11-09 07:59:19,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:19,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:19,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498242299] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:59:19,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:59:19,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 35 [2024-11-09 07:59:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448184224] [2024-11-09 07:59:19,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:59:19,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 07:59:19,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:19,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 07:59:19,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=810, Unknown=14, NotChecked=244, Total=1190 [2024-11-09 07:59:19,402 INFO L87 Difference]: Start difference. First operand 184 states and 211 transitions. Second operand has 35 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:20,760 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) 8) 0) (forall ((v_ArrVal_673 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))) (not (= (select .cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) 2)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) 4) |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_9| Int)) (or (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_673 (Array Int Int))) (or (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_670) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_673) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (not (= v_ArrVal_670 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_670 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|) 0)))))) is different from false [2024-11-09 07:59:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:21,428 INFO L93 Difference]: Finished difference Result 581 states and 650 transitions. [2024-11-09 07:59:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-09 07:59:21,429 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-09 07:59:21,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:21,430 INFO L225 Difference]: With dead ends: 581 [2024-11-09 07:59:21,430 INFO L226 Difference]: Without dead ends: 581 [2024-11-09 07:59:21,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=676, Invalid=3479, Unknown=25, NotChecked=650, Total=4830 [2024-11-09 07:59:21,432 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 866 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 148 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 3884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 1966 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:21,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1574 Invalid, 3884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1764 Invalid, 6 Unknown, 1966 Unchecked, 0.9s Time] [2024-11-09 07:59:21,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-09 07:59:21,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 230. [2024-11-09 07:59:21,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 209 states have (on average 1.2727272727272727) internal successors, (266), 229 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:21,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 266 transitions. [2024-11-09 07:59:21,436 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 266 transitions. Word has length 34 [2024-11-09 07:59:21,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:21,436 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 266 transitions. [2024-11-09 07:59:21,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5714285714285716) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 266 transitions. [2024-11-09 07:59:21,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:59:21,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:21,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:21,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:59:21,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 07:59:21,638 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:21,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:21,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1190407055, now seen corresponding path program 1 times [2024-11-09 07:59:21,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:21,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569351237] [2024-11-09 07:59:21,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:21,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:21,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:21,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569351237] [2024-11-09 07:59:21,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569351237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:21,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972283716] [2024-11-09 07:59:21,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:21,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:21,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:21,867 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:21,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:59:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:21,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:59:22,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:22,018 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 11 treesize of output 7 [2024-11-09 07:59:22,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:59:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:22,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:22,541 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 20 treesize of output 18 [2024-11-09 07:59:22,547 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 46 treesize of output 42 [2024-11-09 07:59:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:22,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972283716] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:22,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:59:22,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 9] total 24 [2024-11-09 07:59:22,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263838561] [2024-11-09 07:59:22,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:22,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:59:22,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:22,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:59:22,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:59:22,572 INFO L87 Difference]: Start difference. First operand 230 states and 266 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:22,819 INFO L93 Difference]: Finished difference Result 253 states and 290 transitions. [2024-11-09 07:59:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:59:22,824 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 07:59:22,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:22,824 INFO L225 Difference]: With dead ends: 253 [2024-11-09 07:59:22,824 INFO L226 Difference]: Without dead ends: 253 [2024-11-09 07:59:22,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2024-11-09 07:59:22,825 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 159 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:22,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 414 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:59:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-09 07:59:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 245. [2024-11-09 07:59:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 224 states have (on average 1.2544642857142858) internal successors, (281), 244 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 281 transitions. [2024-11-09 07:59:22,828 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 281 transitions. Word has length 35 [2024-11-09 07:59:22,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:22,828 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 281 transitions. [2024-11-09 07:59:22,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 281 transitions. [2024-11-09 07:59:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:59:22,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:22,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:22,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:59:23,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:23,034 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:23,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:23,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1190418040, now seen corresponding path program 1 times [2024-11-09 07:59:23,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:23,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083116139] [2024-11-09 07:59:23,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:23,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:59:23,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:23,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083116139] [2024-11-09 07:59:23,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083116139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:59:23,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:59:23,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:59:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137937059] [2024-11-09 07:59:23,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:59:23,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:59:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:23,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:59:23,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:59:23,105 INFO L87 Difference]: Start difference. First operand 245 states and 281 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:23,199 INFO L93 Difference]: Finished difference Result 261 states and 291 transitions. [2024-11-09 07:59:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:59:23,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 07:59:23,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:23,201 INFO L225 Difference]: With dead ends: 261 [2024-11-09 07:59:23,201 INFO L226 Difference]: Without dead ends: 261 [2024-11-09 07:59:23,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-09 07:59:23,202 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 109 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:23,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 139 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:59:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-09 07:59:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 247. [2024-11-09 07:59:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 226 states have (on average 1.252212389380531) internal successors, (283), 246 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 283 transitions. [2024-11-09 07:59:23,208 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 283 transitions. Word has length 35 [2024-11-09 07:59:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:23,212 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 283 transitions. [2024-11-09 07:59:23,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 283 transitions. [2024-11-09 07:59:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:59:23,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:23,213 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:23,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 07:59:23,213 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:23,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:23,213 INFO L85 PathProgramCache]: Analyzing trace with hash -724225778, now seen corresponding path program 1 times [2024-11-09 07:59:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:23,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438412042] [2024-11-09 07:59:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:23,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:23,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:23,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438412042] [2024-11-09 07:59:23,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438412042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:23,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728217749] [2024-11-09 07:59:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:23,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:23,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:23,823 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:23,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:59:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:23,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 07:59:23,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:23,928 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 6 treesize of output 5 [2024-11-09 07:59:23,986 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 11 treesize of output 7 [2024-11-09 07:59:23,995 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 11 treesize of output 7 [2024-11-09 07:59:24,079 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:59:24,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-11-09 07:59:24,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:59:24,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:59:24,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:59:24,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:59:24,272 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:59:24,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:59:24,305 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:59:24,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-09 07:59:24,399 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:59:24,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-09 07:59:24,420 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:59:24,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:59:24,462 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:59:24,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2024-11-09 07:59:24,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:59:24,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:59:24,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:24,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:59:24,607 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 7 treesize of output 3 [2024-11-09 07:59:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:24,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:24,698 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_841 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_840 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2024-11-09 07:59:24,725 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_840 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_841 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_841) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2024-11-09 07:59:28,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:28,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:28,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2024-11-09 07:59:28,173 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 36 treesize of output 24 [2024-11-09 07:59:28,175 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 7 treesize of output 3 [2024-11-09 07:59:28,180 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:28,181 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:28,183 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-09 07:59:28,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2024-11-09 07:59:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:31,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728217749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:59:31,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:59:31,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2024-11-09 07:59:31,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388075091] [2024-11-09 07:59:31,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:59:31,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 07:59:31,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:59:31,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 07:59:31,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=674, Unknown=16, NotChecked=110, Total=930 [2024-11-09 07:59:31,371 INFO L87 Difference]: Start difference. First operand 247 states and 283 transitions. Second operand has 31 states, 31 states have (on average 3.225806451612903) internal successors, (100), 31 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-11-09 07:59:35,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:59:39,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:59:43,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:59:47,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:59:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:59:49,899 INFO L93 Difference]: Finished difference Result 389 states and 440 transitions. [2024-11-09 07:59:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 07:59:49,900 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.225806451612903) internal successors, (100), 31 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) Word has length 37 [2024-11-09 07:59:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:59:49,900 INFO L225 Difference]: With dead ends: 389 [2024-11-09 07:59:49,900 INFO L226 Difference]: Without dead ends: 389 [2024-11-09 07:59:49,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=546, Invalid=2415, Unknown=17, NotChecked=214, Total=3192 [2024-11-09 07:59:49,902 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 668 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 110 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 577 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:59:49,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1229 Invalid, 2152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1461 Invalid, 4 Unknown, 577 Unchecked, 17.3s Time] [2024-11-09 07:59:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-09 07:59:49,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 277. [2024-11-09 07:59:49,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 256 states have (on average 1.25390625) internal successors, (321), 276 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:59:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 321 transitions. [2024-11-09 07:59:49,906 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 321 transitions. Word has length 37 [2024-11-09 07:59:49,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:59:49,906 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 321 transitions. [2024-11-09 07:59:49,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.225806451612903) internal successors, (100), 31 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-11-09 07:59:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 321 transitions. [2024-11-09 07:59:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:59:49,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:59:49,908 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:59:49,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:59:50,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 07:59:50,108 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2024-11-09 07:59:50,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:59:50,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1501701986, now seen corresponding path program 1 times [2024-11-09 07:59:50,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:59:50,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926223914] [2024-11-09 07:59:50,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:50,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:59:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:50,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:59:50,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926223914] [2024-11-09 07:59:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926223914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:59:50,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244496384] [2024-11-09 07:59:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:59:50,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:59:50,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:59:50,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:59:50,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:59:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:59:50,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 07:59:50,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:59:50,900 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 6 treesize of output 5 [2024-11-09 07:59:50,960 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:59:50,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:59:51,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2024-11-09 07:59:51,200 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:59:51,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 07:59:51,333 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-09 07:59:51,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-09 07:59:51,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:59:51,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-09 07:59:51,576 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:59:51,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 38 [2024-11-09 07:59:51,726 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:59:51,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 38 [2024-11-09 07:59:51,751 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:59:51,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 54 [2024-11-09 07:59:52,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:59:52,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2024-11-09 07:59:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:59:52,092 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:59:52,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_959 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_73| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_18| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| 1) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_73| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_959) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_73|))) is different from false [2024-11-09 07:59:52,320 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_959 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_73| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_18| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|) 0)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_73|) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_953))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_73| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_959) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1))) is different from false [2024-11-09 07:59:56,391 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:56,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:59:56,396 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-09 07:59:56,400 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 52 treesize of output 48 [2024-11-09 07:59:56,403 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:56,405 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-11-09 07:59:56,408 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:59:56,409 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 26 treesize of output 18 [2024-11-09 08:00:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 08:00:04,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244496384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 08:00:04,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 08:00:04,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 39 [2024-11-09 08:00:04,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506464441] [2024-11-09 08:00:04,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 08:00:04,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 08:00:04,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 08:00:04,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 08:00:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1190, Unknown=11, NotChecked=146, Total=1560 [2024-11-09 08:00:04,624 INFO L87 Difference]: Start difference. First operand 277 states and 321 transitions. Second operand has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 08:00:14,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 08:00:18,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 08:00:22,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 08:00:26,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 08:00:38,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 08:00:43,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]