./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_stack.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 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:44:00,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:44:00,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:44:00,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:44:00,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:44:00,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:44:00,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:44:00,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:44:00,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:44:00,889 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:44:00,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:44:00,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:44:00,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:44:00,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:44:00,891 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:44:00,892 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:44:00,893 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:44:00,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:44:00,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:44:00,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:44:00,894 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:44:00,898 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:44:00,898 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:44:00,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:44:00,898 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:44:00,899 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:44:00,899 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:44:00,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:44:00,899 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:44:00,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:44:00,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:44:00,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:44:00,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:44:00,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:44:00,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:44:00,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:44:00,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:44:00,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:44:00,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:44:00,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:44:00,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:44:00,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:44:00,903 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 -> 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c [2024-11-19 06:44:01,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:44:01,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:44:01,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:44:01,222 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:44:01,223 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:44:01,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2024-11-19 06:44:02,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:44:02,945 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:44:02,946 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2024-11-19 06:44:02,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db5b41684/5d639d94729c4a1ab32afaa5dcbafdda/FLAGd84b08be1 [2024-11-19 06:44:03,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db5b41684/5d639d94729c4a1ab32afaa5dcbafdda [2024-11-19 06:44:03,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:44:03,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:44:03,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:44:03,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:44:03,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:44:03,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ea84cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03, skipping insertion in model container [2024-11-19 06:44:03,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:44:03,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:44:03,721 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:44:03,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:44:03,823 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:44:03,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03 WrapperNode [2024-11-19 06:44:03,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:44:03,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:44:03,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:44:03,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:44:03,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,879 INFO L138 Inliner]: procedures = 123, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 143 [2024-11-19 06:44:03,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:44:03,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:44:03,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:44:03,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:44:03,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,918 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 14 writes are split as follows [0, 14]. [2024-11-19 06:44:03,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:44:03,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:44:03,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:44:03,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:44:03,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03" (1/1) ... [2024-11-19 06:44:03,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:44:03,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:44:03,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:44:03,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:44:04,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:44:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:44:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:44:04,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:44:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:44:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:44:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:44:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:44:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:44:04,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:44:04,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:44:04,262 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:44:04,265 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:44:04,687 INFO L? ?]: Removed 157 outVars from TransFormulas that were not future-live. [2024-11-19 06:44:04,687 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:44:04,707 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:44:04,708 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-19 06:44:04,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:44:04 BoogieIcfgContainer [2024-11-19 06:44:04,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:44:04,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:44:04,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:44:04,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:44:04,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:44:03" (1/3) ... [2024-11-19 06:44:04,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:44:04, skipping insertion in model container [2024-11-19 06:44:04,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:44:03" (2/3) ... [2024-11-19 06:44:04,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:44:04, skipping insertion in model container [2024-11-19 06:44:04,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:44:04" (3/3) ... [2024-11-19 06:44:04,715 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_stack.i [2024-11-19 06:44:04,733 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:44:04,733 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-11-19 06:44:04,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:44:04,786 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;@687164e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:44:04,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2024-11-19 06:44:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 70 states have (on average 2.157142857142857) internal successors, (151), 137 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:44:04,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:04,800 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:44:04,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:04,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:04,809 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-19 06:44:04,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:04,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968313299] [2024-11-19 06:44:04,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:04,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:05,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:05,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968313299] [2024-11-19 06:44:05,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968313299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:05,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:05,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:44:05,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132661197] [2024-11-19 06:44:05,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:05,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:44:05,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:05,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:44:05,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:05,063 INFO L87 Difference]: Start difference. First operand has 138 states, 70 states have (on average 2.157142857142857) internal successors, (151), 137 states have internal predecessors, (151), 0 states have call successors, (0), 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-19 06:44:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:05,234 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2024-11-19 06:44:05,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:44:05,237 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-19 06:44:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:05,245 INFO L225 Difference]: With dead ends: 136 [2024-11-19 06:44:05,246 INFO L226 Difference]: Without dead ends: 134 [2024-11-19 06:44:05,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:05,255 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 82 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:05,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 130 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-19 06:44:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-19 06:44:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 133 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2024-11-19 06:44:05,297 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 3 [2024-11-19 06:44:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:05,297 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2024-11-19 06:44:05,298 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-19 06:44:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2024-11-19 06:44:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 06:44:05,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:05,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 06:44:05,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:44:05,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:05,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-19 06:44:05,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:05,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523547149] [2024-11-19 06:44:05,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:05,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:05,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:05,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523547149] [2024-11-19 06:44:05,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523547149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:05,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:05,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:44:05,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330492789] [2024-11-19 06:44:05,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:05,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:44:05,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:05,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:44:05,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:05,406 INFO L87 Difference]: Start difference. First operand 134 states and 144 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-19 06:44:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:05,520 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2024-11-19 06:44:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:44:05,520 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-19 06:44:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:05,523 INFO L225 Difference]: With dead ends: 132 [2024-11-19 06:44:05,524 INFO L226 Difference]: Without dead ends: 132 [2024-11-19 06:44:05,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:05,527 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 82 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:05,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 132 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-19 06:44:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-19 06:44:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 131 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2024-11-19 06:44:05,542 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 3 [2024-11-19 06:44:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:05,543 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2024-11-19 06:44:05,543 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-19 06:44:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2024-11-19 06:44:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:44:05,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:05,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:05,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:44:05,544 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:05,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:05,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031021, now seen corresponding path program 1 times [2024-11-19 06:44:05,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:05,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037481750] [2024-11-19 06:44:05,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:05,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:05,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:05,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037481750] [2024-11-19 06:44:05,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037481750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:05,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:05,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:44:05,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347126422] [2024-11-19 06:44:05,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:05,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:44:05,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:05,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:44:05,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:44:05,664 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:05,899 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2024-11-19 06:44:05,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:44:05,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:44:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:05,902 INFO L225 Difference]: With dead ends: 139 [2024-11-19 06:44:05,904 INFO L226 Difference]: Without dead ends: 139 [2024-11-19 06:44:05,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:05,923 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 150 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:05,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 121 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:44:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-19 06:44:05,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 118. [2024-11-19 06:44:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2024-11-19 06:44:05,933 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 7 [2024-11-19 06:44:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:05,933 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2024-11-19 06:44:05,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2024-11-19 06:44:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:44:05,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:05,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:05,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:44:05,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:05,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:05,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031022, now seen corresponding path program 1 times [2024-11-19 06:44:05,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:05,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164761027] [2024-11-19 06:44:05,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:05,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:06,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:06,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164761027] [2024-11-19 06:44:06,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164761027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:06,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:06,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:44:06,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730644262] [2024-11-19 06:44:06,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:06,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:44:06,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:06,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:44:06,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:44:06,158 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:06,383 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2024-11-19 06:44:06,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:44:06,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:44:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:06,385 INFO L225 Difference]: With dead ends: 175 [2024-11-19 06:44:06,385 INFO L226 Difference]: Without dead ends: 175 [2024-11-19 06:44:06,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:06,388 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 168 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:06,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 184 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:44:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-19 06:44:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 148. [2024-11-19 06:44:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 100 states have (on average 1.71) internal successors, (171), 147 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-19 06:44:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 171 transitions. [2024-11-19 06:44:06,411 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 171 transitions. Word has length 7 [2024-11-19 06:44:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:06,412 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 171 transitions. [2024-11-19 06:44:06,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 171 transitions. [2024-11-19 06:44:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:44:06,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:06,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:06,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:44:06,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:06,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash 59388299, now seen corresponding path program 1 times [2024-11-19 06:44:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:06,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325668672] [2024-11-19 06:44:06,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:06,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:06,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325668672] [2024-11-19 06:44:06,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325668672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:06,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:06,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:44:06,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893904937] [2024-11-19 06:44:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:06,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:44:06,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:06,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:44:06,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:06,520 INFO L87 Difference]: Start difference. First operand 148 states and 171 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:06,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:06,600 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2024-11-19 06:44:06,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:44:06,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 06:44:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:06,603 INFO L225 Difference]: With dead ends: 148 [2024-11-19 06:44:06,603 INFO L226 Difference]: Without dead ends: 148 [2024-11-19 06:44:06,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:06,605 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 3 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:06,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 181 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:06,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-19 06:44:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-19 06:44:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 102 states have (on average 1.696078431372549) internal successors, (173), 147 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2024-11-19 06:44:06,620 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 8 [2024-11-19 06:44:06,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:06,620 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2024-11-19 06:44:06,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2024-11-19 06:44:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 06:44:06,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:06,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:06,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:44:06,622 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:06,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:06,623 INFO L85 PathProgramCache]: Analyzing trace with hash 59388300, now seen corresponding path program 1 times [2024-11-19 06:44:06,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:06,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388379767] [2024-11-19 06:44:06,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:06,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:06,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:06,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:06,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388379767] [2024-11-19 06:44:06,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388379767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:06,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:06,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:44:06,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239257223] [2024-11-19 06:44:06,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:06,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:44:06,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:06,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:44:06,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:06,718 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:06,804 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2024-11-19 06:44:06,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:44:06,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-19 06:44:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:06,806 INFO L225 Difference]: With dead ends: 146 [2024-11-19 06:44:06,806 INFO L226 Difference]: Without dead ends: 146 [2024-11-19 06:44:06,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:06,807 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 3 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:06,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 172 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:06,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-19 06:44:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-19 06:44:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.6666666666666667) 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-19 06:44:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2024-11-19 06:44:06,820 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 8 [2024-11-19 06:44:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:06,820 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2024-11-19 06:44:06,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2024-11-19 06:44:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:44:06,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:06,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:06,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:44:06,824 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:06,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:06,825 INFO L85 PathProgramCache]: Analyzing trace with hash -387876619, now seen corresponding path program 1 times [2024-11-19 06:44:06,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:06,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069723103] [2024-11-19 06:44:06,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:06,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:06,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:06,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069723103] [2024-11-19 06:44:06,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069723103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:06,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:06,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:44:06,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943598091] [2024-11-19 06:44:06,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:06,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:44:06,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:06,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:44:06,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:06,881 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-19 06:44:06,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:06,901 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2024-11-19 06:44:06,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:44:06,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-19 06:44:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:06,902 INFO L225 Difference]: With dead ends: 146 [2024-11-19 06:44:06,902 INFO L226 Difference]: Without dead ends: 146 [2024-11-19 06:44:06,903 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-19 06:44:06,903 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:06,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 228 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:44:06,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-19 06:44:06,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-19 06:44:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 145 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-19 06:44:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2024-11-19 06:44:06,914 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 12 [2024-11-19 06:44:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:06,915 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2024-11-19 06:44:06,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-19 06:44:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2024-11-19 06:44:06,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:44:06,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:06,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:06,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:44:06,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:06,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:06,916 INFO L85 PathProgramCache]: Analyzing trace with hash 860725951, now seen corresponding path program 1 times [2024-11-19 06:44:06,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:06,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783665462] [2024-11-19 06:44:06,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:06,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:07,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:07,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:07,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783665462] [2024-11-19 06:44:07,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783665462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:07,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:07,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:44:07,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022989367] [2024-11-19 06:44:07,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:07,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:44:07,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:07,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:44:07,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:07,022 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:07,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:07,182 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2024-11-19 06:44:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:44:07,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-19 06:44:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:07,184 INFO L225 Difference]: With dead ends: 153 [2024-11-19 06:44:07,184 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 06:44:07,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:07,185 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 21 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:07,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 226 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:44:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 06:44:07,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2024-11-19 06:44:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.6057692307692308) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2024-11-19 06:44:07,195 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 13 [2024-11-19 06:44:07,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:07,195 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2024-11-19 06:44:07,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2024-11-19 06:44:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:44:07,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:07,199 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:07,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:44:07,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:07,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash 860725952, now seen corresponding path program 1 times [2024-11-19 06:44:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:07,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212824406] [2024-11-19 06:44:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:07,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:07,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212824406] [2024-11-19 06:44:07,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212824406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:07,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:07,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:44:07,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811704760] [2024-11-19 06:44:07,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:07,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:44:07,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:07,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:44:07,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:44:07,388 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:07,539 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2024-11-19 06:44:07,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:44:07,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-19 06:44:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:07,541 INFO L225 Difference]: With dead ends: 155 [2024-11-19 06:44:07,541 INFO L226 Difference]: Without dead ends: 155 [2024-11-19 06:44:07,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:07,542 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 20 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:07,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 204 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:07,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-19 06:44:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2024-11-19 06:44:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 115 states have (on average 1.565217391304348) internal successors, (180), 149 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2024-11-19 06:44:07,546 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 13 [2024-11-19 06:44:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:07,546 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2024-11-19 06:44:07,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2024-11-19 06:44:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 06:44:07,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:07,547 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:07,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:44:07,548 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:07,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:07,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1836248265, now seen corresponding path program 1 times [2024-11-19 06:44:07,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:07,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834230970] [2024-11-19 06:44:07,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:07,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:07,571 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-19 06:44:07,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:07,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834230970] [2024-11-19 06:44:07,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834230970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:07,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:07,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:44:07,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054447869] [2024-11-19 06:44:07,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:07,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:44:07,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:07,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:44:07,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:44:07,573 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:07,583 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2024-11-19 06:44:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:44:07,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-19 06:44:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:07,585 INFO L225 Difference]: With dead ends: 152 [2024-11-19 06:44:07,585 INFO L226 Difference]: Without dead ends: 152 [2024-11-19 06:44:07,585 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-19 06:44:07,586 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 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-19 06:44:07,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:44:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-19 06:44:07,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-19 06:44:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 151 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:07,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 182 transitions. [2024-11-19 06:44:07,590 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 182 transitions. Word has length 14 [2024-11-19 06:44:07,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:07,590 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 182 transitions. [2024-11-19 06:44:07,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2024-11-19 06:44:07,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:44:07,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:07,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:07,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:44:07,592 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:07,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:07,592 INFO L85 PathProgramCache]: Analyzing trace with hash 932171324, now seen corresponding path program 1 times [2024-11-19 06:44:07,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:07,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712095104] [2024-11-19 06:44:07,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:07,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:07,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:07,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712095104] [2024-11-19 06:44:07,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712095104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:07,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:07,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:44:07,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019237585] [2024-11-19 06:44:07,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:07,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:44:07,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:07,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:44:07,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:07,674 INFO L87 Difference]: Start difference. First operand 152 states and 182 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-19 06:44:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:07,749 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2024-11-19 06:44:07,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:44:07,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-19 06:44:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:07,753 INFO L225 Difference]: With dead ends: 158 [2024-11-19 06:44:07,753 INFO L226 Difference]: Without dead ends: 158 [2024-11-19 06:44:07,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:44:07,754 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 19 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:07,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 292 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-19 06:44:07,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153. [2024-11-19 06:44:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 152 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2024-11-19 06:44:07,758 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 16 [2024-11-19 06:44:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:07,759 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2024-11-19 06:44:07,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-19 06:44:07,759 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2024-11-19 06:44:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:44:07,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:07,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:07,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:44:07,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:07,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:07,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1356387674, now seen corresponding path program 1 times [2024-11-19 06:44:07,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:07,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854901105] [2024-11-19 06:44:07,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:07,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:07,957 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-19 06:44:07,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:07,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854901105] [2024-11-19 06:44:07,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854901105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:07,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:07,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:44:07,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592720801] [2024-11-19 06:44:07,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:07,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:44:07,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:07,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:44:07,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:44:07,961 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) 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-19 06:44:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:08,150 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2024-11-19 06:44:08,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:44:08,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) 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-19 06:44:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:08,151 INFO L225 Difference]: With dead ends: 184 [2024-11-19 06:44:08,152 INFO L226 Difference]: Without dead ends: 184 [2024-11-19 06:44:08,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:44:08,152 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 44 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:08,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 436 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-19 06:44:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 167. [2024-11-19 06:44:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 166 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 202 transitions. [2024-11-19 06:44:08,156 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 202 transitions. Word has length 16 [2024-11-19 06:44:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:08,157 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 202 transitions. [2024-11-19 06:44:08,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) 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-19 06:44:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 202 transitions. [2024-11-19 06:44:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:44:08,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:08,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:08,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:44:08,158 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:08,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:08,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1831516449, now seen corresponding path program 1 times [2024-11-19 06:44:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:08,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881590734] [2024-11-19 06:44:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:08,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:08,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881590734] [2024-11-19 06:44:08,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881590734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:08,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:08,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:44:08,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115730235] [2024-11-19 06:44:08,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:08,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:44:08,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:08,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:44:08,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:44:08,554 INFO L87 Difference]: Start difference. First operand 167 states and 202 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:09,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:09,007 INFO L93 Difference]: Finished difference Result 184 states and 222 transitions. [2024-11-19 06:44:09,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 06:44:09,007 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:44:09,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:09,008 INFO L225 Difference]: With dead ends: 184 [2024-11-19 06:44:09,008 INFO L226 Difference]: Without dead ends: 184 [2024-11-19 06:44:09,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:44:09,009 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 205 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:09,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 270 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:44:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-19 06:44:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 172. [2024-11-19 06:44:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 171 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 208 transitions. [2024-11-19 06:44:09,017 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 208 transitions. Word has length 18 [2024-11-19 06:44:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:09,019 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 208 transitions. [2024-11-19 06:44:09,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 208 transitions. [2024-11-19 06:44:09,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:44:09,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:09,020 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:09,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:44:09,021 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:09,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:09,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1831516448, now seen corresponding path program 1 times [2024-11-19 06:44:09,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:09,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145420499] [2024-11-19 06:44:09,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:09,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:09,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:09,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145420499] [2024-11-19 06:44:09,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145420499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:09,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:09,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:44:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453104487] [2024-11-19 06:44:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:09,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:44:09,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:09,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:44:09,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:44:09,455 INFO L87 Difference]: Start difference. First operand 172 states and 208 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:10,058 INFO L93 Difference]: Finished difference Result 205 states and 239 transitions. [2024-11-19 06:44:10,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:44:10,059 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:44:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:10,060 INFO L225 Difference]: With dead ends: 205 [2024-11-19 06:44:10,060 INFO L226 Difference]: Without dead ends: 205 [2024-11-19 06:44:10,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-11-19 06:44:10,062 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 280 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:10,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 346 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:44:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-19 06:44:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 187. [2024-11-19 06:44:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.480263157894737) internal successors, (225), 186 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2024-11-19 06:44:10,068 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 18 [2024-11-19 06:44:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:10,069 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2024-11-19 06:44:10,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2024-11-19 06:44:10,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:44:10,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:10,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:10,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 06:44:10,071 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:10,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:10,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793954, now seen corresponding path program 1 times [2024-11-19 06:44:10,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:10,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576784611] [2024-11-19 06:44:10,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:10,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:10,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:10,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576784611] [2024-11-19 06:44:10,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576784611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:10,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:10,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:44:10,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025926568] [2024-11-19 06:44:10,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:10,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:44:10,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:10,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:44:10,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:10,145 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:10,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:10,279 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2024-11-19 06:44:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:44:10,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:44:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:10,280 INFO L225 Difference]: With dead ends: 186 [2024-11-19 06:44:10,280 INFO L226 Difference]: Without dead ends: 186 [2024-11-19 06:44:10,280 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-19 06:44:10,281 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 3 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:10,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 273 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:10,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-19 06:44:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-19 06:44:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 185 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 223 transitions. [2024-11-19 06:44:10,285 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 223 transitions. Word has length 18 [2024-11-19 06:44:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:10,285 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 223 transitions. [2024-11-19 06:44:10,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 223 transitions. [2024-11-19 06:44:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 06:44:10,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:10,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:10,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:44:10,286 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:10,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:10,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793955, now seen corresponding path program 1 times [2024-11-19 06:44:10,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:10,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636926564] [2024-11-19 06:44:10,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:10,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:10,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:10,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636926564] [2024-11-19 06:44:10,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636926564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:10,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:10,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:44:10,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918346955] [2024-11-19 06:44:10,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:10,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:44:10,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:10,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:44:10,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:10,443 INFO L87 Difference]: Start difference. First operand 186 states and 223 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:10,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:10,604 INFO L93 Difference]: Finished difference Result 185 states and 221 transitions. [2024-11-19 06:44:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:44:10,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-19 06:44:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:10,606 INFO L225 Difference]: With dead ends: 185 [2024-11-19 06:44:10,606 INFO L226 Difference]: Without dead ends: 185 [2024-11-19 06:44:10,606 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-19 06:44:10,606 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 2 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:10,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 255 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-19 06:44:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-19 06:44:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.4539473684210527) internal successors, (221), 184 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 221 transitions. [2024-11-19 06:44:10,611 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 221 transitions. Word has length 18 [2024-11-19 06:44:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:10,611 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 221 transitions. [2024-11-19 06:44:10,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2024-11-19 06:44:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:44:10,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:10,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:10,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:44:10,612 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:10,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983029, now seen corresponding path program 1 times [2024-11-19 06:44:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:10,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179541869] [2024-11-19 06:44:10,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:10,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:10,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179541869] [2024-11-19 06:44:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179541869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:10,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:44:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287014933] [2024-11-19 06:44:10,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:10,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:44:10,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:10,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:44:10,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:44:10,805 INFO L87 Difference]: Start difference. First operand 185 states and 221 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:11,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:11,041 INFO L93 Difference]: Finished difference Result 196 states and 233 transitions. [2024-11-19 06:44:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:44:11,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-19 06:44:11,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:11,043 INFO L225 Difference]: With dead ends: 196 [2024-11-19 06:44:11,043 INFO L226 Difference]: Without dead ends: 196 [2024-11-19 06:44:11,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:44:11,044 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:11,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 228 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:44:11,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-19 06:44:11,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 184. [2024-11-19 06:44:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 183 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 219 transitions. [2024-11-19 06:44:11,047 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 219 transitions. Word has length 21 [2024-11-19 06:44:11,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:11,048 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 219 transitions. [2024-11-19 06:44:11,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 219 transitions. [2024-11-19 06:44:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 06:44:11,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:11,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:11,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:44:11,049 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:11,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983030, now seen corresponding path program 1 times [2024-11-19 06:44:11,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:11,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054185059] [2024-11-19 06:44:11,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:11,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:11,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:11,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054185059] [2024-11-19 06:44:11,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054185059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:11,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:11,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:44:11,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682857846] [2024-11-19 06:44:11,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:11,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:44:11,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:11,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:44:11,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:44:11,327 INFO L87 Difference]: Start difference. First operand 184 states and 219 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:11,685 INFO L93 Difference]: Finished difference Result 195 states and 231 transitions. [2024-11-19 06:44:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:44:11,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-19 06:44:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:11,686 INFO L225 Difference]: With dead ends: 195 [2024-11-19 06:44:11,686 INFO L226 Difference]: Without dead ends: 195 [2024-11-19 06:44:11,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:44:11,687 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 53 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:11,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 317 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:44:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-19 06:44:11,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 183. [2024-11-19 06:44:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 152 states have (on average 1.4276315789473684) internal successors, (217), 182 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2024-11-19 06:44:11,691 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 21 [2024-11-19 06:44:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:11,691 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2024-11-19 06:44:11,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2024-11-19 06:44:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:44:11,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:11,692 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-19 06:44:11,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:44:11,693 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:11,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:11,693 INFO L85 PathProgramCache]: Analyzing trace with hash 27790463, now seen corresponding path program 1 times [2024-11-19 06:44:11,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:11,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188173070] [2024-11-19 06:44:11,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:11,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:11,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:11,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188173070] [2024-11-19 06:44:11,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188173070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:11,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:11,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:44:11,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294383157] [2024-11-19 06:44:11,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:11,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:44:11,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:11,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:44:11,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:11,773 INFO L87 Difference]: Start difference. First operand 183 states and 217 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-19 06:44:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:11,899 INFO L93 Difference]: Finished difference Result 182 states and 215 transitions. [2024-11-19 06:44:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:44:11,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-19 06:44:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:11,901 INFO L225 Difference]: With dead ends: 182 [2024-11-19 06:44:11,901 INFO L226 Difference]: Without dead ends: 182 [2024-11-19 06:44:11,901 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-19 06:44:11,901 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 3 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:11,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 263 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-19 06:44:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-11-19 06:44:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 152 states have (on average 1.4144736842105263) internal successors, (215), 181 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2024-11-19 06:44:11,905 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 22 [2024-11-19 06:44:11,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:11,906 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2024-11-19 06:44:11,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-19 06:44:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2024-11-19 06:44:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 06:44:11,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:11,907 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-19 06:44:11,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:44:11,907 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:11,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:11,907 INFO L85 PathProgramCache]: Analyzing trace with hash 27790464, now seen corresponding path program 1 times [2024-11-19 06:44:11,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:11,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195240694] [2024-11-19 06:44:11,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:11,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:12,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:12,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195240694] [2024-11-19 06:44:12,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195240694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:12,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:12,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:44:12,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836750247] [2024-11-19 06:44:12,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:12,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:44:12,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:12,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:44:12,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:12,055 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-19 06:44:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:12,203 INFO L93 Difference]: Finished difference Result 181 states and 213 transitions. [2024-11-19 06:44:12,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:44:12,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-19 06:44:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:12,204 INFO L225 Difference]: With dead ends: 181 [2024-11-19 06:44:12,204 INFO L226 Difference]: Without dead ends: 181 [2024-11-19 06:44:12,204 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-19 06:44:12,205 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:12,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 245 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-19 06:44:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-19 06:44:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2024-11-19 06:44:12,209 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 22 [2024-11-19 06:44:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:12,210 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2024-11-19 06:44:12,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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-19 06:44:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2024-11-19 06:44:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 06:44:12,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:12,211 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-19 06:44:12,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 06:44:12,211 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:12,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash -496178395, now seen corresponding path program 1 times [2024-11-19 06:44:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:12,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147224721] [2024-11-19 06:44:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:12,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:12,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147224721] [2024-11-19 06:44:12,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147224721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:12,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:12,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 06:44:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362265559] [2024-11-19 06:44:12,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:12,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:44:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:12,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:44:12,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:44:12,459 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 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-19 06:44:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:12,820 INFO L93 Difference]: Finished difference Result 195 states and 229 transitions. [2024-11-19 06:44:12,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:44:12,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 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-19 06:44:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:12,822 INFO L225 Difference]: With dead ends: 195 [2024-11-19 06:44:12,822 INFO L226 Difference]: Without dead ends: 195 [2024-11-19 06:44:12,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-11-19 06:44:12,823 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 163 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:12,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 417 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:44:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-19 06:44:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 183. [2024-11-19 06:44:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 154 states have (on average 1.396103896103896) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2024-11-19 06:44:12,829 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 23 [2024-11-19 06:44:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:12,830 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2024-11-19 06:44:12,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 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-19 06:44:12,830 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2024-11-19 06:44:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:44:12,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:12,830 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-19 06:44:12,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 06:44:12,831 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:12,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:12,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919462, now seen corresponding path program 1 times [2024-11-19 06:44:12,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:12,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673973486] [2024-11-19 06:44:12,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:12,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:12,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:12,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673973486] [2024-11-19 06:44:12,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673973486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:12,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:12,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:44:12,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218080120] [2024-11-19 06:44:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:12,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:44:12,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:12,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:44:12,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:44:12,994 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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-19 06:44:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:13,191 INFO L93 Difference]: Finished difference Result 194 states and 228 transitions. [2024-11-19 06:44:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:44:13,193 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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-19 06:44:13,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:13,194 INFO L225 Difference]: With dead ends: 194 [2024-11-19 06:44:13,194 INFO L226 Difference]: Without dead ends: 194 [2024-11-19 06:44:13,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:44:13,195 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 46 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:13,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 217 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:44:13,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-19 06:44:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2024-11-19 06:44:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 181 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 214 transitions. [2024-11-19 06:44:13,199 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 214 transitions. Word has length 25 [2024-11-19 06:44:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:13,199 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 214 transitions. [2024-11-19 06:44:13,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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-19 06:44:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 214 transitions. [2024-11-19 06:44:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:44:13,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:13,200 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-19 06:44:13,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 06:44:13,201 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:13,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919461, now seen corresponding path program 1 times [2024-11-19 06:44:13,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:13,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000898893] [2024-11-19 06:44:13,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:13,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:13,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:13,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000898893] [2024-11-19 06:44:13,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000898893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:13,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:13,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:44:13,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201889799] [2024-11-19 06:44:13,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:13,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:44:13,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:13,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:44:13,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:44:13,440 INFO L87 Difference]: Start difference. First operand 182 states and 214 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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-19 06:44:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:13,753 INFO L93 Difference]: Finished difference Result 193 states and 227 transitions. [2024-11-19 06:44:13,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:44:13,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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-19 06:44:13,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:13,754 INFO L225 Difference]: With dead ends: 193 [2024-11-19 06:44:13,754 INFO L226 Difference]: Without dead ends: 193 [2024-11-19 06:44:13,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:44:13,755 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 46 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:13,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 307 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:44:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-19 06:44:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 181. [2024-11-19 06:44:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2024-11-19 06:44:13,759 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 25 [2024-11-19 06:44:13,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:13,759 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2024-11-19 06:44:13,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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-19 06:44:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2024-11-19 06:44:13,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:44:13,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:13,760 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-19 06:44:13,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 06:44:13,761 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:13,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:13,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1627096903, now seen corresponding path program 1 times [2024-11-19 06:44:13,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:13,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222810040] [2024-11-19 06:44:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:13,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:13,899 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-19 06:44:13,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222810040] [2024-11-19 06:44:13,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222810040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:44:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604010307] [2024-11-19 06:44:13,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:13,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:44:13,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:44:13,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:44:13,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:44:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:14,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 06:44:14,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:44:14,071 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-19 06:44:14,075 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-19 06:44:14,093 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-19 06:44:14,101 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 27 treesize of output 11 [2024-11-19 06:44:14,162 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-19 06:44:14,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:44:14,226 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-19 06:44:14,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604010307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:44:14,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:44:14,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-19 06:44:14,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8275234] [2024-11-19 06:44:14,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:44:14,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:44:14,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:14,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:44:14,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:14,229 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:14,293 INFO L93 Difference]: Finished difference Result 184 states and 216 transitions. [2024-11-19 06:44:14,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:44:14,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-19 06:44:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:14,294 INFO L225 Difference]: With dead ends: 184 [2024-11-19 06:44:14,295 INFO L226 Difference]: Without dead ends: 184 [2024-11-19 06:44:14,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:44:14,295 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 2 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:14,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 356 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-19 06:44:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2024-11-19 06:44:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2024-11-19 06:44:14,299 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 26 [2024-11-19 06:44:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:14,299 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2024-11-19 06:44:14,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2024-11-19 06:44:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:44:14,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:14,300 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] [2024-11-19 06:44:14,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:44:14,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-19 06:44:14,501 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:14,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:14,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1099603412, now seen corresponding path program 1 times [2024-11-19 06:44:14,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:14,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568185136] [2024-11-19 06:44:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:14,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:14,825 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-19 06:44:14,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568185136] [2024-11-19 06:44:14,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568185136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:44:14,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941617719] [2024-11-19 06:44:14,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:14,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:44:14,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:44:14,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:44:14,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:44:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:14,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 06:44:14,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:44:15,106 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 15 treesize of output 1 [2024-11-19 06:44:15,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:15,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2024-11-19 06:44:15,345 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:44:15,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2024-11-19 06:44:15,488 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-11-19 06:44:15,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 44 [2024-11-19 06:44:15,564 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-19 06:44:15,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:44:15,803 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 41 treesize of output 37 [2024-11-19 06:44:15,809 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 68 treesize of output 64 [2024-11-19 06:44:16,037 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-19 06:44:16,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941617719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:44:16,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:44:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 29 [2024-11-19 06:44:16,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208654031] [2024-11-19 06:44:16,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:44:16,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-19 06:44:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-19 06:44:16,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2024-11-19 06:44:16,039 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:16,787 INFO L93 Difference]: Finished difference Result 215 states and 249 transitions. [2024-11-19 06:44:16,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:44:16,788 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-19 06:44:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:16,789 INFO L225 Difference]: With dead ends: 215 [2024-11-19 06:44:16,789 INFO L226 Difference]: Without dead ends: 209 [2024-11-19 06:44:16,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 06:44:16,790 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 67 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:16,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 846 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 918 Invalid, 1 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 06:44:16,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-19 06:44:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 198. [2024-11-19 06:44:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 197 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2024-11-19 06:44:16,794 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 27 [2024-11-19 06:44:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:16,794 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2024-11-19 06:44:16,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2024-11-19 06:44:16,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:44:16,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:16,795 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] [2024-11-19 06:44:16,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:44:16,996 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,SelfDestructingSolverStorable24 [2024-11-19 06:44:16,996 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:16,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:16,997 INFO L85 PathProgramCache]: Analyzing trace with hash -466107059, now seen corresponding path program 1 times [2024-11-19 06:44:16,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:16,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136050717] [2024-11-19 06:44:16,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:16,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:17,110 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-19 06:44:17,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:17,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136050717] [2024-11-19 06:44:17,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136050717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:17,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:17,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:44:17,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465455614] [2024-11-19 06:44:17,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:17,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:44:17,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:17,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:44:17,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:44:17,113 INFO L87 Difference]: Start difference. First operand 198 states and 231 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:17,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:17,346 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2024-11-19 06:44:17,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:44:17,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-19 06:44:17,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:17,347 INFO L225 Difference]: With dead ends: 223 [2024-11-19 06:44:17,347 INFO L226 Difference]: Without dead ends: 223 [2024-11-19 06:44:17,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:44:17,348 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 71 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:17,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 190 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:44:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-19 06:44:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 198. [2024-11-19 06:44:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.345029239766082) internal successors, (230), 197 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 230 transitions. [2024-11-19 06:44:17,352 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 230 transitions. Word has length 30 [2024-11-19 06:44:17,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:17,352 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 230 transitions. [2024-11-19 06:44:17,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 230 transitions. [2024-11-19 06:44:17,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:44:17,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:17,353 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-19 06:44:17,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 06:44:17,354 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:17,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:17,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1564416794, now seen corresponding path program 1 times [2024-11-19 06:44:17,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:17,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000183861] [2024-11-19 06:44:17,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:17,406 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-19 06:44:17,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:17,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000183861] [2024-11-19 06:44:17,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000183861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:17,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:17,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:44:17,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29790772] [2024-11-19 06:44:17,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:17,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:44:17,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:17,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:44:17,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:44:17,409 INFO L87 Difference]: Start difference. First operand 198 states and 230 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:17,465 INFO L93 Difference]: Finished difference Result 204 states and 232 transitions. [2024-11-19 06:44:17,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:44:17,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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-19 06:44:17,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:17,467 INFO L225 Difference]: With dead ends: 204 [2024-11-19 06:44:17,467 INFO L226 Difference]: Without dead ends: 204 [2024-11-19 06:44:17,467 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-19 06:44:17,468 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 20 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:17,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 270 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:44:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-19 06:44:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 198. [2024-11-19 06:44:17,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 197 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:17,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 229 transitions. [2024-11-19 06:44:17,472 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 229 transitions. Word has length 31 [2024-11-19 06:44:17,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:17,472 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 229 transitions. [2024-11-19 06:44:17,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 229 transitions. [2024-11-19 06:44:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 06:44:17,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:17,473 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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-19 06:44:17,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 06:44:17,473 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:17,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:17,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1252281106, now seen corresponding path program 1 times [2024-11-19 06:44:17,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:17,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062748503] [2024-11-19 06:44:17,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:17,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:44:17,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062748503] [2024-11-19 06:44:17,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062748503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:17,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:17,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:44:17,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189718723] [2024-11-19 06:44:17,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:17,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:44:17,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:17,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:44:17,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:44:17,528 INFO L87 Difference]: Start difference. First operand 198 states and 229 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:17,613 INFO L93 Difference]: Finished difference Result 197 states and 227 transitions. [2024-11-19 06:44:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:44:17,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-19 06:44:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:17,614 INFO L225 Difference]: With dead ends: 197 [2024-11-19 06:44:17,614 INFO L226 Difference]: Without dead ends: 197 [2024-11-19 06:44:17,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:44:17,615 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 13 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:17,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 191 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:44:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-19 06:44:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-19 06:44:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 171 states have (on average 1.327485380116959) internal successors, (227), 196 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:17,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 227 transitions. [2024-11-19 06:44:17,619 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 227 transitions. Word has length 32 [2024-11-19 06:44:17,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:17,619 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 227 transitions. [2024-11-19 06:44:17,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 227 transitions. [2024-11-19 06:44:17,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:44:17,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:17,620 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:17,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 06:44:17,620 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:17,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:17,621 INFO L85 PathProgramCache]: Analyzing trace with hash 821443088, now seen corresponding path program 1 times [2024-11-19 06:44:17,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:17,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467566017] [2024-11-19 06:44:17,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:17,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:18,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:18,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467566017] [2024-11-19 06:44:18,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467566017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:18,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:18,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 06:44:18,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089982745] [2024-11-19 06:44:18,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:18,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:44:18,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:44:18,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:44:18,302 INFO L87 Difference]: Start difference. First operand 197 states and 227 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:18,854 INFO L93 Difference]: Finished difference Result 230 states and 263 transitions. [2024-11-19 06:44:18,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 06:44:18,854 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-19 06:44:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:18,855 INFO L225 Difference]: With dead ends: 230 [2024-11-19 06:44:18,855 INFO L226 Difference]: Without dead ends: 223 [2024-11-19 06:44:18,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2024-11-19 06:44:18,857 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 227 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:18,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 502 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:44:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-19 06:44:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 195. [2024-11-19 06:44:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 169 states have (on average 1.3254437869822486) internal successors, (224), 194 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 224 transitions. [2024-11-19 06:44:18,864 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 224 transitions. Word has length 37 [2024-11-19 06:44:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:18,864 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 224 transitions. [2024-11-19 06:44:18,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:18,864 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 224 transitions. [2024-11-19 06:44:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 06:44:18,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:18,865 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:18,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 06:44:18,867 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:18,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash 431036240, now seen corresponding path program 1 times [2024-11-19 06:44:18,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:18,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145474705] [2024-11-19 06:44:18,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:18,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:19,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:19,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145474705] [2024-11-19 06:44:19,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145474705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:44:19,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:44:19,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 06:44:19,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097970820] [2024-11-19 06:44:19,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:44:19,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:44:19,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:19,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:44:19,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:44:19,639 INFO L87 Difference]: Start difference. First operand 195 states and 224 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:20,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:20,233 INFO L93 Difference]: Finished difference Result 211 states and 241 transitions. [2024-11-19 06:44:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:44:20,233 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-19 06:44:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:20,234 INFO L225 Difference]: With dead ends: 211 [2024-11-19 06:44:20,234 INFO L226 Difference]: Without dead ends: 186 [2024-11-19 06:44:20,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:44:20,236 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 121 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:20,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 611 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:44:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-19 06:44:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2024-11-19 06:44:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 156 states have (on average 1.3461538461538463) internal successors, (210), 181 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 210 transitions. [2024-11-19 06:44:20,239 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 210 transitions. Word has length 37 [2024-11-19 06:44:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:20,239 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 210 transitions. [2024-11-19 06:44:20,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2024-11-19 06:44:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 06:44:20,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:20,240 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:20,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 06:44:20,241 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:20,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:20,241 INFO L85 PathProgramCache]: Analyzing trace with hash -756843594, now seen corresponding path program 1 times [2024-11-19 06:44:20,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:20,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133430150] [2024-11-19 06:44:20,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:20,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:20,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:20,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133430150] [2024-11-19 06:44:20,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133430150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:44:20,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200402078] [2024-11-19 06:44:20,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:20,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:44:20,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:44:20,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:44:20,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:44:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:21,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 06:44:21,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:44:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:21,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:44:21,476 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-19 06:44:21,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-19 06:44:21,491 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-19 06:44:21,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2024-11-19 06:44:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:21,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200402078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:44:21,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:44:21,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 27 [2024-11-19 06:44:21,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223675504] [2024-11-19 06:44:21,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:44:21,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-19 06:44:21,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:44:21,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 06:44:21,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2024-11-19 06:44:21,566 INFO L87 Difference]: Start difference. First operand 182 states and 210 transitions. Second operand has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:44:23,104 INFO L93 Difference]: Finished difference Result 272 states and 316 transitions. [2024-11-19 06:44:23,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 06:44:23,105 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-19 06:44:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:44:23,106 INFO L225 Difference]: With dead ends: 272 [2024-11-19 06:44:23,106 INFO L226 Difference]: Without dead ends: 272 [2024-11-19 06:44:23,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=649, Invalid=2431, Unknown=0, NotChecked=0, Total=3080 [2024-11-19 06:44:23,108 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 436 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:44:23,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1045 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:44:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-19 06:44:23,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 206. [2024-11-19 06:44:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 180 states have (on average 1.3222222222222222) internal successors, (238), 205 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 238 transitions. [2024-11-19 06:44:23,112 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 238 transitions. Word has length 38 [2024-11-19 06:44:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:44:23,112 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 238 transitions. [2024-11-19 06:44:23,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.740740740740741) internal successors, (74), 27 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:44:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 238 transitions. [2024-11-19 06:44:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-19 06:44:23,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:44:23,113 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:44:23,131 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-19 06:44:23,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:44:23,314 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-19 06:44:23,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:44:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash 734177974, now seen corresponding path program 1 times [2024-11-19 06:44:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:44:23,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507695541] [2024-11-19 06:44:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:44:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:44:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507695541] [2024-11-19 06:44:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507695541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:44:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698312792] [2024-11-19 06:44:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:44:23,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:44:23,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:44:23,830 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:44:23,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:44:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:44:23,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 06:44:23,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:44:24,060 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 06:44:24,061 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-19 06:44:24,102 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 19 treesize of output 1 [2024-11-19 06:44:24,189 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:44:24,189 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 42 treesize of output 41 [2024-11-19 06:44:24,252 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 06:44:24,252 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 42 treesize of output 41 [2024-11-19 06:44:24,361 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 31 treesize of output 13 [2024-11-19 06:44:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:44:24,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:44:24,493 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_985 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_985) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2024-11-19 06:44:24,533 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_985 (Array Int Int)) (v_ArrVal_984 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_984))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_985)) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2024-11-19 06:44:24,541 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_985 (Array Int Int)) (v_ArrVal_984 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_984))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_985))) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |c_ULTIMATE.start_main_~root~0#1.offset| 4))) 1)) is different from false [2024-11-19 06:44:24,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:24,553 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 46 treesize of output 37 [2024-11-19 06:44:24,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:24,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 145 [2024-11-19 06:44:24,570 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 94 treesize of output 86 [2024-11-19 06:44:24,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:24,580 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 86 treesize of output 74 [2024-11-19 06:44:28,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:44:28,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 269 treesize of output 1595